A method to accelerate the rate of convergence of a class of optimization algorithms

DOI10.1007/BF01681341MaRDI QIDQ4123091zbMATH OpenFDO

Authors Michael J. Best

Publication date 1975

Published in Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Rate of convergence, degree of approximation (41A25)

Cites work

• scientific article; zbMATH DE number 3159112 (Why is no real title available?)
• scientific article; zbMATH DE number 3402051 (Why is no real title available?)
• scientific article; zbMATH DE number 3402052 (Why is no real title available?)
• A Method of Conjugate Directions for Linearly Constrained Nonlinear Programming Problems
• A feasible conjugate direction method to solve linearly constrained minimization problems
• An accelerated conjugate direction method to solve linearly constrained minimization problems
• Conjugate Directions without Linear Searches
• Methods of conjugate directions versus quasi-Newton methods
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• Quadratically convergent algorithms and one-dimensional search schemes

Cited in

(6)

• Accelerated conjugate direction methods for unconstrained optimization
• Generating conjugate directions without line searches using factorized variable metric updating formulas
• A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems
• scientific article; zbMATH DE number 3793305 (Why is no real title available?)
• A quasi-Newton method can be obtained from a method of conjugate directions
• A generalized conjugate gradient algorithm for minimization

This page was built for publication: A method to accelerate the rate of convergence of a class of optimization algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4123091)