Abstract
We present an extension of Karmarkar's linear programming algorithm for solving a more general group of optimization problems: convex quadratic programs. This extension is based on the iterated application of the objective augmentation and the projective transformation, followed by optimization over an inscribing ellipsoid centered at the current solution. It creates a sequence of interior feasible points that converge to the optimal feasible solution in O(Ln) iterations; each iteration can be computed in O(Ln 3) arithmetic operations, wheren is the number of variables andL is the number of bits in the input. In this paper, we emphasize its convergence property, practical efficiency, and relation to the ellipsoid method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. M. Anstreicher, “A monotonic projective algorithm for fractional linear programming,”Algorith-mica 1 (1986) 483–498.
E.R. Barnes, “A variation on Karmarkar's algorithm for solving linear programming,”Mathematical Programming 36 (1986) 174–182.
E.M.L. Beale, “On quadratic programming,”Naval Research Logistics Quarterly 6 (1959) 227–243.
A.R. Conn and J. W. Sinclair, “Quadratic programming via a non-differentiable penalty function,” Report 75/15, Department of Combinatorics and Optimization, University of Waterloo (Waterloo, Canada, 1975).
R.W. Cottle and G.B. Dantzig, “Complementary pivot theory of mathematical programming,”Linear Algebra and Its Applications 1 (1968) 103–125.
G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, 1963).
I.I. Dikin, “Iterative solution of problems of linear and quadratic programming,”Soviet Mathematics Doklady 8 (1967) 674–675.
B.C. Eaves, “On the basic theorem of complementarity,”Mathematical Programming 1 (1971) 68–75.
P.E. Gill and W. Murray, “Newton type methods for unconstrained and linearly constrained optimization,”Mathematical Programming 7 (1974) 311–350.
M. Grötschel, L. Lovász and A. Schrijver, “The ellipsoid method and its consequences in combinatorial optimization,”Combinatorica 1 (1981) 169–197.
C. Hildreth, “A quadratic programming procedure,”Naval Research Logistics Quarterly 4 (1957) 79–85.
S. Kapoor and P. Vaidya, “Fast algorithms for Convex quadratic programming and multicommodity flows,”Proceedings of the 18th Annual ACM Symposium on the Theory of Computing (1986) 147–159.
N. Karmarkar, “A new polynomial-time algorithm for linear programming,”Combinatorica 4 (1984) 373–395.
L.G. Khachiyan, “A polynomial algorithm for linear programming,”Soviet Mathematics Doklady 20 (1979) 191–194.
K.O. Kortanek and M. Shi, “Convergence results and numerical experiments on a linear programming hybrid algorithm,” to appear in the EuropeanJournal of Operational Research, Dept. of Mathematics, Carnegie Mellon University (PA, 1985).
M.K. Kozlov, S.P. Tarasov and L.G. Khachiyan, “Polynomial solvability of convex quadratic programming,”Soviet Mathematics Doklady 20 (1979) 1108–1111.
C.E. Lemke, “Bimatrix equilibrium points and mathematical programming,”Management Science 11 (1965) 681–689.
D.G. Luenberger,Linear and Nonlinear Programming (2nd Edition, Addison-Wesley, Menlo Park, 1984).
C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, 1982).
J. Rosen, “The gradient projection method for nonlinear programming, I. Linear constraints,”SIAM Journal on Applied Mathematics 12 (1964) 74–92.
D.C. Sorensen, “Trust region methods for unconstrained minimization,” in: M.J.D. Powell, ed.,Nonlinear Optimization (Academic Press, New York, 1981).
M.J. Todd and B.P. Burrell, “An extension of Karmarkar's algorithm for linear programming using dual variables,”Algorithmica 1 (1986) 409–424.
R.J. Vanderbei, M.S. Meketon and B.A. Freedman, “On a modification of Karmarkar's linear programming algorithm,”Algorithmica 1 (1986) 395–407.
P. Wolfe, “The simplex algorithm for quadratic programming,”Econometrica 27 (1959) 382–398.
Y. Ye and M. Kojima, “Recovering optimal dual solutions in Karmarkar's algorithm for linear programming,”Mathematical Programming 39 (1987) 305–317.
Y. Ye, “Interior algorithms for linear, quadratic, and linearly constrained convex programming,” Ph.D. Thesis, Dept. of Engineering-Economic Systems, Stanford University (CA, 1987).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ye, Y., Tse, E. An extension of Karmarkar's projective algorithm for convex quadratic programming. Mathematical Programming 44, 157–179 (1989). https://doi.org/10.1007/BF01587086
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01587086