A long-step primal - Dual path-following method for semidefinite programming

Operations Research Letters

Volumn 23, Issue 1-2, 1998, Pages 53-61

  Jiang, Jianmin ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Logarithmic barrier function; Primal dual interior point methods; Proximity measure; Semidefinite programming

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; OPTIMIZATION; PROBLEM SOLVING;

LOGARITHMIC BARRIER FUNCTION; PRIMAL DUAL INTERIOR POINT METHOD; PROXIMITY MEASURE; SEMIDEFINITE PROGRAMMING;

LINEAR PROGRAMMING;

EID: 0032131673     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(98)00018-2     Document Type: Article

References (25)

1. F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization problems, SIAM J. Optim. 5 (1995) 13-51.
2. F. Alizadeh, J.-P.A. Haeberly, M.L. Overton, Complementarity and nondegeneracy in semidefinite programming, RUTCOR, Rutgers University, New Brunswick, NJ, 1995.
3. K.M. Anstreicher, M. Fampa, A long-step path following algorithm for semidefinite programming problems, Working Paper, 1996.
4. K. Anstreicher, D. den Hertog, C. Roos, T. Terlaky, A long step barrier method for convex quadratic programming, Algorithmica 10 (1993) 365-382.
5. D. Den Hertog, Interior Point Approach to Linear, Quadratic and Convex Programming Kluwer Academic Publishers, Dordrecht, 1994.
6. L. Faybusovich, On a matrix generalization of affine-scaling vector fields, SIAM J. Matrix Anal. Appl. 16 (1995) 886-897.
7. L. Faybusovich, Semi-definite programming: a path-following algorithm for linear-quadratic functional, Technical Report, Department of Mathematics, University of Notre Dame, Notre Dame, IN, USA, 1995; SIAM J. Optim., to appear.
8. R.M. Freund, Complexity of an algorithm for finding an approximate solution of a semidefinite program with no regularity assumption, Technical Report OR 302-94, Operations Research Center, MIT, 1994.
9. B. He, E. de Klerk, C. Roos, T. Terlaky, Method of approximate centers for semi-definite programming, Report 96-27, Faculty of Technical Mathematics and Informatics, Delft University of Technology, The Netherlands, 1996.
10. C. Helmberg, F. Rendl, R.J. Vanderbei, H. Wolkowicz, An interior-point method for semidefinite programming. Manuscript, 1994; SIAM J. Optim., to appear.
11. B. Jansen, C. Roos, T. Terlaky, J.P. Vial, Primal-dual algorithms for linear programming based on the logarithmic barrier method, J. Optim. Theory Appl. 83 (1994) 1-26.
12. J. Jiang, M. Shi, A logarithmic barrier Newton method for semidefinite programming, Systems Sci. Math. Sci. 10 (1997) 168-175.
13. M. Kojima, S. Shindoh, S. Hara, Interior-point methods for the monotone linear complementarity problem in symmetric matrices, Research Report on Information Sciences, B-282, Dept. of Information Sciences, Tokyo Institute of Technology, 2-12-1 Oh-Okayama, Meguro-ku, Tokyo 152, Japan, 1995.
14. R.D.C. Monteiro, Primal-dual path following algorithms for semidefinite programming, Manuscript, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, 1995.
15. Y. Nesterov, A.S. Nemirovskii, Interior Point Polynomial Methods in Convex Programming: Theory and Algorithm SIAM Publications, SIAM, Philadelphia, USA, 1993.
16. Y. Nesterov, M.J. Todd, Primal-dual interior-point methods for self-scaled cones, Technical Report 1125, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York, 1995.
17. M.L. Overton, On minimizing the maximum eigenvalue of a symmetric matrix, SIAM J. Matrix Anal. Appl. 9 (1988) 256-268.
18. M. Ramana, L. Tuncel, H. Wolkowicz, Strong duality for semidefinite programming, Dept. of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada, 1995.
19. C. Roos, J.-Ph. Vial, Long steps with the logarithmic penalty barrier function, in: J. Gabszevwicz, J.-F. Richard, L. Wolsey (Eds.), Economic Decision-Making: Games, Economics and Optimization (dedicated to Jacques H. Drèze), Elsevier Science Publishers, Amsterdam, 1990, pp. 433-441.
20. C. Roos, J.-Ph. Vial, A polynomial method of approximate centers for linear programming, Math. Programming 54 (1992) 295-306.
21. J.F. Sturm, S. Zhang, Symmetric primal-dual path following algorithms for semidefinite programming, Report 9554/A, Econometric Institute, Erasmus University Rotterdam, The Netherlands, 1995.
22. M.J. Todd, K.C. Toh, R.H. Tütüncü, On the Nesterov-Todd direction in semidefinite programming, Technical Report 1154, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York, 1996.
23. L. Vandenberghe, S. Boyd, A primal-dual potential reduction method for problems involving matrix inequalities, Math. Programming 69 (1995) 205-236.
24. L. Vandenberghe, S. Boyd, Semidefinite programming, SIAM Rev. 38 (1996) 49-95.
25. Y. Zhang, On extending primal-dual interior-point algorithms from linear programming to semidefinite programming, Technical Report, Department of Mathematics and Statistics, University of Maryland Baltimore County, Baltimore, Maryland, USA, 1995.