On three-term conjugate gradient algorithms for unconstrained optimization
From MaRDI portal
Publication:120733
DOI10.1016/j.amc.2012.11.097zbMath1274.90372OpenAlexW2084064041MaRDI QIDQ120733
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
unconstrained optimizationconjugacy conditionnumerical comparisonsdescent conditionthree-term conjugate gradient
Related Items
Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination, Comment on ``A new three-term conjugate gradient method for unconstrained problem, Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization, An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition, A scaled three-term conjugate gradient method for unconstrained optimization, An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems, New three-term conjugate gradient method with guaranteed global convergence, An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix, A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization, A subspace conjugate gradient algorithm for large-scale unconstrained optimization, A new modified three-term conjugate gradient method with sufficient descent property and its global convergence, Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition, Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization, A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence, An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method, Discrete-time zeroing neural network of \(O(\tau^4)\) pattern for online solving time-varying nonlinear optimization problem: application to manipulator motion generation, A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations, New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction, On the solution of the eigenvalue assignment problem for discrete-time systems, An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition, Some three-term conjugate gradient methods with the inexact line search condition, A norm descent derivative-free algorithm for solving large-scale nonlinear symmetric equations, A new three-term conjugate gradient algorithm for unconstrained optimization, ttcg, A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition, Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization, Some three-term conjugate gradient methods with the new direction structure, A class of globally convergent three-term Dai-Liao conjugate gradient methods, A new accelerated conjugate gradient method for large-scale unconstrained optimization, A NEW THREE–TERM CONJUGATE GRADIENT METHOD WITH DESCENT DIRECTION FOR UNCONSTRAINED OPTIMIZATION, A one-parameter class of three-term conjugate gradient methods with an adaptive parameter choice, A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition, Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization
Uses Software
Cites Work
- Efficient generalized conjugate gradient algorithms. I: Theory
- 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 Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
- A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
- 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
- Function minimization by conjugate gradients
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
