We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming.
- Authors
Rockafellar, R. Tyrrell
- Abstract
The augmented Lagrangian method (ALM) is extended to a broader-than-ever setting of generalized nonlinear programming in convex and nonconvex optimization that is capable of handling many common manifestations of nonsmoothness. With the help of a recently developed sufficient condition for local optimality, it is shown to be derivable from the proximal point algorithm through a kind of local duality corresponding to an optimal solution and accompanying multiplier vector that furnish a local saddle point of the augmented Lagrangian. This approach leads to surprising insights into stepsize choices and new results on linear convergence that draw on recent advances in convergence properties of the proximal point algorithm. Local linear convergence is shown to be assured for a class of model functions that covers more territory than before.
- Subjects
NONLINEAR programming; CONVEX programming; LAGRANGIAN points; NONCONVEX programming; SEMIDEFINITE programming; NONSMOOTH optimization
- Publication
Mathematical Programming, 2023, Vol 199, Issue 1/2, p375
- ISSN
0025-5610
- Publication type
Article
- DOI
10.1007/s10107-022-01832-5