Skip to main content
Log in

Computational schemes of the Davidon-Fletcher-Powell method in infinite-dimensional space

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

Abstract

The disadvantage of the extension of the Davidon-Fletcher-Powell method to infinite-dimensional space is that the information to be stored in the computer increases with the number of iterations. In this paper, a computational scheme is proposed to remove this disadvantage and make the extension method more practicable. The linear operator which determines the direction of one-dimensional search in the method is formulated by integral kernels to derive the scheme. Furthermore, polynomial interpolation methods are proposed to save computer storage. The computational scheme which is presented here and the polynomial interpolation method are successfully applied to an optimal control problem.

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. Davidon, W. C.,Variable Metric Method for Minimization, AEC Research and Development Report No. ANL-5990, 1959.

  2. Fletcher, R., andPowell, M. J. D.,A Rapid Convergent Descent Method for Minimization, Computer Journal, Vol. 6, No. 2, 1964.

  3. Hayes, R. M.,Iterative Methods of Solving Linear Problems on Hilbert Space, Contributions to the Solution of Systems of Linear Equations and the Determination of Eigenvalues, Vol. 39, Edited by O. Taussky, National Bureau of Standards, Applied Mathematics Series, Washington, D.C., 1954.

    Google Scholar 

  4. Horwitz, L. B., andSarachik, P. E.,Davidon's Method in Hilbert Space, SIAM Journal on Applied Mathematics, Vol. 10, No. 4, 1968.

  5. Tokumaru, H., Adachi, N., andGoto, K.,Davidon's Method for Minimization Problems in Hilbert Space with an Application to Control Problems, SIAM Journal on Control, Vol. 8, No. 2, 1970.

  6. Horwitz, L. B.,An Investigation of Iteration Techniques in Function Space and Applications to Optimal Control Problems, New York University, New York, New York, Ph.D. Thesis, 1968.

    Google Scholar 

  7. Takamatsu, T., Sayama, H., andOi, K.,Optimal Design of Extraction Processes by Second-Order Convergence Gradient Methods (in Japanese), Journal of the Japan Association of Automatic Control Engineers, Vol. 13, No. 5, 1969.

  8. Lasdon, L. S., Mitter, S. K., andWaren, A. D.,The Conjugate Gradient Method for Optimal Control Problems, IEEE Transactions on Automatic Control, Vol. AC-12, No. 2, 1969.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by M. R. Hestenes

The authors would like to thank Dr. N. Adachi for valuable discussion. Computations were carried out at the computing centers of Osaka University, Kyoto University, and Tokyo University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Oi, K., Sayama, H. & Takamatsu, T. Computational schemes of the Davidon-Fletcher-Powell method in infinite-dimensional space. J Optim Theory Appl 12, 447–458 (1973). https://doi.org/10.1007/BF00935240

Download citation

  • Published:

  • Issue Date:

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

Keywords

Navigation