A method to accelerate the rate of convergence of a class of optimization algorithms
- 1 December 1975
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 9 (1) , 139-160
- https://doi.org/10.1007/bf01681341
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An accelerated conjugate direction method to solve linearly constrained minimization problemsJournal of Computer and System Sciences, 1975
- A feasible conjugate-direction method to solve linearly constrained minimization problemsJournal of Optimization Theory and Applications, 1975
- A Method of Conjugate Directions for Linearly Constrained Nonlinear Programming ProblemsSIAM Journal on Numerical Analysis, 1975
- Conjugate Gradient Algorithms: Quadratic Termination without Linear SearchesIMA Journal of Applied Mathematics, 1975
- Numerical experiments on dual matrix algorithms for function minimizationJournal of Optimization Theory and Applications, 1974
- Method of dual matrices for function minimizationJournal of Optimization Theory and Applications, 1974
- Conjugate Directions without Linear SearchesIMA Journal of Applied Mathematics, 1973
- Quadratically convergent algorithms and one-dimensional search schemesJournal of Optimization Theory and Applications, 1973
- Methods of conjugate directions versus quasi-Newton methodsMathematical Programming, 1972