In favor of conjugate directions: a generalized acceptable-point algorithm for function minimization

DOI10.1016/0016-0032(78)90025-XzbMath0402.90083OpenAlexW1984158833MaRDI QIDQ1255894

M. A. Townsend, Glenn Eric Johnson

Publication date: 1978

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(78)90025-x

zbMATH Keywords

Nonlinear ProgrammingComparison Of AlgorithmsComputational StudyConjugate Direction MethodsUnivariate Subsearch

Mathematics Subject Classification ID

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

Related Items

On conjugate gradient-like methods for eigen-like problems, A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms, A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization

Cites Work

• Nonoptimal termination properties of quadratic interpolation univariate searches
• An effective algorithm for minimization
• Minimization of functions having Lipschitz continuous first partial derivatives
• Comparison of some conjugate direction procedures for function minimization
• Some Algorithms for Minimizing a Function of Several Variables
• A Rapidly Convergent Descent Method for Minimization
• Function minimization by conjugate gradients
• A new approach to variable metric algorithms
• On Steepest Descent
• Conditioning of Quasi-Newton Methods for Function Minimization
• Efficient Implementations of the Polak–Ribière Conjugate Gradient Algorithm
• Methods of conjugate gradients for solving linear systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item