Abstract
The strictly convex quadratic programming problem is transformed to the least distance problem — finding the solution of minimum norm to the system of linear inequalities. This problem is equivalent to the linear least squares problem on the positive orthant. It is solved using orthogonal transformations, which are memorized as products. Like in the revised simplex method, an auxiliary matrix is used for computations. Compared to the modified-simplex type methods, the presented dual algorithm QPLS requires less storage and solves ill-conditioned problems more precisely. The algorithm is illustrated by some difficult problems.
Similar content being viewed by others
References
Goldfarb D., Idnani A., A Numerically stable dual method for solving strictly convex quadratic programs, Math. Programming, 1983, 27, 1–33
Künzi H.P., Krelle W., Nichtlineare Programmirung, Springer, Berlin, 1962 (in German)
Lawson C.L., Hanson R.J., Solving least squares problems, Prentice-Hall, New-Jersey, 1974
Lent A., Censor Y., Extensions of Hildreth’s row action method for quadratic programming, SIAM J. Control Optim., 1980, 18, 444–454
Powell M.J.D., On the quadratic programming algorithm of Goldfarb and Idnani, Math. Programming Stud., 1985, 25, 46–61
Übi E., On stable least squares solution to the system of linear inequalities, Cent. Eur. J. Math., 2007, 5, 373–385
Übi E., Exact and stable least squares solution to the linear programming problem, Cent. Eur. J. Math., 2005, 3, 228–241
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Übi, E. A numerically stable least squares solution to the quadratic programming problem. centr.eur.j.math. 6, 171–178 (2008). https://doi.org/10.2478/s11533-008-0012-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.2478/s11533-008-0012-1