A method to accelerate the rate of convergence of a class of optimization algorithms
From MaRDI portal
Publication:4123091
DOI10.1007/BF01681341zbMath0352.90053MaRDI QIDQ4123091
Publication date: 1975
Published in: Mathematical Programming (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Rate of convergence, degree of approximation (41A25)
Related Items
A generalized conjugate gradient algorithm for minimization, Unnamed Item, Accelerated conjugate direction methods for unconstrained optimization, A quasi-Newton method can be obtained from a method of conjugate directions, Generating conjugate directions without line searches using factorized variable metric updating formulas, A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An accelerated conjugate direction method to solve linearly constrained minimization problems
- A feasible conjugate direction method to solve linearly constrained minimization problems
- Quadratically convergent algorithms and one-dimensional search schemes
- A Method of Conjugate Directions for Linearly Constrained Nonlinear Programming Problems
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- Methods of conjugate directions versus quasi-Newton methods
- Conjugate Directions without Linear Searches
