A successive linearization method with flexible penalty for nonlinear semidefinite programming

DOI10.15960/J.CNKI.ISSN.1007-6093.2017.02.010MaRDI QIDQ3132656zbMATH OpenFDO

Authors Zhongwen Chen, Qi Zhao, Kai Bian

Publication date 29 January 2018

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2017.02.010

zbMATH Keywords

flexible penaltyglobal convergencenonlinear semidefinite programmingsuccessive linearization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonlinear programming (90C30)

Recommendations

• On filter-successive linearization methods for nonlinear semidefinite programming
• A filter successive linear programming method for nonlinear semidefinite programming problems
• A globally convergent SSDP algorithm without a penalty function or a filter for nonlinear semidefinite programming
• A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming
• A line search exact penalty method for nonlinear semidefinite programming

Cited in

(3)

• A sequential quadratic penalty method for nonlinear semidefinite programming
• Successive linearization methods for nonlinear semidefinite programs
• Lower-order penalization approach to nonlinear semidefinite programming

This page was built for publication: A successive linearization method with flexible penalty for nonlinear semidefinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132656)