On three-term conjugate gradient algorithms for unconstrained optimization
From MaRDI portal
Publication:120733
DOI10.1016/J.AMC.2012.11.097zbMATH Open1274.90372OpenAlexW2084064041MaRDI QIDQ120733FDOQ120733
Authors: Neculai Andrei, Neculai Andrei 
Publication date: February 2013
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2012.11.097
Recommendations
- A simple three-term conjugate gradient algorithm for unconstrained optimization
- A new three-term conjugate gradient algorithm for unconstrained optimization
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
- Some three-term conjugate gradient methods for solving unconstrained optimization problems
- A three-term conjugate gradient algorithm for large-scale unconstrained optimization problems
conjugacy conditiondescent conditionnumerical comparisonsthree-term conjugate gradientunconstrained optimization
Cites Work
- Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
- Title not available (Why is that?)
- Function minimization by conjugate gradients
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
- Numerical study of a relaxed variational problem from optimal design
- A conjugate direction algorithm without line searches
- On a problem of the theory of lubrication governed by a variational inequality
- Mathematical problems from combustion theory
- Scaled conjugate gradient algorithms for unconstrained optimization
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
- A note on the convergence properties of the original three-term Hestenes-Stiefel method
- A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization
- Title not available (Why is that?)
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- An unconstrained optimization test functions collection
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Convergence of a New Conjugate Gradient Algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Some descent three-term conjugate gradient methods and their global convergence
- A Two-Term PRP-Based Descent Method
- 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
- Efficient generalized conjugate gradient algorithms. I: Theory
Cited In (44)
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- A New Adaptive Subspace Minimization Three-Term Conjugate Gradient Algorithm for Unconstrained Optimization
- A one-parameter class of three-term conjugate gradient methods with an adaptive parameter choice
- Discrete-time zeroing neural network of \(O(\tau^4)\) pattern for online solving time-varying nonlinear optimization problem: application to manipulator motion generation
- A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems
- A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence
- Comment on ``A new three-term conjugate gradient method for unconstrained problem
- A modified three-term type CD conjugate gradient algorithm for unconstrained optimization problems
- An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization
- New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction
- Some three-term conjugate gradient methods with the inexact line search condition
- Some new three-term Hestenes-Stiefel conjugate gradient methods with affine combination
- An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems
- A new three-term conjugate gradient method
- A new modified three-term conjugate gradient method with sufficient descent property and its global convergence
- A three-term conjugate gradient descent method with some applications
- An efficient adaptive three-term extension of the Hestenes-Stiefel conjugate gradient method
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- A new accelerated conjugate gradient method for large-scale unconstrained optimization
- Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization
- A class of globally convergent three-term Dai-Liao conjugate gradient methods
- A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
- An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix
- Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization
- Some three-term conjugate gradient methods with the new direction structure
- A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
- A subspace conjugate gradient algorithm for large-scale unconstrained optimization
- A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition
- A scaled three-term conjugate gradient method for unconstrained optimization
- A new three-term conjugate gradient method with descent direction for unconstrained optimization
- A three-term conjugate gradient method with nonmonotone line search for unconstrained optimization
- A norm descent derivative-free algorithm for solving large-scale nonlinear symmetric equations
- A new three-term conjugate gradient algorithm for unconstrained optimization
- A simple three-term conjugate gradient algorithm for unconstrained optimization
- ttcg
- New three-term conjugate gradient method with guaranteed global convergence
- On the solution of the eigenvalue assignment problem for discrete-time systems
- Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition
- A three-term method for unconstrained optimization
- Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization
- A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations
- An accelerated conjugate gradient method with adaptive two-parameter with applications in image restoration
- Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization
Uses Software
This page was built for publication: On three-term conjugate gradient algorithms for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q120733)
