An interior-point method for semidefinite programming

SIAM Journal on Optimization

Volumn 6, Issue 2, 1996, Pages 342-361

  Helmberg, Christoph ^a   Rendl, Franz ^a   Vanderbei, Robert J ^b   Wolkowicz, Henry ^c  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b Princeton University   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Interior point methods; Max cut relaxations; Max min eigenvalue problems; Semidefinite programming

Indexed keywords

EID: 0030303838     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/0806020     Document Type: Article

References (30)

1. K. M. ANSTREICHER AND J.-P. VIAL, On the convergence of an infeasible primal-dual interior-point method for convex programming, Optimization Methods and Software, 3 (1994), pp. 273-283.
2. F. ALIZADEH, Combinatorial Optimization with Interior Point Methods and Semidefinite Matrices, Ph.D. Thesis, University of Minnesota, Minneapolis, MN, 1991.
3. _, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim., 5 (1995), pp. 13-51.
4. F. ALIZADEH, J. A. HAEBERLY, AND M. L. OVERTON, Primal-dual interior point methods for semidefinite programming, Tech. report, Courant Institute of Mathematical Sciences, New York University, New York, 1994.
5. 5, Oper. Res. Lett., 2 (1983), pp. 107-111.
6. R. B. BOPPANA, Eigenvalues and graph bisection: An average case analysis, in Proc. 28th Annual Symposium on Foundations of Computer Science, Los Angeles, CA, IEEE, 1987, pp. 280-285.
7. T. J. CARPENTER, I. J. LUSTIG, J. M. MULVEY, AND D. F. SHANNO, Higher-order predictor-corrector interior point methods with application to quadratic objectives, SIAM J. Optim., 3 (1993), pp. 696-725.
8. J. CULLUM, W. E. DONATH, AND P. WOLFE, The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices, Math. Programming Study, 3 (1975), pp. 35-55.
9. C. DELORME AND S. POLJAK, Laplacian eigenvalues and the maximum cut problem, Math. Programming, 62 (1993), pp. 557-574.
10. J. FALKNER, F. RENDL, AND H. WOLKOWICZ, A computational study of graph partitioning, Math. Programming, 66 (1994), pp. 211-240.
11. M. X. GOEMANS AND D. P. WILLIAMSON, .878-approximation algorithm for max-cut and max-2sat, Tech. report, MIT, Cambridge, MA, 1993.
12. F. O. HADLOCK, Finding a maximum cut in a planar graph in polynomial time, SIAM J. Comput., 4 (1975), pp. 221-225.
13. C. HELMBERG, An interior point method for semidefinite programming and max-cut bounds, Ph.D. Thesis, Graz University of Technology, Graz, Austria, Oct. 1994.
14. F. JARRE, An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices, SIAM J. Control Optim., 31 (1993), pp. 1360-1377.
15. _Interior-point methods via self-concordance or relative Lipschitz condition, Habilitationsschrift (thesis), Würzburg University, March 1994.
16. M. KOJIMA, S. SHINDOH, AND S. HARA, Interior-point Methods for the Monotone Linear Complementarity Problem in Symmetric Matrices, Tech. report B-282, Department of Information Sciences, Tokyo Institute of Technology, Tokyo, Apr. 1994.
17. M. LAURENT AND S. POLJAK, The metric polytope, in Proc. IPCO 2, E. Balas, G. Cornuejols, and R. Kannan, eds., Carnegie-Mellon University, Pittsburgh, PA, 1992, pp. 274-286.
18. L. LOVÁSZ, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, 25 (1979), pp. 1-7.
19. B. MOHAR AND S. POLJAK, Eigenvalues in combinatorial optimization, in Combinatorial and graph-theoretic problems in linear algebra, R. Brualdi, S. Friedland, and V. Klee, eds., IMA Volumes in Mathematics and Its Applications, Vol. 50, Springer-Verlag, Berlin, New York, 1993.
20. Y. E. NESTEROV AND A. S. NEMIROVSKII, Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1993.
21. M. L. OVERTON, On minimizing the maximum eigenvalue of a symmetric matrix, SIAM J. Matrix Anal. Appl., 9 (1988), pp. 256-268.
22. _, Large-scale optimization of eigenvalues, SIAM J. Optim., 2 (1992), pp. 88-120.
23. M. L. OVERTON AND R. S. WOMERSLEY, Second derivatives for optimizing eigenvalues of symmetric matrices, Tech. report 627, Computer Science Department, New York University, New York, 1993, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 697-718.
24. S. POLJAK AND F. RENDL, Nonpolyhedral relaxations of graph-bisection problems, Tech. report, Graz University of Technology, 1992, SIAM J. Optim., 5 (1995), pp. 467-487.
25. F. RENDL, R. J. VANDERBEI, AND H. WOLKOWICZ, Max-min eigenvalue problems, primaldual interior point algorithms, and trust region subproblems, Optimization Methods and Software, 5 (1995), pp. 1-16.
26. H. SCHRAMM AND J. ZOWE, A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results, SIAM J. Optim., 2 (1993), pp. 121-152.
27. L. VANDENBERGHE AND S. BOYD, Primal-dual potential reduction method for problems involving matrix inequalities, Math. Programming, 69 (1995), pp. 205-236.
28. R. J. VANDERBEI AND T. J. CARPENTER, Symmetric indefinite systems for interior-point methods, Math. Programming, 58 (1993), pp. 1-32.
29. J.-P. VIAL, Computational experience with a primal-dual interior-point method for smooth convex programming, Optimization Methods and Software, 3 (1994), pp. 285-316.
30. H. WOLKOWICZ, Some applications of optimization in matrix theory, Linear Algebra Appl., 40 (1981), pp. 101-118.