Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
From MaRDI portal
Publication:5437526
DOI10.1080/10556780701223970zbMath1188.90254OpenAlexW2158288046MaRDI QIDQ5437526
Publication date: 21 January 2008
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780701223970
matrix inequalityimplicit function theoremaugmented Lagrangiannonlinear semidefinite programmingspectral penalty
Related Items
A globally convergent QP-free algorithm for nonlinear semidefinite programming, Exact augmented Lagrangian functions 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, A homotopy method for nonlinear semidefinite programming, On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming, A self-concordance property for nonconvex semidefinite programming, A note on convergence analysis of an SQP-type method for nonlinear semidefinite programming, A homotopy method based on penalty function for nonlinear semidefinite 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, Convergence analysis of a nonlinear Lagrangian method for nonconvex semidefinite programming with subproblem inexactly solved, PENNON: Software for Linear and Nonlinear Matrix Inequalities, Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming, Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method, A New Nonlinear Lagrangian Method for Nonconvex Semidefinite Programming, A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming, A primal-dual interior point trust-region method for nonlinear semidefinite programming, Unnamed Item, On saddle points in semidefinite optimization via separation scheme
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Augmented Lagrangians which are quadratic in the multiplier
- Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- Nonsmooth optimization for multiband frequency domain control design
- Extremal problems on the set of nonnegative definite matrices
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- Nonsmooth optimization for multidisk \(H_\infty\) synthesis
- Multiplier and gradient methods
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
- An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Controller Design via Nonsmooth Multidirectional Search
- Semi-Definite Matrix Constraints in Optimization
- A New Class of Augmented Lagrangians in Nonlinear Programming
- Large-Scale Optimization of Eigenvalues
- 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
- Trust region methods for solving the optimal output feedback design problem
- A Spectral Bundle Method for Semidefinite Programming
- Penalty/Barrier multiplier algorthm for semidefinit programming∗
- Robust Control via Sequential Semidefinite Programming
- Partially Augmented Lagrangian Method for Matrix Inequality Constraints
- An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
- Nonsmooth H∞Synthesis
- Generalized Hadamard Product and the Derivatives of Spectral Functions
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
