Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices
- 1 January 2003
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 14 (1) , 139-172
- https://doi.org/10.1137/s105262340240851x
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPsMathematical Programming, 2003
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorizationMathematical Programming, 2003
- Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical resultsMathematical Programming, 2003
- A spectral bundle method with boundsMathematical Programming, 2002
- Solving a class of semidefinite programs via nonlinear programmingMathematical Programming, 2002
- SDPLIB 1.2, a library of semidefinite programming test problemsOptimization Methods and Software, 1999
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Positive definite completions of partial Hermitian matricesLinear Algebra and its Applications, 1984
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965