Initialization in semidefinite programming via a self-dual skew-symmetric embedding

Operations Research Letters

Volumn 20, Issue 5, 1997, Pages 213-221

  De Klerk, E ^a   Roos, C ^a   Terlaky, T ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Central path; Duality; Initialization; Self dual embedding; Semidefinite programming

Indexed keywords

EID: 0000921195     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6377(97)00011-4     Document Type: Article

References (16)

1. F. Alizadeh, Combinatorial optimization with interior point methods and semi-definite matrices, Ph.D. Thesis, University of Minnesota, Minneapolis, USA, 1991.
2. F. Alizadeh, J.-P.A. Haeberley, M.L. Overton, Complementarity and nondegeneracy in semidefinite programming, Working Paper, RUTCOR, Rutgers University, New Brunswick, NJ, 1995.
3. E.D. Andersen, Y. Ye, On a homogeneous algorithm for the monotone complementarity problem, Tech. Report, Department of Management Sciences, University of Iowa, Iowa City, USA, 1995.
4. M.S. Bazarraa, H.D. Sherali, C.M. Shetty, Nonlinear Programming: Theory and Algorithms, Wiley, New York, 1993.
5. D. Goldfarb, K. Scheinberg, Interior point trajectories in semidefinite programming, Working Paper, Dept. of IEOR, Columbia University, New York, NY, 1996.
6. O. Güler, Y. Ye, Convergence behavior of interior-point algorithms, Math. Programming 60 (1993) 215-228.
7. B. Jansen, C. Roos, T. Terlaky, The theory of linear programming: skew symmetric self-dual problems and the central path, Optimization 29 (1994) 225-233.
8. G. Pataki, On the rank of extreme matrices in semidefinite programming and the multiplicity of optimal eigenvalues, Tech. Report MSRR-604, Carnegie Mellon University, Pitsburgh, USA, Revised August 1995.
9. G. Pataki, On the facial structure of cone-lp's and semi-definite programs, Tech. Report MSRR-595, Carnegie Mellon University, Pitsburgh, USA, 1995.
10. F.A. Potra, R. Sheng, Homogeneous interior-point algorithms for semidefinite programming, Reports on Computational Mathematics 82, Department of Mathematics, The University of Iowa, Iowa City, USA, 1995.
11. M. Ramana, An exact duality theory for semidefinite programming and its complexity implications, DIMACS Tech. Report 95-02, RUTCOR, Rutgers University, New Brunswick, NJ, USA, 1995.
12. J.F. Sturm, S. Zhang, Symmetric primal-dual path following algorithms for semidefinite programming, Tech. Report 9554/A, Tinbergen Institute, Erasmus University Rotterdam, 1995.
13. M.J. Todd, Y. Ye, Approximate Farkas lemmas and stopping rules for iterative infeasible point algorithms for linear programming, Tech. Report 1109, School of OR and Industrial Engineering, Cornell University, Ithaca, New York, 1994.
14. L. Vanderberghe, S. Boyd, Semidefinite Programming, SIAM Rev. 38 (1996) 49-95.
15. Y. Ye, A homogeneous and self-dual algorithm for LCP, Math. Programming 76 (1997) 211-222.
16. Y. Ye, M.J. Todd, S. Mizuno, An script O sign(√nL)-iteration homogeneous and self-dual linear programming algorithm, Math. Oper. Res. 19 (1994) 53-67.