Conic convex programming and self-dual embedding

Optimization Methods and Software

Volumn 14, Issue 3, 2000, Pages 169-218

  Luo, Z Q ^a   Sturm, J F ^a   Zhang, S ^b  

^a MCMASTER UNIVERSITY   (Canada)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PROBLEM SOLVING;

CONIC CONVEX PROGRAMMING; SELF-DUAL EMBEDDING METHODS; SEMI-DEFINITE PROGRAMMING;

LINEAR PROGRAMMING;

EID: 0034459312     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556780008805800     Document Type: Article

References (30)

1. Boyd, S., El Ghaoui, L., Feron, E. and Balakrishnan, V. (1994). Linear matrix inequalities in system and control theory, Volume 15 of Studies in Applied Mathematics, SIAM, Philadelphia, PA.
2. Duffin, R. J. (1956). Infinite programs. In: Kuhn, H. W. and Tucker, A. W. Editors, Linear Inequalities and Related Systems, pp. 157-170. Princeton University Press, Princeton, NJ.
3. Gay, D. M. (1985). Electronic mail distribution of linear programming test problems. Mathematical Programming Society Committee on Algorithms News Letter, 13, 10-12.
4. Goldman, A. J. and Tucker, A. W. (1956). Polyhedral convex cones. In: Kuhn, H. W. and Tucker, A. W. Editors, Linear Inequalities and Related Systems, pp. 19-40. Princeton University Press, Princeton, NJ.
5. Güler, O. and Ye, Y. (1993). Convergence behavior of interior-point algorithms. Mathematical Programming, 60, 215-228.
6. De Klerk, E., Roos, C. and Terlaky, T. (1997). Initialization in semidefinite programming via a self-dual skew-symmetric embedding. Operations Research Letters, 20(5), 213-221.
7. De Klerk, E., Roos, C. and Terlaky, T. (1998). Infeasible start semidefinite programming algorithms via self-dual embeddings. In: The Fields Institute for Research in Mathematical Sciences, Communications Series.
8. Kojima, M., Shindoh, S. and Hara, S. (1997). Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM Journal on Optimization, 7, 86-125.
9. Lin, C. J. and Saigal, R. (1995). An infeasible start predictor corrector method for semi-definite linear programming. Technical report, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, USA.
10. Luo, Z.-Q., Sturm, J. F. and Zhang, S. (1996). Duality and self-duality for conic convex programming. Technical Report 9620/A, Econometric Institute, Erasmus University Rotterdam, Rotterdam, The Netherlands.
11. Luo, Z.-Q., Sturm, J. F. and Zhang, S. (1997). Duality results for conic convex programming. Technical Report 9719/A, Econometric Institute, Erasmus University Rotterdam, Rotterdam, The Netherlands.
12. Lustig, I. J., Marsten, R. E. and Shanno, D. F. (1991). Computational experience with a primal-dual interior point method for linear programming. Linear Algebra and its Applications, 152, 191-222.
13. Lustig, I. J., Marsten, R. E. and Shanno, D. F. (1992). On implementing Mehrotra's predictor-corrector interior point method for linear programming. SIAM Journal on Optimization, 2, 435-449.
14. Mizuno, S. (1996). Infeasible-interior-point algorithms. In: Terlaky, T. Editor, Interior-point Methods of Mathematical Programming, pp. 159-187. Kluwer Academic Publishers, Dordrecht.
15. Monteiro, R. D. C. (1997). Primal-dual path following algorithms for semidefinite programming. SIAM Journal on Optimization, 7(3), 663-678.
16. Nesterov, Y. and Nemirovsky, A. (1994). Interior point polynomial methods in convex programming, Volume 13 of Studies in Applied Mathematics. SIAM, Philadelphia.
17. Nesterov, Y. and Todd, M. J. (1997). Self-scaled barriers and interior-point methods for convex programming. Mathematics of Operations Research, 22(1), 1-42.
18. Nesterov, Y. and Todd, M. J. (1998). Primal-dual interior-point methods for self-scaled cones. SIAM Journal on Optimization, 8, 324-364.
19. Nesterov, Y., Todd, M. J. and Ye, Y. (1999). Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems. Mathematical Programming, 84(2), 227-267.
20. Potra, F. A. and Sheng, R. (1998). On homogeneous interior-point algorithms for semidefinite programming. Optimization Methods and Software, 9, 161-184. Special Issue Celebrating the 60th Birthday of Professor Naum Shor.
21. Ramana, M. V. (1997). An exact duality theory for semidefinite programming and its complexity implications. Mathematical Programming, 77(2), 129-162.
22. Rockafellar, R. T. (1970). Convex Analysis, Princeton University Press, Princeton, NJ.
23. Sturm, J. F. (1997). Primal-dual Interior Point Approach to Semidefinite Programming, Volume 156 of Tinbergen Institute Research Series. Thesis Publishers, Amsterdam, The Netherlands.
24. Sturm, J. F. and Zhang, S. (1999). Symmetric primal-dual path following algorithms for semidefinite programming. Applied Numerical Mathematics, 29, 301-315.
25. Todd, M. J. and Ye, Y. (1998). Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming. Mathematical Programming, 81, 1-21.
26. Tucker, A. W. (1956). Dual systems of homogeneous linear relations. In: Kuhn, H. W. and Tucker, A. W. Editors, Linear Inequalities and Related Systems, pp. 3-18, Princeton University Press, Princeton, NJ.
27. Vandenberghe, L. and Boyd, S. (1996). Semidefinite programming. SIAM Review, 38, 49-95.
28. Xu, X., Hung, P. and Ye, Y. (1996). A simplified homogeneous and self-dual linear programming algorithm and its implementation. Annals of Operations Research, 62, 151-172.
29. Ye, Y. (1997). On homogeneous and self-dual algorithms for LCP. Mathematical Programming, 76(1), 211-221.
30. Ye, Y., Todd, M. J. and Mizuno, S. (1994). An O(√nL)-iteration homogeneous and self-dual linear programming algorithm. Mathematics of Operations Research, 19, 53-67.