A generalized conjugate gradient algorithm for minimization
From MaRDI portal
Publication:1135089
DOI10.1007/BF01396318zbMath0424.65033MaRDI QIDQ1135089
Publication date: 1980
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/186287
Related Items
Minimization of extended quadratic functions with inexact line searches ⋮ Minimization of extended quadratic functions ⋮ Imperfect conjugate gradient algorithms for extended quadratic functions ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- 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 direction algorithm without line searches
- 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
- Conjugate Gradient Algorithms: Quadratic Termination without Linear Searches
- A finite algorithm to maximize certain pseudoconcave functions on polytopes
- A numerically stable optimization method based on A homogeneous function
- A method to accelerate the rate of convergence of a class of optimization algorithms
- A Note on the Determination of the Scaling Parameters in a Class of Quasi-Newton Methods for Unconstrained Minimization
- Minimization Algorithms Making Use of Non-quadratic Properties of the Objective Function
- Methods of conjugate gradients for solving linear systems
