A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming

DOI10.1186/S13660-019-2171-YMaRDI QIDQ2067987zbMATH OpenOpenAlexWikidataFDO

Authors Jian-Ling Li, Hui Zhang

Publication date 19 January 2022

Published in Journal of Inequalities and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1186/s13660-019-2171-y

zbMATH Keywords

global convergencenonlinear semidefinite programmingpenalty functionsequential semidefinite programmingsuperlinear convergence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• An SQP-type method with superlinear convergence for nonlinear semidefinite programming
• On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming
• A globally convergent SSDP algorithm without a penalty function or a filter for nonlinear semidefinite programming
• Superlinear convergence of an SQP-type method for nonlinear semidefinite programming
• A line search exact penalty method for nonlinear semidefinite programming

Cites work

• A filter algorithm for nonlinear semidefinite programming
• A filter method for nonlinear semidefinite programming with global convergence
• A Global Algorithm for Nonlinear Semidefinite Programming
• A note on approximate Karush-Kuhn-Tucker conditions in locally Lipschitz multiobjective optimization
• 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 robust sequential quadratic programming method
• An inequality for the trace of the product of two symmetric matrices
• An interior method for nonconvex semidefinite programs
• An SQP-type method with superlinear convergence for nonlinear semidefinite programming
• Common zero point for a finite family of inclusion problems of accretive mappings in Banach spaces
• Commutativity and spectra of Hermitian matrices
• Differentiable merit function for shifted perturbed Karush-Kuhn-Tucker conditions of nonlinear semidefinite programming
• Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming
• scientific article; zbMATH DE number 1502618 (Why is no real title available?)
• scientific article; zbMATH DE number 1932419 (Why is no real title available?)
• Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
• Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming
• On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
• On the convergence of projected gradient processes to singular critical points
• On the Identification of Active Constraints
• On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming
• Optimal design of trusses under a nonconvex global buckling constraint
• Partially Augmented Lagrangian Method for Matrix Inequality Constraints
• Properties of the augmented Lagrangian in nonlinear semidefinite optimization
• Robust Control via Sequential Semidefinite Programming
• 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
• The shrinking projection method for a finite family of demimetric mappings with variational inequality problems in a Hilbert space
• The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications

Cited in

(8)

• A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
• scientific article; zbMATH DE number 5898052 (Why is no real title available?)
• An SQP-type method with superlinear convergence for nonlinear semidefinite programming
• Superlinear convergence of an SQP-type method for nonlinear semidefinite programming
• A globally convergent SSDP algorithm without a penalty function or a filter for nonlinear semidefinite programming
• A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming
• On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming
• Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling

This page was built for publication: A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2067987)