An SQP-type Method with Superlinear Convergence for Nonlinear Semidefinite Programming
From MaRDI portal
Publication:4565262
DOI10.1142/S0217595918500094zbMath1395.90141OpenAlexW2784529071MaRDI QIDQ4565262
Publication date: 11 June 2018
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595918500094
global convergencesuperlinear convergencenonlinear semidefinite programmingsequentially semidefinite programming method
Semidefinite programming (90C22) Nonlinear programming (90C30) Quadratic programming (90C20) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (3)
A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs ⋮ A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm
- 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
- Lectures on Modern Convex Optimization
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
- An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
- A New Nonlinear Lagrangian Method for Nonconvex Semidefinite Programming
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- Nonlinear leastpth optimization and nonlinear programming
- Determinant Maximization with Linear Matrix Inequality Constraints
- 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
- 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
- Optimal design of trusses under a nonconvex global buckling constraint
- A filter algorithm for nonlinear semidefinite programming
This page was built for publication: An SQP-type Method with Superlinear Convergence for Nonlinear Semidefinite Programming
