Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems

Mathematical Programming, Series B

Volumn 72, Issue 3, 1996, Pages 273-289

  Nemirovskii, Arkadii ^a   Scheinberg, Katya ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b 331 Mudd Building ^*  (United States)

Author keywords

Conic form; Convex quadratically constrained quadratic problem; Interior point method; Karmarkar's algorithm; Potential function; Projective transformation

Indexed keywords

EID: 0000809108     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02592093     Document Type: Article

References (18)

1. F. Alizadeh, "Combinatorial optimization with interior point methods and semi-definite matrices," Ph.D. Thesis, Graduate School, University of Minnesota, (1991).
2. F. Alizadeh, "Optimization over the positive-semidefinite cone: interior-point methods and combinatorial applications," in: P.M. Pardalos, ed., Advances in Optimatization and Parallel Computing. (North-Holland, Amsterdam, 1992) pp. 1-25.
3. 3L) primal interior point algorithm for convex quadratic programming," Mathematical Programming 49 (1991) 325-340.
4. F. Jarre, "On the convergence of the method of analytic centers when applied to convex quadratic programs," Mathematical Programming 49 (1991) 341-358.
5. N. Karmarkar, "A new polynomial-time algorithm for linear programming," Combinatorica 4 (1984) 373-395.
6. S. Mehrotra and J. Sun, "A method of analytic centers for quadratically constrained convex quadratic programs," SIAM Journal on Numerical Analysis 28 (1991) 529-544.
7. S. Mizuno, M.J. Todd and Y. Ye., "On adaptive step primal-dual interior point algorithms for linear programming," Mathematics of Operations Research 18 (1993) 964-981.
8. R.D.C. Monteiro and I. Adler, Interior path-following primal-dual algorithms. Part II: Convex Quadratic programming, Mathematical Programming 44 (1989) 43-66.
9. Yu.E Nesterov and A.S. Nemirovsky, "Polynomial-time barrier methods in convex programming," (in Russian) Ekonomika i matem. metody 24 (6) (1988); (translated into English as Matekon: Translations of Russian and East European Mathematical Economics).
10. Yu.E Nesterov and A.S. Nemirovsky, "Polynomial-time barrier methods in convex programming," (in Russian) Ekonomika i matem. metody 24 (6) (1988); (translated into English as Matekon: Translations of Russian and East European Mathematical Economics).
11. Yu.E. Nesterov and A.S. Nemirovsky, "Logarithmically homogeneous barriers and polynomial time interior point methods based on Lyapunov's functions," Preprint, Central Economic & Mathematical Institute, USSR Academy of Sciences Moscow (1990).
12. Yu.E. Nesterov and A.S. Nemirovsky, 'Conic' formulation of a convex programming problem and duality." Optimization Methods and Software; 1 (1992) 95-115.
13. Yu.E. Nesterov and A.S. Nemirovsky Interior-point polynomial Algorithms in Convex Programming, (SIAM, Philadelphia, PA, 1994).
14. Yu.E. Nesterov and M.J. Todd, "Self-scaled cones and interior-point methods in nonlinear programming," Manuscript, 1994.
15. M.J. Todd, "Anticipated behavior of Karmarkar's algorithm," Technical Report No. 879, School of Operations Research and Industrial Engineering, College of Engineering, Cornell University, Ithaca, NY (1989).
16. M.J. Todd, and Y. Ye, "A centered projective algorithm for linear programming," Mathematics of Operations Research 15 (1990) 508-529.
17. 3L) potential reduction algorithm for linear programming," Mathematical Programming 50 (1991) 239-258.
18. Y. Ye, "Comparative analisys of affine scaling algorithms based on simplifying assumptions," Mathematical Programming 52 (1991) 405-414.