Inexact proximal point algorithms and descent methods in optimization

DOI10.1007/S11081-005-6798-9MaRDI QIDQ2575251zbMATH OpenOpenAlexFDO

Authors Carlos jun. Humes, Paulo José da Silva e 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 programmingproximal methodsmonotone operators

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)

Recommendations

• Inexact and accelerated proximal point algorithms
• Inexact proximal point methods in metric spaces
• scientific article; zbMATH DE number 1062747
• Asymptotic Convergence Analysis of Some Inexact Proximal Point Algorithms for Minimization
• scientific article; zbMATH DE number 125245

Cites work

• scientific article; zbMATH DE number 1306984 (Why is no real title available?)
• scientific article; zbMATH DE number 1369459 (Why is no real title available?)
• A general approach to convergence properties of some methods for nonsmooth convex optimization
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Convex Analysis
• Monotone Operators and the Proximal Point Algorithm
• Numerical methods for nondifferentiable convex optimization
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Optimization. Algorithms and consistent approximations
• Some properties of generalized proximal point methods for quadratic and linear programming
• Strict convex regularizations, proximal points and augmented lagrangians
• Thevenin decomposition and large-scale optimization
• Variational Analysis

Cited in

(16)

• Descentwise inexact proximal algorithms for smooth optimization
• An inexact and nonmonotone proximal method for smooth unconstrained minimization
• Finite convergence and sharp minima for quasi-equilibrium problems
• Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods
• On inexact versions of a quasi-equilibrium problem: a Cournot duopoly perspective
• The indefinite proximal point algorithms for maximal monotone operators
• Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC
• Inexact Variants of the Proximal Point Algorithm without Monotonicity
• A Lyusternik-Graves theorem for the proximal point method
• An inexact proximal method for quasiconvex minimization
• An inexact proximal regularization method for unconstrained optimization
• An accelerated inexact proximal point algorithm for convex minimization
• The developments of proximal point algorithms
• Self-adaptive inexact proximal point methods
• An inexact scalarization proximal point method for multiobjective quasiconvex minimization
• Uniformity and inexact version of a proximal method for metrically regular mappings

This page was built for publication: Inexact proximal point algorithms and descent methods in optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575251)