Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
Top Cited Papers
- 1 January 2000
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 10 (2) , 443-461
- https://doi.org/10.1137/s1052623497328008
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Semidefinite programming relaxations for the graph partitioning problemDiscrete Applied Mathematics, 1999
- Approximating the complexity measure of Vavasis-Ye algorithm is NP-hardMathematical Programming, 1999
- Primal-Dual Interior-Point Methods for Self-Scaled ConesSIAM Journal on Optimization, 1998
- Semidefinite relaxation and nonconvex quadratic optimizationOptimization Methods and Software, 1998
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric MatricesSIAM Journal on Optimization, 1997
- An Interior-Point Method for Semidefinite ProgrammingSIAM Journal on Optimization, 1996
- Semidefinite ProgrammingSIAM Review, 1996
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- A recipe for semidefinite relaxation for (0,1)-quadratic programmingJournal of Global Optimization, 1995
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979