Skip to main content
SpringerLink
Log in

A Decomposition Method for Global and Local Quadratic Minimization

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

We present a decomposition method for indefinite quadratic programming problems having n variables and m linear constraints. The given problem is decomposed into at most m QP subproblems each having m linear constraints and n-1 variables. All global minima, all isolated local minima and some of the non-isolated local minima for the given problem are obtained from those of the lower dimensional subproblems. One way to continue solving the given problem is to apply the decomposition method again to the subproblems and repeatedly doing so until subproblems of dimension 1 are produced and these can be solved directly. A technique to reduce the potentially large number of subproblems is formulated.

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.

Similar content being viewed by others

References

  1. Best, M.J. (1996), An algorithm for the solution of the parametric quadratic programming algorithm, in H. Fischer, B. Riedmüller and S. Schäffler (eds.), Applied Mathematics and Parallel Computing–Festschrift for Klaus Ritter, Physica–Verlag, Heidelburg: pp. 57–76.

    Google Scholar 

  2. Best, M.J. and Ritter, K. (1985), Linear Programming: Active Set Analysis and Computer Programs, Prentice–Hall Inc., Englewood Cliffs, New Jersey.

    Google Scholar 

  3. Best, M.J. and Ritter, K. (1988), A quadratic programming algorithm, Zeitschrift für Operations Research 32: 271–297.

    Google Scholar 

  4. Best, M.J. and Ding, B. (1997), Global and local quadratic minimization, Journal of Global Optimization 10: 77–90.

    Google Scholar 

  5. Murty, K. (1988), Linear Complementarity, Linear and Nonlinear Programming, Heldermann, Berlin.

    Google Scholar 

  6. Sherman, J., and Morrison, W.J. (1949), Adjustment of an inverse matrix corresponding to changes in the elements of a given column or a given row of the original matrix, The Annals of Mathematical Statistics 20: 621.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada

    M.J. Best

  2. Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada

    B. Ding

Authors
  1. M.J. Best
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Best, M., Ding, B. A Decomposition Method for Global and Local Quadratic Minimization. Journal of Global Optimization 16, 133–151 (2000). https://doi.org/10.1023/A:1008328726430

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008328726430

Search

Navigation