A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming
From MaRDI portal
Publication:2067987
DOI10.1186/s13660-019-2171-yzbMath1499.90146OpenAlexW2969806640WikidataQ127357294 ScholiaQ127357294MaRDI QIDQ2067987
Publication date: 19 January 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-019-2171-y
global convergencesuperlinear convergencepenalty functionnonlinear semidefinite programmingsequential semidefinite programming
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming
- Properties of the augmented Lagrangian in nonlinear semidefinite optimization
- Sequential semidefinite program for maximum robustness design of structures under load uncertainty
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- A note on convergence analysis of an SQP-type method for nonlinear semidefinite programming
- Commutativity and spectra of Hermitian matrices
- A note on approximate Karush-Kuhn-Tucker conditions in locally Lipschitz multiobjective optimization
- On the convergence of projected gradient processes to singular critical points
- A robust sequential quadratic programming method
- An interior method for nonconvex semidefinite programs
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
- Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
- Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming
- Common zero point for a finite family of inclusion problems of accretive mappings in Banach spaces
- On the Identification of Active Constraints
- An inequality for the trace of the product of two symmetric matrices
- Robust Control via Sequential Semidefinite Programming
- The shrinking projection method for a finite family of demimetric mappings with variational inequality problems in a Hilbert space
- An SQP-type Method with Superlinear Convergence for Nonlinear Semidefinite Programming
- Partially Augmented Lagrangian Method for Matrix Inequality Constraints
- A Global Algorithm 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: A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming