Properties of the augmented Lagrangian in nonlinear semidefinite optimization

From MaRDI portal
Publication:868537

DOI10.1007/s10957-006-9078-8zbMath1278.90305OpenAlexW2029448249MaRDI QIDQ868537

Jie Sun, Yue Wu, Li-wei Zhang

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 programmingConvergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programmingGlobal convergence of modified augmented Lagrangian methods for nonlinear semidefinite programmingConvergence analysis of the augmented Lagrangian method for nonlinear second-order cone optimization problemsOn the convergence of augmented Lagrangian methods for nonlinear semidefinite programmingOn the approximate augmented Lagrangian for nonlinear symmetric cone programmingA unified approach to the global exactness of penalty and augmented Lagrangian functions. II: Extended exactnessNonlinear rescaling Lagrangians for nonconvex semidefinite programmingA class of nonlinear Lagrangians for nonconvex second order cone programmingA new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programmingAugmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty propertyOptimality conditions and global convergence for nonlinear semidefinite programmingNonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programmingConvergence of the augmented Lagrangian method for nonlinear optimization problems over second-order conesAn augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problemA superlinearly convergent SSDP algorithm for nonlinear semidefinite programmingA primal-dual interior point trust-region method for nonlinear semidefinite programmingOn saddle points in semidefinite optimization via separation scheme



Cites Work