New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
From MaRDI portal
(Redirected from Publication:989146)
Recommendations
- A Modification of Dai-Yuan's Conjugate Gradient Algorithm for Solving Unconstrained Optimization
- A new accelerated conjugate gradient method for large-scale unconstrained optimization
- A new Dai-Liao type of conjugate gradient algorithm for unconstrained optimization problems
- A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization
- An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- A new efficient conjugate gradient method for unconstrained optimization
- Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems
- A new conjugate gradient method for unconstrained optimization
- A new conjugate gradient method for unconstrained optimization
Cites work
- scientific article; zbMATH DE number 992790 (Why is no real title available?)
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 2063453 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (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 spectral conjugate gradient method for unconstrained optimization
- A survey of nonlinear conjugate gradient methods
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
- An efficient hybrid conjugate gradient method for unconstrained optimization
- An unconstrained optimization test functions collection
- Benchmarking optimization software with performance profiles.
- CUTE
- Comparison of advanced large-scale minimization algorithms for the solution of inverse ill-posed problems
- Conjugate Gradient Methods with Inexact Searches
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- Line search algorithms with guaranteed sufficient decrease
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- New properties of a nonlinear conjugate gradient method
- On the Convergence of a New Conjugate Gradient Algorithm
- On the limited memory BFGS method for large scale optimization
- Optimal conditioning of self-scaling variable Metric algorithms
- Restart procedures for the conjugate gradient method
- The conjugate gradient method in extremal problems
Cited in
(21)- A modified spectral conjugate gradient method with global convergence
- Two classes of spectral conjugate gradient methods for unconstrained optimizations
- A modified spectral conjugate gradient method for solving unconstrained minimization problems
- A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization
- Two spectral conjugate gradient methods for unconstrained optimization problems
- An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems
- Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization
- Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update
- Spectral conjugate gradient methods for vector optimization problems
- Riemannian conjugate gradient method for low-rank tensor completion
- A new structured spectral conjugate gradient method for nonlinear least squares problems
- A spectral three-term Hestenes-Stiefel conjugate gradient method
- An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization
- A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization
- The new spectral conjugate gradient method for large-scale unconstrained optimisation
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- A new nonmonotone line search technique for unconstrained optimization
- An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems
- A new spectral conjugate gradient method for large-scale unconstrained optimization
- A spectral conjugate gradient projection algorithm to solve the large-scale system of monotone nonlinear equations with application to compressed sensing
- Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization
This page was built for publication: New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989146)
