Skip to main content
SpringerLink
Log in

Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problems

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

Abstract

In this paper, the problem of minimizing a functionf(x) subject to a constraint ϕ(x)=0 is considered, wheref is a scalar,x ann-vector, and ϕ aq-vector, withq <n. Several conjugate gradient-restoration algorithms are analyzed: these algorithms are composed of the alternate succession of conjugate gradient phases and restoration phases. In the conjugate gradient phase, one tries to improve the value of the function while avoiding excessive constraint violation. In the restoration phase, one tries to reduce the constraint error, while avoiding excessive change in the value of the function.

Concerning the conjugate gradient phase, two classes of algorithms are considered: for algorithms of Class I, the multiplier λ is determined so that the error in the optimum condition is minimized for givenx; for algorithms of Class II, the multiplier λ is determined so that the constraint is satisfied to first order. Concerning the restoration phase, two topics are investigated: (a) restoration type, that is, complete restoration vs incomplete restoration and (b) restoration frequency, that is, frequent restoration vs infrequent restoration.

Depending on the combination of type and frequency of restoration, four algorithms are generated within Class I and within Class II, respectively: Algorithm (α) is characterized by complete and frequent restoration; Algorithm (β) is characterized by incomplete and frequent restoration; Algorithm (γ) is characterized by complete and infrequent restoration; and Algorithm (δ) is characterized by incomplete and infrequent restoration.

If the functionf(x) is quadratic and the constraint ϕ(x) is linear, all of the previous algorithms are identical, that is, they produce the same sequence of points and converge to the solution in the same number of iterations. This number of iterations is at mostN* =n −q if the starting pointx s is such that ϕ(x s)=0, and at mostN*=1+n −q if the starting pointx s is such that ϕ(x s) ≠ 0.

In order to illustrate the theory, five numerical examples are developed. The first example refers to a quadratic function and a linear constraint. The remaining examples refer to a nonquadratic function and a nonlinear constraint. For the linear-quadratic example, all the algorithms behave identically, as predicted by the theory. For the nonlinear-nonquadratic examples, Algorithm (II-δ), which is characterized by incomplete and infrequent restoration, exhibits superior convergence characteristics.

It is of interest to compare Algorithm (II-δ) with Algorithm (I-α), which is the sequential conjugate gradient-restoration algorithm of Ref. 1 and is characterized by complete and frequent restoration. For the nonlinear-nonquadratic examples, Algorithm (II-δ) converges to the solution in a number of iterations which is about one-half to two-thirds that of Algorithm (I-α).

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

  1. Miele, A., Huang, H. Y., andHeideman, J. C.,Sequential Gradient-Restoration Algorithm for the Minimization of Constrained Functions—Ordinary and Conjugate Gradient Versions, Journal of Optimization Theory and Applications, Vol. 4, No. 4, 1969.

  2. Miele, A., Heideman, J. C., andDamoulakis, J. N.,The Restoration of Constraints in Holonomic and Nonholonomic Problems, Journal of Optimization Theory and Applications, Vol. 3, No. 5, 1969.

  3. Miele, A., Heideman, J. C., andLevy, A. V.,Mathematical Programming for Constrained Minimal Problems, Part 5, Combined Conjugate Graddient-Restoration Algorithm, Rice University, Aero-Astronautics Report No. 70, 1970.

  4. Miele, A., andLevy, A. V.,Modified Quasilinearization and Optimal Initial Choice of the Multipliers, Part 1, Mathematical Programming Problems, Journal of Optimization Theory and Applications, Vol. 6, No. 5, 1970.

  5. Miele, A., Levy, A. V., andCragg, E. E.,Mathematical Programming for Constrained Minimal Problems, Part 6, Modifications and Extensions of the Conjugate Gradient-Restoration Algorithm, Rice University, Aero-Astronautics Report No. 72, 1970.

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical and Aerospace Engineering and Materials Science, Rice University, Houston, Texas

    A. Miele (Professor of Astronautics and Director of the Aero-Astronautics Group), A. V. Levy (Graduate Student in Aero-Astronautics) & E. E. Cragg

Authors
  1. A. Miele
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. V. Levy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E. E. Cragg
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported by the Office of Scientific Research, Office of Aerospace Research, United States Air Force, Grant No. AF-AFOSR-828-67.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Miele, A., Levy, A.V. & Cragg, E.E. Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problems. J Optim Theory Appl 7, 450–472 (1971). https://doi.org/10.1007/BF00931981

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation