A self-adjusting spectral conjugate gradient method for large-scale unconstrained optimization
From MaRDI portal
Summary: This paper presents a hybrid spectral conjugate gradient method for large-scale unconstrained optimization, which possesses a self-adjusting property. Under the standard Wolfe conditions, its global convergence result is established. Preliminary numerical results are reported on a set of large-scale problems in CUTEr to show the convergence and efficiency of the proposed method.
Recommendations
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- New conjugate gradient method for unconstrained optimization
- Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization
- A new CG algorithm based on a scaled memoryless BFGS update with adaptive search strategy, and its application to large-scale unconstrained optimization problems
- A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
Cites work
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- An efficient hybrid conjugate gradient method for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- New properties of a nonlinear conjugate gradient method
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
Cited in
(3)- Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- A Modification of Dai-Yuan's Conjugate Gradient Algorithm for Solving Unconstrained Optimization
This page was built for publication: A self-adjusting spectral conjugate gradient method for large-scale unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q370232)
