Augmented Lagrangians and hidden convexity in sufficient conditions for local optimality

DOI10.1007/s10107-022-01768-wOpenAlexW4206817226MaRDI QIDQ2687043

R. Tyrrell Rockafellar

Publication date: 1 March 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-022-01768-w

zbMATH Keywords

nonsmooth optimizationmetric regularitysecond-order cone programmingsecond-order variational analysislocal dualitytilt stabilityALMsufficient conditions for local optimalityvariational convexitygeneralized augmented Lagrangiansgeneralized nonlinear programminglocal maximal monotonicity

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46)

Related Items

Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming, Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications, Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems, Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials, Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization, Role of subgradients in variational analysis of polyhedral functions, Variational Convexity of Functions and Variational Sufficiency in Optimization, Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming, Generalizations of the proximal method of multipliers in convex optimization, Generic linear convergence through metric subregularity in a variable-metric extension of the proximal point algorithm, A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions, A Chain Rule for Strict Twice Epi-Differentiability and Its Applications, Unnamed Item, On (local) analysis of multifunctions via subspaces contained in graphs of generalized derivatives

Cites Work

• Second-order cone programming
• Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity
• Second-order variational analysis in second-order cone programming
• Variational convexity and the local monotonicity of subgradient mappings
• Perturbation analysis of second-order cone programming problems
• Lagrange Multipliers and Optimality
• Implicit Functions and Solution Mappings
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Lipschitzian stability of constraint systems and generalized equations
• Tilt Stability of a Local Minimum
• Subgradient monotonicity and convex functions
• Parabolic regularity in geometric variational analysis
• Full Stability of Locally Optimal Solutions in Second-Order Cone Programs
• Convex Analysis
• Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
• Unnamed Item
• Unnamed Item
• Unnamed Item