Practical convergence conditions for unconstrained optimization

DOI10.1007/BF01584673zbMath0268.90059OpenAlexW1991848054MaRDI QIDQ5685870

M. L. Lenard

Publication date: 1973

Published in: Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (7)

A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms ⋮ Convergence conditions for restarted conjugate gradient methods with inaccurate line searches ⋮ Practical convergence conditions for the Davidon-Fletcher-Powell method ⋮ On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory ⋮ On the relation between quadratic termination and convergence properties of minimization algorithms. Part II. Applications ⋮ Effiziente Schrittweitenfunktionen bei unrestringierten Optimierungsaufgaben ⋮ A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An effective algorithm for minimization
• Comparison of some conjugate direction procedures for function minimization
• A Rapidly Convergent Descent Method for Minimization
• Function minimization by conjugate gradients
• A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
• Convergence Conditions for Ascent Methods
• Efficient Implementations of the Polak–Ribière Conjugate Gradient Algorithm
• Linear Convergence of the Conjugate Gradient Method

This page was built for publication: Practical convergence conditions for unconstrained optimization