Some computational advances in unconstrained optimization

DOI10.1016/0096-3003(80)90033-8zbMath0464.65043OpenAlexW1966898837MaRDI QIDQ1154219

J. S. Kowalik, W. Robert Boland

Publication date: 1980

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(80)90033-8

zbMATH Keywords

conjugate gradient methodunconstrained minimizationquasi-Newton methodsteepest-descentconjugate direction method

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Extended conjugate-gradient methods with restarts
• An exponential function as a model for a conjugate gradient optimization method
• A variable metric-method for function minimization derived from invariancy to nonlinear scaling
• A conjugate-gradient optimization method invariant to nonlinear scaling
• Fast Givens transformtions applied to the homogeneous optimization method
• An algorithm that minimizes homogeneous functions of \(n\) variables in \(n + 2\) iterations and rapidly minimizes general functions
• Technical Note—A Modified Conjugate Gradient Algorithm
• On Variable-Metric Methods for Sparse Hessians
• A New Direction Set Method for Unconstrained Minimization without Evaluating Derivatives
• A numerically stable optimization method based on A homogeneous function
• A combined conjugate-gradient quasi-Newton minimization algorithm
• Restart procedures for the conjugate gradient method
• Conjugate Gradient Methods with Inexact Searches
• Function minimization by conjugate gradients
• Conjugate Directions without Linear Searches