References
- Ben-Tal , A. and Nemirovsky , A. December 1996 . Robust convex optimization December , Haifa, , Israel Technical report, Faculty of Industrial Engineering and Management , Technion
- Ben-Tal , A. and Nemirovsky , A. 1992 . Interior point polynomial-time method for truss topology design Haifa, , Israel Technical report, Faculty of Industrial Engineering anc Management, Technion
- Goemans , M.X. and Williamson , D.P. 1996 . Improved Approximation Algoj rithms for maximum cut and satisfiability problem using semi-definite programming . Journal of ACM , 42 : 1115 – 1145 .
- Lovász , L. and Shrijver , A. 1990 . Cones of matrices and setfunctions, and 0-1 optimization . SIAM Journal on Optimization , 1 : 166 – 190 .
- Nesterov , Yu . March 1997 . Quality of semidefinite relaxation for nonconvex quadratic optimization March , CORE Discussion Paper #9719
- Nesterov , Yu and Nemirovsky , A. 1994 . Interior Point Polynomial Algorithms in\ Convex Programming, SIAM , Vol. 160 , Philadelphia : SIAM .
- Oustry , F. , Ghaoui , L.E. and Lebert , H. 1996 . Robust solutions to uncertain semidefinite programs . SIAM J. on Optimization , 160 Submitted
- Shor , N. 1988 . Quadratic optimization problems . Tekhnicheskaya kibernetika , 160 ( 1 ) Izvestiya AN SSSR
- Ye , Y. 1997 . Approximating quadratic programming with bound constraints , Iowa City : University of Iowa . Working paper, Department of Management Sciences
- Ye , Y. 1997 . Approximating quadratic programming with quadratic constraints , Iowa City : University of Iowa . Working paper, Department of Management Sciences