Skip to main content
Log in

A conjugate direction algorithm without line searches

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

Abstract

We develop an algorithm which generates conjugate search directions and maintains finite termination, when applied to quadratic functions, without requiring that line searches be exact. The technique requiresO(n) storage, wheren is the dimension of the problem. Results when the algorithm is applied to a number of standard test problems are included.

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. Hestenes, M. R., andStiefel, E.,Methods of Conjugate Gradients for Solving Linear Systems, Research Journal of the National Bureau of Standards, Vol. 49, pp. 409–436, 1952.

    Google Scholar 

  2. Fletcher, R., andReeves, C. M.,Function Minimization by Conjugate Gradients, Computer Journal, Vol. 7, pp. 149–154, 1964.

    Google Scholar 

  3. Fletcher, R.,A FORTRAN Subroutine for Minimization by the Method of Conjugate Gradients, Atomic Energy Research Establishment, Harwell, Oxfordshire, England, Report No. R-7073, 1972.

    Google Scholar 

  4. Polak, E.,Computational Methods in Optimization, Academic Press, New York, New York, 1971.

    Google Scholar 

  5. Hestenes, M. R.,Multiplier and Gradient Methods, Computing Methods in Optimization Problems, Vol. 2, Edited by L. A. Zadeh, L. W. Neustadt, and A. V. Balakrishnan, Academic Press, New York, New York, 1969.

    Google Scholar 

  6. Powell, M. J. D.,Recent Advances in Unconstrained Optimization, Mathematical Programming, Vol. 1, pp. 26–57, 1971.

    Google Scholar 

  7. Davidon, W. C.,Optimally Conditioned Optimization Algorithms Without Linear Searches, Mathematical Programming, Vol. 9, pp. 1–30, 1975.

    Google Scholar 

  8. Powell, M. J. D.,An Iterative Method for Finding Stationary Values of a Function of Several Variables, Computer Journal, Vol. 7, pp. 303–307, 1962.

    Google Scholar 

  9. Zoutendijk, G.,Methods of Feasible Directions, Elsevier Publishing Company, Amsterdam, Holland, 1960.

    Google Scholar 

  10. Davidon, W. C.,Variable Metric Methods for Minimization, Atomic Energy Commission, Argonne National Laboratory, Argonne, Illinois, Research and Development Report No. ANL-5990, 1959.

    Google Scholar 

  11. Fletcher, R., andPowell, M. J. D.,A Rapidly Convergent Method for Minimization, Computer Journal, Vol. 6, pp. 163–168, 1963.

    Google Scholar 

  12. Broyden, C. G.,The Convergence of a Class of Double Rank Minimization Algorithms, Journal of the Institute of Mathematics and its Applications, Vol. 6, pp. 79–90, 1970.

    Google Scholar 

  13. Huang, H. Y.,A Unified Approach to Quadratically Convergent Algorithms for Function Minimization, Journal of Optimization Theory and Applications, Vol. 5, pp. 405–423, 1970.

    Google Scholar 

  14. Nazareth, L.,Unified Approach to Unconstrained Minimization via Basic Matrix Factorizations, Journal of Linear Algebra and its Applications, Vol. 17, pp. 197–232, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by H. Y. Huang

Work was performed under the auspices of the US Energy Research and Development Administration.

The author would like especially to thank Marie-Anne Neimat, who put much effort into the programming of the algorithm and the generation of test results.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nazareth, L. A conjugate direction algorithm without line searches. J Optim Theory Appl 23, 373–387 (1977). https://doi.org/10.1007/BF00933447

Download citation

  • Issue Date:

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

Key Words

Navigation