Accelerated conjugate direction methods for unconstrained optimization
From MaRDI portal
Publication:1236069
DOI10.1007/BF00933252zbMath0352.90058MaRDI QIDQ1236069
Publication date: 1978
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Accelerating procedures for methods of conjugate directions
- A conjugate direction algorithm without line searches
- An effective algorithm for minimization
- Multiplier and gradient methods
- Alternative proofs of the convergence properties of the conjugate- gradient method
- Method of dual matrices for function minimization
- A method to accelerate the rate of convergence of a class of optimization algorithms
- A Rapidly Convergent Descent Method for Minimization
- A Family of Variable-Metric Methods Derived by Variational Means
- The Convergence of a Class of Double-rank Minimization Algorithms
- A new approach to variable metric algorithms
- Conditioning of Quasi-Newton Methods for Function Minimization
- Quasi-newton algorithms generate identical points
- Methods of conjugate directions versus quasi-Newton methods
- Conjugate Directions without Linear Searches
- Methods of conjugate gradients for solving linear systems