Numerical experiments on quadratically convergent algorithms for function minimization

DOI10.1007/BF00926604MaRDI QIDQ2536596zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 1970

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

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

zbMATH Keywords

numerical analysis

Cites work

• A Rapidly Convergent Descent Method for Minimization
• scientific article; zbMATH DE number 3329468 (Why is no real title available?)
• Study on a supermemory gradient method for the minimization of functions
• Unified approach to quadratically convergent algorithms for function minimization

Cited in

(16)

• Conditions for variable-metric algorithms to be conjugate-gradient algorithms
• Variable metric methods in Hilbert space with applications to control problems
• Numerical experiments on DFP-method, a powerful function minimization technique
• Approximation methods for the unconstrained optimization
• Best practices for comparing optimization algorithms
• Computational performance of Huang's symmetric update for the conjugate gradient method
• On variable-metric algorithms
• Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
• Unconstrained approach to the extremization of constrained functions
• Quadratically convergent algorithms and one-dimensional search schemes
• On the uniqueness of search directions in variable metric algorithms
• Method of dual matrices for function minimization
• Numerical experiments on dual matrix algorithms for function minimization
• On the convergence of variable-metric methods
• Computational experience with Davidon's least-square algorithm
• Quasi-Newton methods for saddlepoints

This page was built for publication: Numerical experiments on quadratically convergent algorithms for function minimization

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