A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming
From MaRDI portal
Publication:5245841
DOI10.1142/S0217595915400060zbMath1311.90093MaRDI QIDQ5245841
Publication date: 15 April 2015
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
global convergencenonlinear semidefinite programmingpenalty-free methodmeasure of constraint violation
Related Items
A globally convergent QP-free algorithm for nonlinear semidefinite programming ⋮ A line search SQP-type method with bi-object strategy for nonlinear semidefinite programming ⋮ An SQP-type Method with Superlinear Convergence for Nonlinear Semidefinite Programming ⋮ On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming ⋮ A line search exact penalty method for nonlinear semidefinite programming
Cites Work
- A filter successive linear programming method for nonlinear semidefinite programming problems
- On methods for solving nonlinear semidefinite optimization problems
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming
- Successive linearization methods for nonlinear semidefinite programs
- Nonlinear programming without a penalty function or a filter
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- Lower-order penalization approach to nonlinear semidefinite programming
- On filter-successive linearization methods for nonlinear semidefinite programming
- An interior method for nonconvex semidefinite programs
- Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
- An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
- Practical Optimization
- Nonlinear leastpth optimization and nonlinear programming
- Penalty/Barrier multiplier algorthm for semidefinit programming∗
- A Global Algorithm for Nonlinear Semidefinite Programming
- An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
- Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
- Nonlinear programming without a penalty function.