scientific article; zbMATH DE number 1489798

zbMath0985.90071MaRDI QIDQ4496015

Jos F. Sturm

Publication date: 21 May 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

semidefinite programmingdualityconic convex programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (10)

Matrix Relaxations in Combinatorial Optimization ⋮ Some Recent Developments in Spectrahedral Computation ⋮ Facial reduction algorithms for conic optimization problems ⋮ How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization ⋮ A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms ⋮ On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function ⋮ Primal-dual stability in continuous linear optimization ⋮ Polynomials nonnegative on a grid and discrete optimization ⋮ On self-regular IPMs (with comments and rejoinder) ⋮ Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming

This page was built for publication: