An Interior-Point Method for Semidefinite Programming (2005)

by Christoph Helmberg , Franz Rendl , Robert J. Vanderbei , Henry Wolkowicz
Citations:202 - 18 self

Active Bibliography

771 Semidefinite Programming – - 1996
34 Bundle Methods to Minimize the Maximum Eigenvalue Function – - 1999
15 The U-Lagrangian Of The Maximum Eigenvalue Function – - 1998
10 Max-Min Eigenvalue Problems, Primal-Dual Interior Point Algorithms, and Trust Region Subproblems – - 1993
935 Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming – - 1995
4 Algorithms and Software for LMI Problems in Control – - 1997
13 Semidefinite Programming for Assignment and Partitioning Problems – - 1996
1 An Inexact Bundle Method for Solving Large Structured Linear Matrix Inequalities – - 2001
138 A Spectral Bundle Method for Semidefinite Programming – - 1997
23 Fixing Variables in Semidefinite Relaxations – - 1996
39 Nonpolyhedral Relaxations of Graph-Bisection Problems – - 1993
The Spectral Bundle Method with Second-Order Information – - 2013
12 Semidefinite Programming and Combinatorial Optimization – - 1998
41 Eigenvalues in combinatorial optimization – - 1993
96 Semidefinite Programming and Combinatorial Optimization – - 1998
47 On Extending Primal-Dual Interior-Point Algorithms from Linear Programming to Semidefinite Programming – - 1995
55 On Extending Some Primal-Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming – - 1998
17 Convex Relaxations Of 0-1 Quadratic Programming – - 1993
1 Efficient Approximation Algorithms for Some Semidefinite Programs – - 1996