Embedding methods for semidefinite programming

DOI10.1080/10556788.2010.534475MaRDI QIDQ2885491zbMATH OpenOpenAlexFDO

Authors Qinghong Zhang

Publication date 23 May 2012

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2010.534475

zbMATH Keywords

semidefinite programminginterior-point methodsextended Lagrange-Slater dualembedding methods

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Interior-point methods (90C51) Semidefinite programming (90C22)

Recommendations

• scientific article; zbMATH DE number 1182578
• Method of approximate centers for semi-definite programming
• scientific article; zbMATH DE number 1489798
• Infeasible interior point method for semidefinite programs
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding

Cites work

• scientific article; zbMATH DE number 1047682 (Why is no real title available?)
• A conversion of an SDP having free variables into the standard form SDP
• A new self-dual embedding method for convex programming
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• Conic convex programming and self-dual embedding
• Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding
• On a homogeneous algorithm for the monotone complementarity problem
• On homogeneous interrior-point algorithms for semidefinite programming
• On the Convergence of the Central Path in Semidefinite Optimization
• Perfect duality in semi-infinite and semidefinite programming
• Regularizing the abstract convex program
• Semidefinite Programming
• Semidefinite optimization
• Some applications of optimization in matrix theory
• Strong Duality for Semidefinite Programming

Cited in

(2)

• Finding graph embeddings by incremental low-rank semidefinite programming
• A note on the minimal cone for conic linear programming

This page was built for publication: Embedding methods for semidefinite programming

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