Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming
From MaRDI portal
Publication:6179872
DOI10.1007/s10589-023-00520-0arXiv2110.10594OpenAlexW4385932778MaRDI QIDQ6179872
Publication date: 18 January 2024
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.10594
local convergence ratethe augmented Lagrangian methoduniform quadratic growthnonlinear Semidefinite programmingsemi-isolated calmnessuniform second order expansion
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonsmooth analysis (49J52)
Cites Work
- A practical relative error criterion for augmented Lagrangians
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
- Upper Lipschitz behavior of solutions to perturbed \(C^{1,1}\) programs
- Critical multipliers in variational systems via second-order generalized differentiation
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Augmented Lagrangian method for second-order cone programs under second-order sufficiency
- Improved local convergence results for augmented Lagrangian methods in \(C^2\)-cone reducible constrained optimization
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems
- Multiplier and gradient methods
- The multiplier method of Hestenes and Powell applied to convex programming
- Augmented Lagrangians and hidden convexity in sufficient conditions for local optimality
- Local Convergence of Exact and Inexact Augmented Lagrangian Methods under the Second-Order Sufficient Optimality Condition
- Characterization of the Robust Isolated Calmness for a Class of Conic Programming Problems
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Lagrange Multipliers and Optimality
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- Implicit Functions and Solution Mappings
- Optimization and nonsmooth analysis
- Some continuity properties of polyhedral multifunctions
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Variational Analysis
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Strong Semismoothness of Eigenvalues of Symmetric Matrices and Its Application to Inverse Eigenvalue Problems
- Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions
- A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
- On Error Bounds and Multiplier Methods for Variational Problems in Banach Spaces
- On Projection Algorithms for Solving Convex Feasibility Problems
- Generalized Hessian Properties of Regularized Nonsmooth Functions
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- Parabolic regularity in geometric variational analysis
- Local Convergence Analysis of Augmented Lagrangian Methods for Piecewise Linear-Quadratic Composite Optimization Problems
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Newton-Type Methods for Optimization and Variational Problems
- Convex Analysis
- Semismooth Matrix-Valued Functions
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- Some Properties of the Augmented Lagrangian in Cone Constrained Optimization
- Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
