Imperfect conjugate gradient algorithms for extended quadratic functions
From MaRDI portal
Cites work
- A finite algorithm to maximize certain pseudoconcave functions on polytopes
- A generalized conjugate gradient algorithm for minimization
- A Note on the Determination of the Scaling Parameters in a Class of Quasi-Newton Methods for Unconstrained Minimization
- A numerically stable optimization method based on A homogeneous function
- A variable metric-method for function minimization derived from invariancy to nonlinear scaling
- An exponential function as a model for a conjugate gradient optimization method
- Extended conjugate-gradient methods with restarts
- scientific article; zbMATH DE number 3793305 (Why is no real title available?)
- Methods of conjugate gradients for solving linear systems
- Minimization Algorithms Making Use of Non-quadratic Properties of the Objective Function
- Minimization of extended quadratic functions
- 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
Cited in
(4)- scientific article; zbMATH DE number 3963115 (Why is no real title available?)
- scientific article; zbMATH DE number 4009671 (Why is no real title available?)
- A NOTE ON THE CONVERGENCE OF THE DFP ALGORITHM ON QUADRATIC UNIFORMLY CONVEX FUNCTIONS
- Full convergence of the steepest descent method with inexact line searches
This page was built for publication: Imperfect conjugate gradient algorithms for extended quadratic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q584912)
