Globally Convergent Three-Term Conjugate Gradient Methods that Use Secant Conditions and Generate Descent Search Directions for Unconstrained Optimization

Journal of Optimization Theory and Applications

Volumn 153, Issue 3, 2012, Pages 733-757

  Sugiki, Kaori ^a   Narushima, Yasushi ^b   Yabe, Hiroshi ^c  

^a MIZUHO INFORMATION AND RESEARCH INSTITUTE   (Japan)

^b FUKUSHIMA NATIONAL COLLEGE OF TECHNOLOGY   (Japan)

^c TOKYO UNIVERSITY OF SCIENCE   (Japan)

Author keywords

Descent search direction; Global convergence; Secant condition; Three term conjugate gradient method; Unconstrained optimization

Indexed keywords

LEAST SQUARES APPROXIMATIONS; NUMERICAL METHODS; OPTIMIZATION;

CONDITION; CONJUGATE-GRADIENT METHOD; DESCENT SEARCH DIRECTION; GLOBAL CONVER-GENCE; GLOBALLY CONVERGENT; SEARCH DIRECTION; SECANT CONDITION; THREE-TERM; THREE-TERM CONJUGATE GRADIENT METHOD; UNCONSTRAINED OPTIMIZATION;

CONJUGATE GRADIENT METHOD;

EID: 84860638013     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-011-9960-x     Document Type: Article

References (36)

1. Function minimization by conjugate gradients
2. Global convergence properties of conjugate gradient methods for optimization
3. Methods of conjugate gradients for solving linear systems
4. A nonlinear conjugate gradient method with a strong global convergence property
5. A survey of nonlinear conjugate gradient methods
6. A modified conjugate gradient algorithm
7. New conjugacy conditions and related nonlinear conjugate gradient methods
8. Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
9. A nonlinear conjugate gradient method based on the MBFGS secant condition
10. Multi-step nonlinear conjugate gradient methods for unconstrained minimization
11. Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems
12. A new nonlinear conjugate gradient method for unconstrained optimization
13. A new conjugate gradient method with guaranteed descent and an efficient line search
14. Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
15. A descent modified Polak-Ribiére-Polyak conjugate gradient method and its global convergence
16. Some descent three-term conjugate gradient methods and their global convergence
17. A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
18. New quasi-Newton equation and related methods for unconstrained optimization
19. Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
20. A modified BFGS method and its global convergence in nonconvex minimization
21. Alternative parameter choices for multi-step quasi-Newton methods
22. Multi-step quasi-Newton methods for optimization
23. A two-term PRP-based descent method
24. Sufficient descent nonlinear conjugate gradient methods with conjugacy condition
25. Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
26. Local and superlinear convergence for partially known quasi-Newton methods
27. On the use of product structure in secant methods for nonlinear least squares problems
28. CUTE: constrained and unconstrained testing environment
29. Algorithm 851: CG_DESCENT, a conjugate gradient method with guaranteed descent
30. Benchmarking optimization software with performance profiles
31. Testing unconstrained optimization software
32. Line search algorithms with guaranteed sufficient decrease