Embedding methods for semidefinite programming

DOI10.1080/10556788.2010.534475zbMath1266.90138OpenAlexW2017755795MaRDI QIDQ2885491

Qinghong Zhang

Publication date: 23 May 2012

Published in: Optimization Methods and 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

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

Related Items

A note on the minimal cone for conic linear programming

Cites Work

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

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