Imperfect conjugate gradient algorithms for extended quadratic functions

DOI10.1007/BF01400920zbMath0524.65045OpenAlexW2067262563MaRDI QIDQ584912

Fridrich Sloboda, Jozsef Abaffy

Publication date: 1983

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132863

zbMATH Keywords

numerical testsimperfect conjugate gradient algorithmsinvariant to a nonlinear scalingstrictly convex quadratic function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20)

Related Items

A NOTE ON THE CONVERGENCE OF THE DFP ALGORITHM ON QUADRATIC UNIFORMLY CONVEX FUNCTIONS, Unnamed Item, Unnamed Item, Full convergence of the steepest descent method with inexact line searches

Cites Work

• Unnamed Item
• Extended conjugate-gradient methods with restarts
• An exponential function as a model for a conjugate gradient optimization method
• A generalized conjugate gradient algorithm for minimization
• Minimization of extended quadratic functions
• A variable metric-method for function minimization derived from invariancy to nonlinear scaling
• 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
• A finite algorithm to maximize certain pseudoconcave functions on polytopes
• A numerically stable optimization method based on A homogeneous function
• 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