Abstract
Convex quadratically constrained quadratic problems are considered. It is shown that such problems can be transformed to aconic form. The feasible set of the conic form is the intersection of a direct product of standard quadratic cones intersected with a hyperplane (the analogue of a simplex), and a linear subspace. For a problem of such form, the analogue of Karmarkar's projective transformation and logarithmic barrier function are built. This allows us to extend “word by word” the method of Karmarkar for LP to QCQP and allows us to obtain a similar polynomial worst-case bound for the number of iterations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Alizadeh, “Combinatorial optimization with interior point methods and semi-definite matrices,” Ph.D. Thesis, Graduate School, University of Minnesota, (1991).
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.
D. Goldfarb and S. Liu “An O(n 3 L) primal interior point algorithm for convex quadratic programming,”Mathematical Programming 49 (1991) 325–340.
F. Jarre, “On the convergence of the method of analytic centers when applied to convex quadratic programs”Mathematical Programming 49 (1991) 341–358.
N. Karmarkar, “A new polynomial-time algorithm for linear programming,”Combinatorica 4 (1984) 373–395.
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.
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.
R.D.C. Monteiro and I. Adler, Inteior path-following primal-dual algorithms. Part II: Convex Quadratic programming,Mathematical Programming 44 (1989) 43–66.
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 asMatekon: Translations of Russian and East European Mathematical Economics).
Yu.E. Nesterov and A.S. Nemirovsky, “Logarithmically homogeneous barriers and polynomial time interior point methods based on Lyapunov's functions,” Preprint, Cehtral Economic & Mathematical Institute, USSR Academy of Sciences, Moscow (1990).
Yu.E. Nesterov and A.S. Nemirovsky, “‘Conic’ formulation of a convex programming problem and duality,”Optimization Methods and Software, 1 (1992) 95–115.
Yu.E. Nesterov and A.S. NemirovskyInterior-point polynomial Algorithms in Convex Programming, (SIAM, Philadelphia, PA, 1994).
Yu.E. Nesterov and M.J. Todd, “Self-scaled cones and interior-point methods in nonlinear programming,” Manuscript, 1994.
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).
M.J. Todd, and Y. Ye, “A centered projective algorithm for linear programming,”Mathematics of Operations Research 15 (1990) 508–529.
Y. Ye, “An O(n 3 L) potential reduction algorithm for linear programming,”Mathematical Programming 50 (1991) 239–258.
Y. Ye, “Comparative analysis of affine scaling algorithms based on simplifying assumptions,”Mathematical Programming 52 (1991) 405–414.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nemirovskii, A., Scheinberg, K. Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems. Mathematical Programming 72, 273–289 (1996). https://doi.org/10.1007/BF02592093
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02592093