Abstract
In a recent paper Tardos described a polynomial algorithm for solving linear programming problems in which the number of arithmetic steps depends only on the size of the numbers in the constraint matrix and is independent of the size of the numbers in the right hand side and the cost coefficients. In this paper we extend Tardos' results and present a polynomial algorithm for solving strictly convex quadratic programming problems in which the number of arithmetic steps is independent of the size of the numbers in the right hand side and the linear cost coefficients.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Bachem and B. Korte, “An algorithm for quadratic optimization over transportation polytopes,”Zeitschrift für Angewandte Mathematik und Mechanik 58 (1978) 459–461.
R.W. Cottle, “Symmetric dual quadratic programs,”Quarterly of Applied Mathematics 21 (1963) 237–243.
J.L. Debiesse and G. Matignon, “Comparison of different methods for the calculation of traffic matrices,”Annales des Télécommunications 35 (1980) 91–102.
W.S. Dorn, “Duality in quadratic programming,”Quarterly of Applied Mathematics 18 (1960) 155–162.
B.C. Eaves, “On quadratic programming,”Management Science 17 (11) (1971) 698–711.
J. Edmonds, “System of distinct representatives and linear algebra,”Journal of Research of the National Bureau of Standards, Section B 71 (1967) 241–245.
M. Grötschel, L. Lovàsz and A. Schrijver,Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988).
M. Held, P. Wolfe and H. Crowder, “Validation of subgradient optimization,”Mathematical Programming 6 (1974) 62–88.
R. Helgason, J. Kennington and H. Lall, “A polynomially bounded algorithm for a singly constrained quadratic program,”Mathematical Programming 18 (1980) 338–343.
J. Kennington and M. Shalaby, “An effective subgradient procedure for minimal cost multicommodity flow problems,”Management Science 23 (1977) 994–1004.
M.K. Kozlov, S.P. Tarasov and L.G. Khachiyan, “Polynomial solvability of convex quadratic programming,”Soviet Mathmatics Doklady 20 (1979) 1108–1111.
M. Minoux, “A polynomial algorithm for minimum quadratic cost flow problems,”European Journal of Operational Research 18 (1984) 377–387.
Eva Tardos, “A strongly polynomial algorithm to solve combinatorial linear programs,”Operations Research 34 (2) (1986) 250–256.
Author information
Authors and Affiliations
Additional information
This research was partially supported by the Natural Sciences and Engineering Research Council of Canada Grant 5-83998.
Rights and permissions
About this article
Cite this article
Granot, F., Skorin-Kapov, J. Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm. Mathematical Programming 46, 225–236 (1990). https://doi.org/10.1007/BF01585740
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01585740