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

DOI10.1007/BF01681341zbMATH Open0352.90053MaRDI QIDQ4123091FDOQ4123091

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

• Title not available (Why is that?)
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• Conjugate Directions without Linear Searches
• A feasible conjugate direction method to solve linearly constrained minimization problems
• Quadratically convergent algorithms and one-dimensional search schemes
• An accelerated conjugate direction method to solve linearly constrained minimization problems
• Methods of conjugate directions versus quasi-Newton methods
• Title not available (Why is that?)
• A Method of Conjugate Directions for Linearly Constrained Nonlinear Programming Problems
• Title not available (Why is that?)

Cited In (6)

• Generating conjugate directions without line searches using factorized variable metric updating formulas
• A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems
• Title not available (Why is that?)
• A generalized conjugate gradient algorithm for minimization
• Accelerated conjugate direction methods for unconstrained optimization
• A quasi-Newton method can be obtained from a method of conjugate directions

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)