An SQP-type method with superlinear convergence for nonlinear semidefinite programming
From MaRDI portal
(Redirected from Publication:4565262)
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
Cites work
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Global Algorithm for Nonlinear Semidefinite Programming
- A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A filter algorithm for nonlinear semidefinite programming
- A new nonlinear Lagrangian method for nonconvex semidefinite programming
- A note on convergence analysis of an SQP-type method for nonlinear semidefinite programming
- A primal-dual interior point method for nonlinear semidefinite programming
- A sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm
- An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
- Determinant Maximization with Linear Matrix Inequality Constraints
- Fixed-orderH? control design via a partially augmented Lagrangian method
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Nonlinear leastpth optimization and nonlinear programming
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
- On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
- Optimal design of trusses under a nonconvex global buckling constraint
- PENNON: A code for convex nonlinear and semidefinite programming
- Penalty/Barrier multiplier algorthm for semidefinit programming∗
- Robust Control via Sequential Semidefinite Programming
- Sequential semidefinite program for maximum robustness design of structures under load uncertainty
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
Cited in
(12)- Superlinear convergence of a stabilized SQP-type method for nonlinear semidefinite programming
- A line search SQP-type method with bi-object strategy for nonlinear semidefinite programming
- An SQP augmented Lagrangian method for two classes of nonlinear semidefinite programming problems arising in discrete-time feedback control
- Superlinear convergence of an SQP-type method for nonlinear semidefinite programming
- A globally convergent QP-free 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
- A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs
- On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming
- A revised sequential quadratic semidefinite programming method for nonlinear semidefinite optimization
- A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming
- Two-step and three-step Q-superlinear convergence of SQP methods
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)
