Mixed linear and semidefinite programming for combinatorial and quadratic optimization

Optimization Methods and Software

Volumn 11, Issue 1, 1999, Pages 515-544

  Benson, Steven J ^a   Ye, Yinyu ^a   Zhang, Xiong ^b  

^a UNIVERSITY OF IOWA   (United States)

^b HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; LINEAR PROGRAMMING; RANDOM PROCESSES;

COMBINATORIAL OPTIMIZATION; QUADRATIC OPTIMIZATION; SEMIDEFINITE PROGRAMMING; SEMIDEFINITE RELAXATION;

QUADRATIC PROGRAMMING;

EID: 0033294696     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789908805761     Document Type: Article

References (22)

1. Alizadeh, F. (1991). Combinatorial optimization with interior point methods and semi-definite matrices, Ph.D. Thesis, University of Minnesota, Minneapolis, MN.
2. Anstreicher, K. M. and Fampa, M. (1996). A long-step path following algorithm for semidefmite programming problems, Working Paper, Department of Management Science, The University of Iowa, Iowa City.
3. Atkinson, K. E. (1989). An Introduction to Numerical Analysis (Second Edition John Wiley & Sons), New York.
4. Steven J. Benson, Yinyu Ye and Xiong Zhang. (1999). DSDP user's guide, http://dollar.biz. uiowa.edu/col/, January.
5. Benson, S. Ye, Y. and Zhang, X. (1997). Solving sparse, large scale positive semidefinite programs, Department of Management Science, The University of Iowa, Iowa City, To appear in SIAM J. of Optimization.
6. Bertsimas, D. and Ye, Y. (1997). Semidefinite relaxations, multivariate normal distributions, and order statistics, Working Paper, Sloan School, MIT, December.
7. Burer, S. and Monteiro, R. D. C. (1998). An efficient algorithm for solving the MAXCUT SDP relaxation, Working Paper, School of ISyE, Georgia Tech, submitted to Mathematical Programming, December.
8. De Simone and et al. (1995). Exact ground states of Ising spin glasses: new experimental results with branch-and-cut algorithm, Journal of Statistical Physics, 80(1/2), 487-486.
9. Frieze, A. and Jerrum, M. (1995). Improved approximation algorithms for max k-cut and max bisection, Proc. 4th IPCO Conference 1-13.
10. Fujie, T. and Kojima, M. (1995). Semidefinite programming relaxation for nonconvex quadratic programs, Research Report B-298, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, Meguro, Tokyo 152, To appear in Journal of Global Optimization, May.
11. Fujisawa, K., Fukuda, M., Kojima, M. and Nakata, K. (1997). Numerical evaluation of SDPA (semidefinite programming algorithm), Research Report B-330, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro-ku, Tokyo 152, September.
12. Goemans, M. X. and Williamson, D. P. (1995). Improved approximation algorithms for Maximum Cut and Satisfiability problems using semidefinite programming, Journal of ACM, 42, 1115-1145.
13. Helmberg, C. and Rendl, F. (1997). A spectral bundle method for semidefinite programming, ZIB Preprint SC 97-37, Konrad-Zuse-Zentrum fuer Informationstechnik Berlin, Takustrasse 7, D-14195 Berlin, Germany, August.
14. Karisch, S. E., Rendl, F. and Clausen, J. (1997). Solving graph bisection problems with semidefinite programming, Technical Report DIKU-TR-97/9, Department of Computer Science, University of Copenhagen, July I.
15. Lovász, L. and Shrijver, A. (1990). Cones of matrices and setfunctions, and 0-1 optimization, SIAM J. of Optimization, 1, 166-190.
16. Nesterov, Yu. E. (1997). Quality of semidefinite relaxation for nonconvex quadratic optimization, CORE Discussion Paper, #9719, Belgium, March.
17. Nesterov, Yu. E. and Nemirovskii, A. S. (1993). Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms. (SIAM Publications, SIAM, Philadelphia).
18. Polijak, S., Rendl, F. and Wolkowicz, H. (1995). A recipe for semidefinite relaxation for 0-1 quadratic programming, Journal of Global Optimization, 7, 51-73.
19. Todd, M. J. (1997). On search directions in interior-point methods for semidefinite programming, Technical Report No. 1205, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY.
20. Vandenberghe, L. and Boyd, S. (1996). Semidefinite programming, SIAM Review, 38(1), 49-95.
21. Ye, Y. (1999). Approximating quadratic programming with bound and quadratic constraints, Mathematical Programming, 84, 219-226.
22. Ye, Y. (1997). Interior Point Algorithms : Theory and Analysis (Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, New York.