Embedding methods for semidefinite programming

References

• Anderson , E. D. and Ye , Y. 1999 . On a homogeneous algorithm for monotone complementary problem . Math. Program. , 84 : 375 – 399 .
   Web of Science ®Google Scholar
• Borwein , J. M. and Wolkowicz , H. 1981 . Facial reduction for a cone-convex programming problem . J. Aust. Math. Soc. A , 30 : 369 – 380 .
   Google Scholar
• Borwein , J. M. and Wolkowicz , H. 1981 . Regularizing the abstract convex program . J. Math. Anal. Appl. , 83 : 495 – 530 .
   Web of Science ®Google Scholar
• Halicka , M. , de Klerk , E. and Roos , C. 2002 . On the convergence of the central path in semidefinite optimization . SIAM J. Optim. , 12 : 1090 – 1099 .
   Web of Science ®Google Scholar
• de Klerk , E. 2002 . Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications , Dordrech/Boston/London : Kluwer Academic Publishers .
   Google Scholar
• de Klerk , E. , Roos , C. and Terlaky , T. 1997 . Initialization in semidefinite programming via a self-dual skew-symmetric embeddings . Oper. Res. Lett. , 20 : 213 – 221 .
   Web of Science ®Google Scholar
• de Klerk , E. , Roos , C. and Terlaky , T. 1998 . Infeasible start semidefinite programming algorithms via selfdual embeddings . Fields Inst. Commun. , 18 : 215 – 236 .
   Google Scholar
• Kobayashi , K. , Nakata , K. and Kojima , M. 2007 . A conversion of an SDP having free variables into the standard form SDP . Comput. Optim. Appl. , 36 : 289 – 307 .
   Web of Science ®Google Scholar
• Kortanek , K. O. and Zhang , Q. 2001 . Perfect duality in semi-infinite and semidefinite programming . Math. Program. A , 91 : 127 – 144 .
   Web of Science ®Google Scholar
• Luo , Z. , Sturm , J. F. and Zhang , S. 1997 . Duality results for conic convex programming , Rotterdam , , The Netherlands : Econometric Institute, Erasumus University . Econometric Institute Report No. 9719/A
   Google Scholar
• Luo , Z. , Sturm , J. F. and Zhang , S. 2000 . Conic convex programming and self-dual embedding . Optim. Methods Softw. , 14 : 169 – 218 .
   Web of Science ®Google Scholar
• Mizuno , S. and Todd , M. 2001 . On two homogeneous self-dual approaches to linear programming and its extensions . Math. Program. A , 89 : 517 – 534 .
   Web of Science ®Google Scholar
• NEOS Server for SDPA. Available at http://neos.mcs.anl.gov/neos/solvers/sdp:SDPA/SPARSESDPA.html
   Google Scholar
• Nesterov , Y. and Nemirovsky , A. 1993 . Interior Point Polynomial Methods in Convex Programming , Philadelphia , PA : SIAM . Studies in Applied Mathematics 13
   Google Scholar
• Nesterov , Y. , Todd , M. and Ye , Y. 1999 . Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems . Math. Program. , 84 : 227 – 267 .
   Web of Science ®Google Scholar
• Potra , F. A. and Sheng , R. 1998 . On homogeneous interior-point algorithms for semidefinite programming . Optim. Methods Softw. , 9 : 161 – 184 .
   Web of Science ®Google Scholar
• Ramana , M. V. 1997 . An exact duality theory for semidefinite programming and its complexity implications . Math. Program. B , 77 : 129 – 162 .
   Web of Science ®Google Scholar
• Ramana , M. V. and Pardalos , P. M. 1996 . Semidefinite programming, in Interior Point Methods of Mathematical Programming , Edited by: Terlaky , T. Dordrecht , , The Netherlands : Kluwer .
   Google Scholar
• Ramana , M. V. , Tunçel , L. and Wolkowicz , H. 1997 . Strong duality for semidefinite programming . SIAM J. Optim. , 7 : 641 – 662 .
   Web of Science ®Google Scholar
• Sturm , J. F. 1997 . Primal-dual interior point approach to semidefinite programming , Amsterdam , , The Netherlands : Thesis Publishers . PhD thesis, Erasmus University, Rotterdam (1997) Tinbergen Institute Research Series vol. 156
   Google Scholar
• Todd , M. 2001 . Semidefinite optimization . Acta Numer. , 10 : 515 – 560 .
   Google Scholar
• L. Tunçel, Personal communication, 2008
   Google Scholar
• Vandenberghe , L. and Boyd , S. 1996 . Semidefinite programming . SIAM Rev. , 38 : 49 – 95 .
   Web of Science ®Google Scholar
• Wolkowicz , H. 1981 . Some applications of optimization in matrix theory . Linear Algebra Appl. , 40 : 101 – 118 .
   Web of Science ®Google Scholar
• Ye , Y. , Todd , M. and Mizuno , S. 1994 . An O(pnL)-iteration homogeneous and self-dual linear programming algorithm . Math. Oper. Res. , 19 : 53 – 67 .
   Web of Science ®Google Scholar
• Zhang , S. 2004 . A new self-dual embedding method for convex programming . J. Global Optim. , 29 : 479 – 496 .
   Web of Science ®Google Scholar