A New Nonlinear Lagrangian Method for Nonconvex Semidefinite Programming
From MaRDI portal
Publication:3405602
DOI10.1515/JAA.2009.149zbMath1225.90096OpenAlexW2117110228MaRDI QIDQ3405602
No author found.
Publication date: 10 February 2010
Published in: Journal of Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jaa.2009.149
Related Items
An SQP-type Method with Superlinear Convergence for Nonlinear Semidefinite Programming ⋮ Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property ⋮ PENNON: Software for Linear and Nonlinear Matrix Inequalities
Cites Work
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- Über monotone Matrixfunktionen
- An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
- Penalty/Barrier Multiplier Methods for Convex Programming Problems
- Fixed-orderH? control design via a partially augmented Lagrangian method
- PENNON: A code for convex nonlinear and semidefinite programming
- Penalty/Barrier multiplier algorthm for semidefinit programming∗
- Robust Control via Sequential Semidefinite Programming
- Partially Augmented Lagrangian Method for Matrix Inequality Constraints
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
- Definite and Semidefinite Quadratic Forms
- Log-sigmoid multipliers method in constrained optimization