Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices

DOI10.1137/S105262340240851XzbMath1075.90059MaRDI QIDQ4441951

Samuel Burer

Publication date: 19 January 2004

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

semidefinite programmingmatrix completionnumerical experimentssparsity

Mathematics Subject Classification ID

Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06) Abstract computational complexity for mathematical programming problems (90C60) Interior-point methods (90C51)

Related Items

Logarithmic barriers for sparse matrix cones, Solving large-scale semidefinite programs in parallel, Linear optimization over homogeneous matrix cones, Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones, Performance enhancements for a generic conic interior point algorithm, $LDL^T$ Direction Interior Point Method for Semidefinite Programming, Local minima and convergence in low-rank semidefinite programming, An improved semidefinite programming relaxation for the satisfiability problem, Preprocessing sparse semidefinite programs via matrix completion, Chordal decomposition in operator-splitting methods for sparse semidefinite programs, PREDICTOR–CORRECTOR SMOOTHING NEWTON METHOD FOR SOLVING SEMIDEFINITE PROGRAMMING, Computational enhancements in low-rank semidefinite programming, Bregman primal-dual first-order method and application to sparse semidefinite programming, A semidefinite optimization approach for the single-row layout problem with unequal dimensions, Optimality Conditions in Semidefinite Programming

Uses Software

• SDPLIB
• PENNON
• SDPLR