A Spectral Bundle Method for Semidefinite Programming
- 1 January 2000
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 10 (3), 673-696
- https://doi.org/10.1137/s1052623497328987
Abstract
No abstract availableThis publication has 31 references indexed in Scilit:
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric MatricesSIAM Journal on Optimization, 1997
- Semidefinite Programming: A Path-Following Algorithm for a Linear–Quadratic FunctionalSIAM Journal on Optimization, 1996
- Iterative methods for the computation of a few eigenvalues of a large symmetric matrixBIT Numerical Mathematics, 1996
- An Interior-Point Method for Semidefinite ProgrammingSIAM Journal on Optimization, 1996
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Nonpolyhedral Relaxations of Graph-Bisection ProblemsSIAM Journal on Optimization, 1995
- Implementing Lanczos-like algorithms on hypercube architecturesComputer Physics Communications, 1989
- Nondifferentiable optimization algorithm for designing control systems having singular value inequalitiesAutomatica, 1982
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979
- The minimization of certain nondifferentiable sums of eigenvalues of symmetric matricesPublished by Springer Science and Business Media LLC ,1975