CGS algorithms for unconstrained minimization of functions

DOI10.1007/BF00935624MaRDI QIDQ1843296zbMATH OpenOpenAlexWikidataFDO

Authors R. F. Dennemeyer, E. H. Mookini

Publication date 1975

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00935624

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites work

• scientific article; zbMATH DE number 3476911 (Why is no real title available?)
• scientific article; zbMATH DE number 3356498 (Why is no real title available?)
• A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
• A Rapidly Convergent Descent Method for Minimization
• Methods of conjugate gradients for solving linear systems

Cited in

(6)

• CGS algorithms for constrained extremization of functions
• Conjugate direction methods in non-Hilbert spaces
• Convergence of the conjugate Gram-Schmidt method
• Numerical experience with conjugate direction methods in constrained minimization
• A discrete Newton algorithm for minimizing a function of many variables
• Extensions of CGS algorithms: Generalized least-square solutions

This page was built for publication: CGS algorithms for unconstrained minimization of functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1843296)