New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
From MaRDI portal
Publication:989146
DOI10.1016/J.CAM.2010.05.002zbMATH Open1407.65060OpenAlexW2156273800MaRDI QIDQ989146FDOQ989146
Authors: Neculai Andrei 
Publication date: 27 August 2010
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2010.05.002
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
conjugacy conditionnumerical comparisonsunconstrained optimizationconjugate gradient methodsufficient descent conditionNewton direction
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)
Cites Work
- Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
- CUTE
- Benchmarking optimization software with performance profiles.
- On the limited memory BFGS method for large scale optimization
- Line search algorithms with guaranteed sufficient decrease
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- Title not available (Why is that?)
- An unconstrained optimization test functions collection
- Title not available (Why is that?)
- Restart procedures for the conjugate gradient method
- On the Convergence of a New Conjugate Gradient Algorithm
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of nonlinear conjugate gradient methods
- A spectral conjugate gradient method for unconstrained optimization
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- An efficient hybrid conjugate gradient method for unconstrained optimization
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Optimal conditioning of self-scaling variable Metric algorithms
- Conjugate Gradient Methods with Inexact Searches
- New properties of a nonlinear conjugate gradient method
- Comparison of advanced large-scale minimization algorithms for the solution of inverse ill-posed problems
Cited In (21)
- Two classes of spectral conjugate gradient methods for unconstrained optimizations
- A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization
- A modified spectral conjugate gradient method for solving unconstrained minimization problems
- 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
- Spectral conjugate gradient methods for vector optimization problems
- Riemannian conjugate gradient method for low-rank tensor completion
- Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update
- 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
- A new nonmonotone line search technique for unconstrained 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 spectral conjugate gradient method for large-scale unconstrained optimization
- An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems
- 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
- A modified spectral conjugate gradient method with global convergence
Uses Software
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)
