Semidefinite programming: A path-following algorithm for a linear-quadratic functional

SIAM Journal on Optimization

Volumn 6, Issue 4, 1996, Pages 1007-1024

  Faybusovich, Leonid ^a  

^a UNIVERSITY OF NOTRE DAME   (United States)

Author keywords

Interior point methods; Quadratic programming; Semidefinite programming

Indexed keywords

EID: 0030505669     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623494270741     Document Type: Article

References (19)

1. F. ALIZADEH, Optimization over the positive-definite cone: Interior-point methods and combinatorial applications, in Advances in Optimization and Parallel Computing, P. Pardalos, ed., North-Holland, Amsterdam, 1992.
2. F. ALIZADEH, J.-P.A. HAEBERLY, AND M. L. OVERTON, Primal-Dual Interior-Point Methods for Semidefinite Programming, preprint, 1994.
3. S. BOYD AND L. EL GHAOUI, Method of centers for minimizing generalized eigenvalues, Linear Algebra Appl., 188, 189 (1993), pp. 63-111.
4. S. BOYD AND L. VANDENBERGHE, Primal-dual potential reduction method for problems involving matrix inequalities, Math. Programming, 69 (1995), pp. 205-236.
5. S. BOYD, L. EL GHAOUI, E. FERON, AND V. BALAKRISHNAN, Linear Matrix Inequalities in System and Control Theory, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1994.
6. D. A. BAYER AND J. C. LAGARIAS, The nonlinear geometry of linear programming I, Trans. Amer. Math. Soc., 314 (1989), pp. 499-526.
7. D. DEN HERTOG, Interior Point Approach to Linear, Quadratic and Convex Programming, Kluwer Academic Publishers, Norwell, MA, 1994.
8. L. FAYBUSOVICH, On a matrix generalization of affine-scaling vector fields, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 886-897.
9. _, A Hamiltonian structure for generalized affine-scaling vector fields, J. Nonlinear Sci., 5 (1995), pp. 11-28.
10. C. GONZAGA, Path-following methods for linear programming. SIAM Rev., 34 (1992), pp. 167-224.
11. O. GULER, Barrier Functions in Interior Point Methods, Math. Oper. Res., to appear.
12. U. HELMKE AND J. MOORE, Optimization and Dynamical Systems, Springer, Berlin, New York, 1994.
13. F. JARRE, Interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices, SIAM J. Control Optim., 31 (1993), pp. 1360-1377.
14. YU. E. NESTEROV AND A. S. NEMIROVSKY, Interior Point Polynomial Algorithms in Convex Programming, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1994.
15. YU. NESTEROV AND M. TODD, Self-Scaled Cones and Interior-Point Methods in Nonlinear Programming, Math. Oper. Res., to appear.
16. M. L. OVERTON AND R. S. WOMERSLEY, Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices, Math. Programming, 62 (1993), pp. 321-357.
17. F. RENDL, R. VANDERBEI, AND H. WOLKOWITZ, A Primal-Dual Interior-Point Method for the Max-Min Eigenvalue Problem, Tech. Report, University of Waterloo, Ontario, Canada, 1993.
18. C. ROOS AND J.-PH. VIAL, A polynomial method of approximate centers for linear programming, Math. Programming, 54 (1992), pp. 295-305.
19. L. VANDENBERGHE AND S. BOYD, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.