Submonotone mappings and the proximal point algorithm

DOI10.1080/01630568208816109zbMath0495.49025OpenAlexW2027239288MaRDI QIDQ3959022

Jonathan E. Spingarn

Publication date: 1982

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630568208816109

zbMATH Keywords

local convergenceproximal point algorithmnonconvex, nondifferentiable functionstrict hypermonotonicity

Mathematics Subject Classification ID

Monotone operators and generalizations (47H05) Numerical methods based on nonlinear programming (49M37) Methods involving semicontinuity and convergence; relaxation (49J45) Continuity and differentiation questions (26B05) Methods of successive quadratic programming type (90C55) Abstract differentiation theory, differentiation of set functions (28A15)

Related Items (24)

Proximal point algorithm for inclusion problems in Hadamard manifolds with applications ⋮ A new approach to the proximal point method: convergence on general Riemannian manifolds ⋮ Application of the dual active set algorithm to quadratic network optimization ⋮ An algorithmic approach to prox-regular variational inequalities ⋮ A proximal method for composite minimization ⋮ Extended auxiliary problem principle to variational inequalities involving multi-valued operators ⋮ Approximation and decomposition properties of some classes of locally d.c. functions ⋮ Fast Moreau envelope computation I: Numerical algorithms ⋮ Upper-Lipschitz multifunctions and inverse subdifferentials ⋮ How good are the proximal point algorithms? ⋮ On diametrically maximal sets, maximal premonotone operators and premonotone bifunctions ⋮ A successive quadratic programming method for a class of constrained nonsmooth optimization problems ⋮ Proximal point method for locally Lipschitz functions in multiobjective optimization of Hadamard manifolds ⋮ A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality ⋮ On the convexification procedure for nonconvex and nonsmooth infinite dimensional optimization problems ⋮ Unnamed Item ⋮ On the convergence of the proximal algorithm for nonsmooth functions involving analytic features ⋮ A proximal-point SQP trust region method for solving some special class of nonlinear semi-definite programming problems ⋮ Convergent algorithm based on progressive regularization for solving pseudomonotone variational inequalities ⋮ Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds ⋮ Pseudomonotone variational inequalities: Convergence of proximal methods ⋮ Proximal point method for a special class of nonconvex functions on Hadamard manifolds ⋮ Approximation of Fixed Points of Metrically Regular Mappings ⋮ Dual active sets and constrained optimization

Cites Work

• Unnamed Item
• Monotone (nonlinear) operators in Hilbert space
• A minimization method for the sum of a convex function and a continuously differentiable function
• Generalized gradients of Lipschitz functionals
• Local boundedness of nonlinear, monotone operators
• On the monotonicity of the gradient of a convex function
• The Generic Nature of Optimality Conditions in Nonlinear Programming
• A generalized proximal point algorithm for certain non-convex minimization problems
• On optimality conditions for structured families of nonlinear programming problems
• Monotone Operators and the Proximal Point Algorithm
• Matrices, Eigenvalues and Complex Projective Space
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Convex Analysis

This page was built for publication: Submonotone mappings and the proximal point algorithm