A filter-type method for solving nonlinear semidefinite programming
From MaRDI portal
Publication:2202443
DOI10.1016/j.apnum.2020.08.012zbMath1450.90023OpenAlexW3077095721MaRDI QIDQ2202443
Publication date: 18 September 2020
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2020.08.012
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Successive linearization methods for nonlinear semidefinite programs
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- Concave programming in control theory
- An interior method for nonconvex semidefinite programs
- A trust region method for solving the decentralized static output feedback design problem
- An Improved Successive Linear Programming Algorithm
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- Linear Matrix Inequalities in System and Control Theory
- A Global Algorithm for Nonlinear Semidefinite Programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
- On the Global Convergence of a Filter--SQP Algorithm
- An Interior-Point Method for Semidefinite Programming
- Nonlinear programming without a penalty function.
