Strict convex regularizations, proximal points and augmented lagrangians

DOI10.1051/ro:2000102zbMath1029.90069OpenAlexW2064934942MaRDI QIDQ4528235

Paulo J. S. Silva, Carlos jun. Humes

Publication date: 31 January 2001

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105220

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items

On High-order Model Regularization for Constrained Optimization ⋮ Numerical comparison of augmented Lagrangian algorithms for nonconvex problems ⋮ Inexact proximal point algorithms and descent methods in optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proximal minimization algorithm with \(D\)-functions
• On the convergence rate of entropic proximal optimization methods
• A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• Extension of Fenchel's duality theorem for convex functions
• An elementary survey of general duality theory in mathematical programming
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
• Variational Analysis
• Entropy-Like Proximal Methods in Convex Programming
• Proximité et dualité dans un espace hilbertien
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development