An SQP-type method with superlinear convergence for nonlinear semidefinite programming
DOI10.1142/S0217595918500094zbMATH Open1395.90141OpenAlexW2784529071MaRDI QIDQ4565262FDOQ4565262
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
Recommendations
- On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming
- Superlinear convergence of an SQP-type method for nonlinear semidefinite programming
- A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming
- A note on convergence analysis of an SQP-type method for nonlinear semidefinite programming
- A line search exact penalty method for nonlinear semidefinite programming
global convergencesuperlinear convergencenonlinear semidefinite programmingsequentially semidefinite programming method
Quadratic programming (90C20) Reliability, availability, maintenance, inspection in operations research (90B25) Nonlinear programming (90C30) Semidefinite programming (90C22)
Cites Work
- PENNON: A code for convex nonlinear and semidefinite programming
- Title not available (Why is that?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Title not available (Why is that?)
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- 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 Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming
- Robust Control via Sequential Semidefinite Programming
- A Global Algorithm for Nonlinear Semidefinite Programming
- A filter algorithm for nonlinear semidefinite programming
- A primal-dual interior point method for nonlinear semidefinite programming
- Optimal design of trusses under a nonconvex global buckling constraint
- Determinant Maximization with Linear Matrix Inequality Constraints
- 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
- A sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm
- Nonlinear leastpth optimization and nonlinear programming
- A New Nonlinear Lagrangian Method for Nonconvex Semidefinite Programming
- Penalty/Barrier multiplier algorthm for semidefinit programming∗
- A note on convergence analysis of an SQP-type method for nonlinear semidefinite programming
Cited In (5)
- 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
- A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming
- Two-step and three-step Q-superlinear convergence of SQP methods
- Title not available (Why is that?)
Uses Software
This page was built for publication: An SQP-type method with superlinear convergence for nonlinear semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4565262)
