Practical convergence conditions for unconstrained optimization

DOI10.1007/BF01584673zbMath0268.90059MaRDI 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

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

Related Items

A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms, 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, Convergence conditions for restarted conjugate gradient methods with inaccurate line searches, Practical convergence conditions for the Davidon-Fletcher-Powell 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