Skip to main content
Log in

AnO(n 2) active set method for solving a certain parametric quadratic program

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

This paper presents anO(n 2) method for solving the parametric quadratic program

$$\min (1/2)x'Dx - a'x + (\lambda /2)\left( {\sum\limits_{j = 1}^n {\gamma _j x_j } - c} \right)^2 ,$$

having lower and upper bounds on the variables, for all nonnegative values of the parameter λ. Here,D is a positive diagonal matrix,a an arbitraryn-vecotr, each γ j ,j=1, ...,n, andc are arbitrary scalars. An application to economics is also presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Helgason, R., Kennington, J., andLall, H.,A Polynomially Bounded Algorithm for Singly Constrained Quadratic Programs, Mathematical Programming, Vol. 18, pp. 338–343, 1980.

    Google Scholar 

  2. Brucker, P.,An O(n) Algorithm for Quadratic Knapsack Problems, Operations Research Letters, Vol. 3, pp. 163–166, 1984.

    Google Scholar 

  3. Murty, K. G.,Linear Programming, John Wiley and Sons, New York, New York, 1983.

    Google Scholar 

  4. Balinski, M. L.,A Competitive (Dual) Simplex Method for the Assignment Problem, Mathematical Programming, Vol. 34, pp. 125–141, 1986.

    Google Scholar 

  5. Hung, M. S.,A Polynomial Simplex Method for the Assignment Problem, Operations Research, Vol. 31, pp. 595–600, 1983.

    Google Scholar 

  6. Orlin, J. B.,Genuinely Polynomial Simplex and Non-simplex Methods for the Minimum Cost Flow Problem, Working Paper No. 1615-84, Sloan, 1984.

  7. Best, M. J., andChakravarti, N.,Active Set Algorithms for Isotonic Regression; a Unifying Framework, Mathematical Programming, Vol. 47, pp. 425–439, 1990.

    Google Scholar 

  8. Best, M. J., andCharkravarti, N.,Active Set Algorithms for Isotonic Regression when the Underlying Graph is an Arborescence, Report CORR 88-18, University of Waterloo, Waterloo, Ontario, Canada, 1988.

    Google Scholar 

  9. Best, M. J.,Equivalence of Some Quadratic Programming Algorithms, Mathematical Programming, Vol. 30, pp. 71–87, 1984.

    Google Scholar 

  10. Best, M. J.,An Algorithm for the Solution of the Parametric Quadratic Programming Problem, Report CORR 82-24, University of Waterloo, Waterloo, Ontario, Canada, 1982.

    Google Scholar 

  11. Best, M. J., andCaron, R.,A Parametrized Hessian Quadratic Programming Algorithm, Annals of Operations Research, Vol. 5, pp. 373–394, 1985/6.

    Google Scholar 

  12. Fletcher, R.,Practical Methods for Optimization, Vol. 2, John Wiley and Sons, New York, New York, 1980.

    Google Scholar 

  13. Gill, P. E., Murray, W., andWright, M. H.,Practical Optimization, Academic Press, New York, New York, 1981.

    Google Scholar 

  14. Yitzakhi, S.,A Tax Programming Model, Journal of Public Economics, Vol. 19, pp. 107–120, 1982.

    Google Scholar 

  15. Best, M. J., andTan, R. Y.,On O(n 2 logn)Strong Polynomial Algorithm for Quadratic Program with Two Equations and Lower and Upper Bounds, Report CORR 90-04, University of Waterloo, Waterloo, Ontario, Canada, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by D. F. Shanno

The authors wish to thank Professor T. Nguyen, Department of Economics, University of Waterloo, for directing their attention to tax programming models.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Best, M.J., Chakravarti, N. AnO(n 2) active set method for solving a certain parametric quadratic program. J Optim Theory Appl 72, 213–224 (1992). https://doi.org/10.1007/BF00940516

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00940516

Key Words

Navigation