Unconstrained Optimization Methods: Conjugate Gradient Methods and Trust-Region Methods
Open Access
- 25 September 2019
- book chapter
- Published by IntechOpen
Abstract
Here, we consider two important classes of unconstrained optimization methods: conjugate gradient methods and trust region methods. These two classes of methods are very interesting; it seems that they are never out of date. First, we consider conjugate gradient methods. We also illustrate the practical behavior of some conjugate gradient methods. Then, we study trust region methods. Considering these two classes of methods, we analyze some recent results.Keywords
This publication has 49 references indexed in Scilit:
- A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line SearchSIAM Journal on Optimization, 2013
- A new class of nonlinear conjugate gradient coefficients with global convergence propertiesApplied Mathematics and Computation, 2012
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimizationOptimization Methods and Software, 2008
- The proof of the sufficient descent condition of the Wei–Yao–Liu conjugate gradient method under the strong Wolfe–Powell line searchApplied Mathematics and Computation, 2007
- Some descent three-term conjugate gradient methods and their global convergenceOptimization Methods and Software, 2007
- The convergence properties of some new conjugate gradient methodsApplied Mathematics and Computation, 2006
- A nonlinear conjugate gradient method based on the MBFGS secant conditionOptimization Methods and Software, 2006
- Alternate minimization gradient methodIMA Journal of Numerical Analysis, 2003
- The conjugate gradient method in extremal problemsUSSR Computational Mathematics and Mathematical Physics, 1969
- Function minimization by conjugate gradientsThe Computer Journal, 1964