The use of hypothetical points in numerical optimization

DOI10.1007/BFB0121073MaRDI QIDQ3707769zbMATH OpenOpenAlexFDO

Authors E. M. L. Beale, O. S. Brooker

Publication date 1985

Published in Mathematical Programming Essays in Honor of George B. Dantzig Part II (Search for Journal in Brave)

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

zbMATH Keywords

conjugate gradient methodshypothetical pointsequence of approximate line searches

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• On the use of function-values in unconstrained optimisation
• scientific article; zbMATH DE number 653035
• scientific article; zbMATH DE number 3914101
• An adaptive search algorithm for numerical optimization
• scientific article; zbMATH DE number 88930

This page was built for publication: The use of hypothetical points in numerical optimization

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