On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming

DOI10.1016/j.cam.2016.05.007zbMath1343.90060OpenAlexW2405543709MaRDI QIDQ738946

Zhongwen Chen, Qi Zhao

Publication date: 16 August 2016

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2016.05.007

zbMATH Keywords

global convergencelocal convergencenonlinear semidefinite programmingpenalty-free methodsecond order correction

Mathematics Subject Classification ID

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

Related Items (8)

A line search SQP-type method with bi-object strategy for nonlinear semidefinite programming ⋮ A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs ⋮ Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems ⋮ A revised sequential quadratic semidefinite programming method for nonlinear semidefinite optimization ⋮ A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming ⋮ A line search exact penalty method for nonlinear semidefinite programming ⋮ A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming ⋮ Unnamed Item

Uses Software

• PENNON
• COMPleib

Cites Work

• A homotopy method for nonlinear semidefinite programming
• A sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm
• Global and local convergence of a penalty-free method for nonlinear programming
• A primal-dual interior point method for nonlinear semidefinite programming
• Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
• Sequential semidefinite program for maximum robustness design of structures under load uncertainty
• A note on convergence analysis of an SQP-type method for nonlinear semidefinite programming
• A penalty-free method with line search for nonlinear equality constrained optimization
• Lectures on Modern Convex Optimization
• An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
• Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
• Fixed-orderH? control design via a partially augmented Lagrangian method
• PENNON: A code for convex nonlinear and semidefinite programming
• Penalty/Barrier multiplier algorthm for semidefinit programming^∗
• Robust Control via Sequential Semidefinite Programming
• A Global Algorithm for Nonlinear Semidefinite Programming
• On the Global Convergence of a Filter--SQP Algorithm
• A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming
• Line Search Filter Methods for Nonlinear Programming: Local Convergence
• The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
• Optimal design of trusses under a nonconvex global buckling constraint
• A filter algorithm for nonlinear semidefinite programming

This page was built for publication: On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming