A revised sequential quadratic semidefinite programming method for nonlinear semidefinite optimization
From MaRDI portal
Abstract: In 2020, Yamakawa and Okuno proposed a stabilized sequential quadratic semidefinite programming (SQSDP) method for solving, in particular, degenerate nonlinear semidefinite optimization problems. The algorithm is shown to converge globally without a constraint qualification, and it has some nice properties, including the feasible subproblems, and their possible inexact computations. In particular, the convergence was established for approximate-Karush-Kuhn-Tucker (AKKT) and trace-AKKT conditions, which are two sequential optimality conditions for the nonlinear conic contexts. However, recently, complementarity-AKKT (CAKKT) conditions were also consider, as an alternative to the previous mentioned ones, that is more practical. Since few methods are shown to converge to CAKKT points, at least in conic optimization, and to complete the study associated to the SQSDP, here we propose a revised version of the method, maintaining the good properties. We modify the previous algorithm, prove the global convergence in the sense of CAKKT, and show some preliminary numerical experiments.
Recommendations
- A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs
- Optimality conditions and global convergence for nonlinear semidefinite programming
- An SQP-type method with superlinear convergence for nonlinear semidefinite programming
- A note on convergence analysis of an SQP-type method for nonlinear semidefinite programming
- A sequential quadratic penalty method for nonlinear semidefinite programming
Cites work
- A Global Algorithm for Nonlinear Semidefinite Programming
- A Globally Convergent Stabilized SQP Method
- A line search exact penalty method for nonlinear semidefinite programming
- A new sequential optimality condition for constrained optimization and algorithmic consequences
- A primal-dual interior point method for nonlinear semidefinite programming
- A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs
- A survey of numerical methods for nonlinear semidefinite programming
- An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
- An interior method for nonconvex semidefinite programs
- Estimation of failure probability using semi-definite logit model
- Exact augmented Lagrangian functions for nonlinear semidefinite programming
- Fixed-orderH? control design via a partially augmented Lagrangian method
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
- On sequential optimality conditions for smooth constrained optimization
- On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming
- On the use of Jordan algebras for improving global convergence of an augmented Lagrangian method in nonlinear semidefinite programming
- Optimality conditions and global convergence for nonlinear semidefinite programming
- Robust Control via Sequential Semidefinite Programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Sequential semidefinite program for maximum robustness design of structures under load uncertainty
- Solving nonconvex SDP problems of structural optimization with stability control
- Solving semidefinite-quadratic-linear programs using SDPT3
- Successive linearization methods for nonlinear semidefinite programs
- Superlinear convergence of a stabilized SQP method to a degenerate solution
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
Cited in
(7)- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- A sequential quadratic penalty method for nonlinear semidefinite programming
- A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- Superlinear convergence of a stabilized SQP-type method for nonlinear semidefinite programming
- A second-order sequential optimality condition for nonlinear second-order cone programming problems
- Local convergence analysis of stabilized sequential quadratic programming methods for optimization problems in Banach spaces
This page was built for publication: A revised sequential quadratic semidefinite programming method for nonlinear semidefinite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6175373)
