Two classes of spectral conjugate gradient methods for unconstrained optimizations
From MaRDI portal
Publication:2103158
Recommendations
- A new spectral conjugate gradient method for large-scale unconstrained optimization
- A new spectral conjugate gradient method
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- The new spectral conjugate gradient method for large-scale unconstrained optimisation
- A new class of spectral conjugate gradient methods based on a modified secant equation for unconstrained optimization
Cites work
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- scientific article; zbMATH DE number 3363347 (Why is no real title available?)
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization
- A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
- A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
- A new spectral conjugate gradient method for large-scale unconstrained optimization
- A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- A spectral conjugate gradient method for unconstrained optimization
- A spectral three-term conjugate gradient method with sufficient descent property
- An efficient hybrid conjugate gradient method for unconstrained optimization
- An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- An unconstrained optimization test functions collection
- Benchmarking optimization software with performance profiles.
- CUTEr and SifDec
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Global convergence result for conjugate gradient methods
- Hybrid conjugate gradient algorithm for unconstrained optimization
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
- Least-squares-based three-term conjugate gradient methods
- Methods of conjugate gradients for solving linear systems
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
- New hybrid conjugate gradient method for unconstrained optimization
- Some descent three-term conjugate gradient methods and their global convergence
- Testing Unconstrained Optimization Software
- Two improved nonlinear conjugate gradient methods with the strong Wolfe line search
- Two modified DY conjugate gradient methods for unconstrained optimization problems
- Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization
- Two modified three-term conjugate gradient methods with sufficient descent property
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
Cited in
(17)- A spectral Hestenes-Stiefel CG algorithm for large-scale unconstrained optimization in image restoration problems
- A new class of spectral conjugate gradient methods based on a modified secant equation for unconstrained optimization
- An improved Dai-Liao-style hybrid conjugate gradient-based method for solving unconstrained nonconvex optimization and extension to constrained nonlinear monotone equations
- A family of spectral conjugate gradient methods with strong convergence and its applications in image restoration and machine learning
- An accelerated spectral CG based algorithm for optimization techniques on Riemannian manifolds and its comparative evaluation
- Two hybrid conjugate gradient based algorithms on Riemannian manifolds with adaptive restart strategy for nonconvex optimization problems
- A derivative-free projection method with double inertial effects for solving nonlinear equations
- A family of descent spectral three-term conjugate gradient methods based on the quasi-Newton aspects with applications to nonnegative matrix factorization and image restoration
- Spectral conjugate gradient methods for vector optimization problems
- A conjugate gradient algorithmic framework for unconstrained optimization with applications: convergence and rate analyses
- An improved spectral CG method based on Dai–Liao conjugacy condition and quasi-Newton direction
- Modified spectral conjugate gradient methods based on the quasi-Newton aspects
- scientific article; zbMATH DE number 7663620 (Why is no real title available?)
- A new spectral conjugate gradient method for large-scale unconstrained optimization
- scientific article; zbMATH DE number 1841789 (Why is no real title available?)
- An adaptive restarting RMIL conjugate gradient method and its hybrid version: global convergence and iterative complexity analyses
- Solving unconstrained optimization using a spectral CG method with restart feature and its application
This page was built for publication: Two classes of spectral conjugate gradient methods for unconstrained optimizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103158)
