Properties of the augmented Lagrangian in nonlinear semidefinite optimization
From MaRDI portal
Publication:868537
DOI10.1007/s10957-006-9078-8zbMath1278.90305OpenAlexW2029448249MaRDI QIDQ868537
Publication date: 6 March 2007
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-006-9078-8
Related Items
A globally convergent QP-free algorithm for nonlinear semidefinite programming ⋮ Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming ⋮ Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming ⋮ Convergence analysis of the augmented Lagrangian method for nonlinear second-order cone optimization problems ⋮ On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming ⋮ On the approximate augmented Lagrangian for nonlinear symmetric cone programming ⋮ A unified approach to the global exactness of penalty and augmented Lagrangian functions. II: Extended exactness ⋮ Nonlinear rescaling Lagrangians for nonconvex semidefinite programming ⋮ A class of nonlinear Lagrangians for nonconvex second order cone programming ⋮ A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming ⋮ Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property ⋮ Optimality conditions and global convergence for nonlinear semidefinite programming ⋮ Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming ⋮ Convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones ⋮ An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem ⋮ A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming ⋮ A primal-dual interior point trust-region method for nonlinear semidefinite programming ⋮ On saddle points in semidefinite optimization via separation scheme
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- First and second order analysis of nonlinear semidefinite programs
- Non-interior continuation methods for solving semidefinite complementarity problems
- Convergence analysis of a nonlinear Lagrangian algorithm for nonlinear programming with inequality constraints
- Nonsmooth analysis of eigenvalues
- Optimality conditions for nonconvex semidefinite programming
- An LMI-Based Algorithm for Designing Suboptimal Static $\cal H_2/\cal H_\infty$ Output Feedback Controllers
- Twice Differentiable Spectral Functions
- An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite Programming
- Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
- Derivatives of Spectral Functions
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Programming
- Semismooth Matrix-Valued Functions
- Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
- Some Properties of the Augmented Lagrangian in Cone Constrained Optimization
- Handbook of semidefinite programming. Theory, algorithms, and applications