A globally convergent SSDP algorithm without a penalty function or a filter for nonlinear semidefinite programming
From MaRDI portal
Publication:5197285
Recommendations
- A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming
- A trust region type algorithm without a penalty and a filter for nonlinear semidefinite programming
- On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming
- A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming
- A filter algorithm for nonlinear semidefinite programming
Cited in
(9)- A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming
- A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming
- A line search exact penalty method for nonlinear semidefinite programming
- A globally convergent QP-free algorithm for nonlinear semidefinite programming
- A successive linearization method with flexible penalty for nonlinear semidefinite programming
- A filter successive linear programming method for nonlinear semidefinite programming problems
- A filter method for nonlinear semidefinite programming with global convergence
- A trust region type algorithm without a penalty and a filter for nonlinear semidefinite programming
- On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming
This page was built for publication: A globally convergent SSDP algorithm without a penalty function or a filter for nonlinear semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5197285)