On the relation between quadratic termination and convergence properties of minimization algorithms - Part II. Application

Numerische Mathematik

Volumn 28, Issue 4, 1977, Pages 367-391

  Baptist, P ^a   Stoer, J ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

Subject Classifications: AMS(MOS): 65K05, CR: 5.15

Indexed keywords

EID: 1842721334     PISSN: 0029599X     EISSN: 09453245     Source Type: Journal    
DOI: 10.1007/BF01404342     Document Type: Article

References (22)

1. Quasi-Newton methods and their application to function minimization
2. The convergence of a class of double-rank minimization algorithms. Part 1 and Part 2
3. Die Konvergenzordnung des Fletcher-Powell Algorithmus
4. Rate of convergence of several conjugate gradient algorithms
5. The conjugate gradient method for linear and nonlinear operator equations
6. A rapidly convergent descent method for minimization
7. Function minimization by conjugate gradients
8. Practical convergence conditions for unconstrained optimization
9. Practical convergence conditions for the Davidon-Fletcher-Powell method
10. Convergence conditions for restarted conjugate gradient methods with inaccurate line searches
11. Methods of conjugate directions versus quasi-Newton methods
12. Alternative proofs of the convergence properties of the conjugategradient method
13. Self-scaling variable metric algorithms. Part I. Criteria and sufficient conditions for scaling a class of algorithms
14. Self-scaling variable metric algorithms Part II Implementation and experiments
15. Variable metric methods of minimization
16. Über die Konvergenzordnung gewisser Rang-2-Verfahren zur Minimierung von Funktionen
17. On the convergence rate of imperfect minimization algorithms in Broyden's β-class
18. On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory