A line search SQP-type method with bi-object strategy for nonlinear semidefinite programming

DOI10.1007/s10255-022-1081-9zbMath1490.90216OpenAlexW4226052098MaRDI QIDQ2125656

Zhongwen Chen, Wenhao Fu

Publication date: 14 April 2022

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-022-1081-9

zbMATH Keywords

rate of convergenceglobal convergencenonlinear semidefinite programmingbi-object strategy

Mathematics Subject Classification ID

Semidefinite programming (90C22) Methods of successive quadratic programming type (90C55)

Cites Work

• Unnamed Item
• A line search exact penalty method using steering rules
• A sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm
• A filter method for nonlinear semidefinite programming with global convergence
• A primal-dual interior point method for nonlinear semidefinite programming
• On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming
• Duality theories in nonlinear semidefinite programming
• Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
• First and second order analysis of nonlinear semidefinite programs
• Failure of global convergence for a class of interior point methods for nonlinear programming
• Optimality conditions for nonconvex semidefinite programming
• Optimality conditions and global convergence for nonlinear semidefinite programming
• A line search exact penalty method for nonlinear semidefinite programming
• A primal-dual interior point method for large-scale free material optimization
• An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
• Fixed-orderH? control design via a partially augmented Lagrangian method
• Penalty/Barrier multiplier algorthm for semidefinit programming^∗
• Robust Control via Sequential Semidefinite Programming
• A Global Algorithm for Nonlinear Semidefinite Programming
• Solving nonconvex SDP problems of structural optimization with stability control
• On the Global Convergence of a Filter--SQP Algorithm
• A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming
• The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Optimal design of trusses under a nonconvex global buckling constraint
• A filter algorithm for nonlinear semidefinite programming
• A line search exact penalty method with bi-object strategy for nonlinear constrained optimization

This page was built for publication: A line search SQP-type method with bi-object strategy for nonlinear semidefinite programming