Skip to main content
SpringerLink
Log in

A weighted gram-schmidt method for convex quadratic programming

  • Published:
Mathematical Programming Submit manuscript

Abstract

Range-space methods for convex quadratic programming improve in efficiency as the number of constraints active at the solution decreases. In this paper we describe a range-space method based upon updating a weighted Gram-Schmidt factorization of the constraints in the active set. The updating methods described are applicable to both primal and dual quadratic programming algorithms that use an active-set strategy.

Many quadratic programming problems include simple bounds on all the variables as well as general linear constraints. A feature of the proposed method is that it is able to exploit the structure of simple bound constraints. This allows the method to retain efficiency when the number ofgeneral constraints active at the solution is small. Furthermore, the efficiency of the method improves as the number of active bound constraints increases.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • R.H. Bartels, G.H. Golub and M.A. Saunders, “Numerical techniques in mathematical programming”, in: J.B. Rosen, Q.L. Mangasarian and K. Ritter, eds.,Nonlinear programming (Academic Press, London and New York, 1970) pp. 123–176.

    Google Scholar 

  • J.R. Bunch and L.C. Kaufman, “A computational method for the indefinite quadratic programming problem”,Linear Algebra and its Applications 34 (1980) 341–370.

    Article  MATH  MathSciNet  Google Scholar 

  • J.W. Daniel, W.B. Gragg, L.C. Kaufman and G.W. Stewart, “Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization”,Mathematics of Computation 30 (1976) 772–795.

    Article  MATH  MathSciNet  Google Scholar 

  • A. Dax, “An active set algorithm for convex quadratic programming”, Technical Report, Hydrological Service (Jerusalem, Israel, 1981).

    Google Scholar 

  • R. Fletcher, “A general quadratic programming algorithm”,Journal of the Institute of Mathematics and its Applications 7 (1971) 76–91.

    Article  MATH  MathSciNet  Google Scholar 

  • P.E. Gill and W. Murray, “Numerically stable methods for quadratic programming”,Mathematical Programming 14 (1978) 349–372.

    Article  MATH  MathSciNet  Google Scholar 

  • P.E. Gill, G.H. Golub, W. Murray and M.A. Saunders, “Methods for modifying matrix factorizations”,Mathematics of Computation 28 (1974) 505–535.

    Article  MATH  MathSciNet  Google Scholar 

  • P.E. Gill, N.I.M. Gould, W. Murray, M.A. Saunders and M.H. Wright, “Range-space methods for convex quadratic programming”, Technical Report SOL 82-14, Department of Operations Research, Stanford University (Stanford, CA, 1982).

    Google Scholar 

  • P.E. Gill, W. Murray and M.H. Wright,Practical optimization (Academic Press, London and New York, 1981).

    MATH  Google Scholar 

  • D. Goldfarb, “Matrix factorizations in optimization of nonlinear functions subject to linear constraints”,Mathematical Programming 10 (1976) 1–31.

    Article  MATH  MathSciNet  Google Scholar 

  • D. Goldfarb and A. Idnani, “A numerically stable dual method for solving strictly convex quadratic programs”,Mathematical Programming 27 (1983) 1–33.

    MATH  MathSciNet  Google Scholar 

  • W. Murray, “An algorithm for finding a local minimum of an indefinite quadratic program”, Report NAC 1, National Physical Laboratory (Teddington, England, 1971).

    Google Scholar 

  • M.J.D. Powell, “An upper-triangular matrix method for quadratic programming”, in: O.L. Mangasarian, R.R. Meyer and S.M. Robinson, eds.,Nonlinear programming 4 (Academic Press, London and New York, 1981) pp. 1–24.

    Google Scholar 

  • K. Schittkowski, “On the convergence of a sequential quadratic programming method with an augmented Lagrangian line search function”, Report SOL 82-4, Department of Operations Research, Stanford University (Stanford, CA, 1982).

    Google Scholar 

Download references

Author information

Author notes

  1. Nicholas I. M. Gould

    Present address: Department of Combinatorics and Optimization, University of Waterloo, Ontario, Canada

Authors and Affiliations

  1. Systems Optimization Laboratory, Department of Operations Research, Stanford University, 94305, Stanford, CA, USA

    Philip E. Gill, Nicholas I. M. Gould, Walter Murray, Michael A. Saunders & Margaret H. Wright

Authors
  1. Philip E. Gill
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicholas I. M. Gould
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Walter Murray
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Michael A. Saunders
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Margaret H. Wright
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported by the U.S. Department of Energy Contract DE-AC03-76SF00326, PA No. DE-AT03-76ER72018; National Science Foundation Grants MCS-7926009 and ECS-8012974; the Office of Naval Research Contract N00014-75-C-0267; and the U.S. Army Research Office Contract DAAG29-79-C-0110. The work of Nicholas Gould was supported by the Science and Engineering Research Council of Great Britain.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gill, P.E., Gould, N.I.M., Murray, W. et al. A weighted gram-schmidt method for convex quadratic programming. Mathematical Programming 30, 176–195 (1984). https://doi.org/10.1007/BF02591884

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation