Sequential constant rank constraint qualifications for nonlinear semidefinite programming with applications (original) (raw)

2021

Optimality conditions and global convergence for nonlinear semidefinite programming

Mathematical Programming

Global Convergence of Algorithms Under Constant Rank Conditions for Nonlinear Second-Order Cone Programming

Journal of Optimization Theory and Applications

The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming

Jie Sun, Liwei Zhang

2008

Linearly Convergent First-Order Algorithms for Semidefinite Programming

cong minh Dang

Journal of Computational Mathematics, 2017

First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition

2021

Weak notions of nondegeneracy in nonlinear semidefinite programming

2020

Interior-point algorithms for semidefinite programming based on a nonlinear formulation

2002

Local Minima and Convergence in Low-Rank Semidefinite Programming

Mathematical Programming, 2005

Interior-Point Algorithms for Semidefinite Programming Based on A Nonlinear Programming Formulation

IEEE Transactions on Reliability, 1999

ON FORMULATING SEMIDEFINITE PROGRAMMING PROBLEMS AS SMOOTH CONVEX NONLINEAR OPTIMIZATION PROBLEMS

Robert Vanderbei

2000

First and second-order methods for semidefinite programming

Mathematical Programming, 2003

Solving a class of semidefinite programs via nonlinear programming

Mathematical Programming, 2002

A relaxed interior point method for low-rank semidefinite programming problems

Jacek Gondzio

2019

A Decomposition Augmented Lagrangian Method for Low-rank Semidefinite Programming

Haoyang Liu

2021

Optimization with semidefinite, quadratic and linear constraints

Farid Alizadeh

1997

Solving Problems with Semidefinite and Related Constraints Using Interior-Point Methods for Nonlinear Programming

Robert Vanderbei

Mathematical Programming, 2003

Semidefinite Programming Relaxation for Nonconvex Quadratic Programs

Masakazu Kojima

Journal of Global Optimization, 1997

Solving Semidefinite Programs via Nonlinear Programming Part II: Interior Point Methods for a Subclass of SDPs

On a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence

Florian Potra

Methods and Applications of Analysis, 1999

Superlinear Convergence of Interior-Point Algorithms for Semidefinite Programming

Florian Potra

1996

On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming

Florian Potra

SIAM Journal on Optimization, 1999

4. Semidefinite Programming

Aharon Ben-tal

Lectures on Modern Convex Optimization, 2001

Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results

Farid Alizadeh

SIAM Journal on Optimization, 1998

An interior-point method for semidefinite programming

Robert Vanderbei

Siam Journal on Optimization, 1996

Lagrangian Dual Interior-Point Methods for Semidefinite Programs

Masakazu Kojima

SIAM Journal on Optimization, 2002

Primal - dual interior - point methods for semidefinite programming : Stability, convergence, and numerical results

Farid Alizadeh

1998

Global and Local Convergence of PredictorCorrector Infeasible-Interior-Point Algorithms for Semidefinite Programs

Masakazu Kojima

1995

Regularization Methods for Semidefinite Programming

Franz Rendl

SIAM Journal on Optimization, 2009

Interior Point Trajectories in Semidefinite Programming

Donald Goldfarb

SIAM Journal on Optimization, 1998

A Short Survey on Semidefinite Programming

Cornelis Roos

A robust algorithm for semidefinite programming

Serge Kruk

Optimization Methods and Software, 2012