Inexact proximal point algorithms and descent methods in optimization

DOI10.1007/s11081-005-6798-9zbMath1080.90072OpenAlexW2062941769MaRDI QIDQ2575251

Carlos jun. Humes, Paulo J. S. Silva

Publication date: 8 December 2005

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-005-6798-9

zbMATH Keywords

convex programmingmonotone operatorsproximal methods

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items

An inexact proximal method for quasiconvex minimization ⋮ Uniformity and inexact version of a proximal method for metrically regular mappings ⋮ The developments of proximal point algorithms ⋮ An inexact scalarization proximal point method for multiobjective quasiconvex minimization ⋮ Descentwise inexact proximal algorithms for smooth optimization ⋮ An inexact proximal regularization method for unconstrained optimization ⋮ Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods ⋮ An inexact and nonmonotone proximal method for smooth unconstrained minimization ⋮ Self-adaptive inexact proximal point methods ⋮ A Lyusternik-Graves theorem for the proximal point method ⋮ Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC ⋮ The indefinite proximal point algorithms for maximal monotone operators

Cites Work

• Unnamed Item
• Unnamed Item
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A general approach to convergence properties of some methods for nonsmooth convex optimization
• Optimization. Algorithms and consistent approximations
• Some properties of generalized proximal point methods for quadratic and linear programming
• Thevenin decomposition and large-scale optimization
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Variational Analysis
• Strict convex regularizations, proximal points and augmented lagrangians
• Numerical methods for nondifferentiable convex optimization
• Convex Analysis