A unifying framework for several cutting plane methods for semidefinite programming

Optimization Methods and Software

Volumn 21, Issue 1, 2006, Pages 57-74

  Krishnan, Kartik ^a   Mitchell, John E ^b  

^a MCMASTER UNIVERSITY   (Canada)

^b RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Active set approaches; Interior point cutting plane methods; Non differentiable optimization; Semidefinite programming

Indexed keywords

COMPUTER SOFTWARE; LINEAR PROGRAMMING; OPTIMIZATION; SET THEORY;

ACTIVE SET APPROACHES; INTERIOR POINT CUTTING PLANE METHODS; NON-DIFFERENTIABLE OPTIMIZATION; SEMIDEFINITE PROGRAMMING;

COMPUTER PROGRAMMING;

EID: 29644444223     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780500065283     Document Type: Article

References (38)

1. Todd, M.J., 2001, Semidefinite optimization. Acta Numerica, 10, 515-560.
2. Vandenberghe, L. and Boyd, S., 1996, Semidefinite programming. SIAM Review, 38, 49-95.
3. Wolkowicz, H., Saigal, R. and Vandenberghe, L., 2000, Handbook on Semidefinite Programming (Kluwer Academic Publishers).
4. Helmberg, C., 1996, Semidefinite Programming Homepage. Available online at: http://www-user.tuchemnitz.de/~helmberg/semidef.html.
5. Horn, R.A. and Johnson, C.R., 1990, Matrix Analysis (New York: Cambridge University Press).
6. Overton, M.L., 1992, Large-scale optimization of eigenvalues. SIAM Journal on Optimization, 2, 88-120.
7. Grötschel, M., Lovasz, L. and Schrijver, A., 1993, Geometric Algorithms and Combinatorial Optimization (Berlin: Springer Verlag).
8. Goffin, J.-L. and Vial, J.-P., 2002, Convex non-differentiable optimization: a survey focussed on the analytic center cutting plane method. Optimization Methods and Software, 17, 805-867.
9. Mitchell, J.E., 2003, Polynomial interior point cutting plane methods. Optimization Methods and Software, 18, 507-534.
10. Krishnan, K. and Mitchell, J.E., 2001, A linear programming approach to Semidefinite programming problems. Technical Report, Department of Mathematical Sciences, Rensselaer Polytechnic Institute.
11. Goldfarb, D., 2002, The simplex method for conic programming. Technical Report, CORC, Columbia University.
12. Oskoorouchi, M. and Goffin, J.L., 2003, The analytic center cutting plane method with Semidefinite cuts. SIAM Journal on Optimization, 13, 1029-1153.
13. Helmberg, C. and Rendl, F., 2000, A spectral bundle method for Semidefinite programming. SIAM Journal on Optimization, 10, 673-696.
14. Krishnan, K., Pataki, G. and Zhang, Y., 2005, A non-polyhedral active set approach to SDP, forthcoming.
15. Toh, K.C., Zhao, G. and Sun, J., 2002, A multiple cut analytic center cutting plane method for Semidefinite feasibility problems. SIAM Journal on Optimization, 12, 1126-1146.
16. Sun, J., Toh, K.C. and Zhao, G.Y., 2002, An analytic center cutting plane method for Semidefinite feasibility problems. Mathematics of Operation Research, 27, 332-346.
17. Alizadeh, E., Haeberly, J.P.A. and Overton, M.L., 1997, Complementarity and non-degeneracy in Semidefinite programming. Mathematical Programming, 77, 111-128.
18. Pataki, G., 1998, On the rank of extreme matrices in Semidefinite programs and the multiplicity of optimal eigenvalues. Mathematics of Operations Research, 23, 339-358.
19. Cheney, E.W. and Goldstein, A.A., 1959, Newton's method for convex programming. Numerische Mathematik, 1, 253-268.
20. Kelley, J.E., 1960, The cutting plane method for solving convex programs. Journal of the SIAM, 8, 703-712.
21. Krishnan, K., 2000, Linear Programming Approaches for Semidefinite Programming Problems. PhD thesis, Department of Mathematical Sciences, Rensselaer Polytechnic Institute.
22. Krishnan, K. and Mitchell, J.E., 2003, Properties of a cutting plane algorithm for semidefinite programming. Technical Report, Department of Mathematical Sciences, Rensselaer Polytechnic Institute.
23. Krishnan, K. and Terlaky, T., 2005, Interior point and semidefinite approaches in combinatorial optimization. In: D. Avis, A. Hertz, and O. Marcotte (Eds) Graph Theory and Combinatorial Optimization (New York: Springer), pp. 101-158.
24. Anstreicher, K.M., 1999, Towards a practical volumetric cutting plane method for convex programming. SIAM Journal on Optimization, 9, 190-206.
25. Lemarechal, C., 1989, In: Optimization, G.L. Nemhauser, A.H.G. Rinnooy Kan, and M.J. Todd (Eds) Non-differentiable Optimization (Amsterdam-New York-Oxford-Tokyo: North-Holland), pp. 529-572.
26. Kiwiel, K.C., 1985, Methods of Descent for Non-differentiable Optimization. Lecture Notes in Mathematics, 1133 (Berlin: Springer Verlag).
27. Hiriart-Urruty, J.B. and Lemarechal, C., 1993, Convex analysis and Minimization Algorithms II (Berlin Heidelberg: Springer Verlag).
28. Makela, M.M. and Neittaanmaki, P., 1992, Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control (World Scientific Publishing Co.).
29. Kiwiel, K.C., 1990, Proximity control in bundle methods for convex non-differentiable minimization. Mathematical Programming, 46, 105-122.
30. Oskoorouchi, M., 2002, The analytic center cutting plane method with semidefinite cuts. PhD thesis, Faculty of Management, McGill University, Montreal, Canada.
31. Helmberg, C., 2000, Semidefinite Programming for Combinatorial Optimization. Habilitationsschrift, ZIB-Report ZR-00-34, Konrad-Zuse-Zentrum Berlin.
32. Helmberg, C. and Kiwiel, K.C., 2002, A spectral bundle method with bounds. Mathematical Programming, 93, 173-194.
33. Helmberg, C. and Oustry, F., 2000, Bundle methods to minimize the maximum eigenvalue function. In H. Wolkowicz, R. Saigal, and L. Vandenberghe, (Eds) Handbook of Semidefinite Programming (Boston-Dordrecht-London: Kluwer Academic Publishers), pp. 307-337.
34. Oustry, F., 2000, A second order bundle method to minimize the maximum eigenvalue function. Mathematical Programming, 89(1), 1-33.
35. Pataki, G., 1996, Cone-LP's and Semidefinite Programs: Geometry and a Simplex-type Method. In: W.H. Cunningham, S.T. McCormick, and M. Queyranne (Eds) Proceedings of the Fifth IPCO Conference (Springer Verlag).
36. Pataki, G., 2000, The geometry of semidefinite programming. In: H. Wolkowicz, R. Saigal, and L. Vandenberghe (Eds) Handbook of Semidefinite Programming: Theory, Algorithms, and Applications (Kluwer Academic Publishers).
37. Krishnan, K. and Mitchell, J.E., 2004, Semidefinite based cut and price approaches for the maxcut problem. AdvOl-Report 2004/5, Department of Computing & Software, McMaster University.
38. Helmberg, C., 2003, Numerical evaluation of SB method. Mathematical Programming, 95, 381-406.