conjugate gradient descent method
A Conjugate Gradient Method for Unconstrained Optimization Problems
... FR conjugate gradient method and its global convergence, Zoutendijk 22 proved its global convergence for nonconvex ...sufficient descent condition and the global convergence of the FR ...
14
Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization
... proposed method is that the generated directions are always ...proposed method possesses better performances when compared with the classic PRP method, CG-DESCENT method and DSP-CG ...
12
A Modified FR Conjugate Gradient Method with Strong Wolfe Line Search
... FR conjugate gradient method has been disclosed, whose algorithm satisfies the descent property and the global convergence of this method can be guaranteed under some mild ...MFR ...
7
Three modified Polak Ribière Polyak conjugate gradient methods with sufficient descent property
... PRP method is globally convergent for nonconvex problems. However, the method given by Grippo and Lucidi [] does not per- form better than the PRP method, which employs β k PRP+ and the Wolfe line ...
14
Handwritten Character Recognition using Modified Gradient Descent Technique of Neural Networks and Representation of Conjugate Descent for Training Patterns
... Many highly accurate systems have been developed to recognize offline handwritten numerals and characters [13-17] but their success has not been carried out on the word recognition domain, due to the difficult nature of ...
14
New Homotopy Conjugate Gradient for Unconstrained Optimization using Hestenes- Stiefel and Conjugate Descent
... The results are given in below table is specifically quote the number of functions NOF and the number of iteration NOI .experimental results in below table confirm that the new CG method is superior to standard CG ...
6
Accelerated Mann and CQ algorithms for finding a fixed point of a nonexpansive mapping
... The purpose of this paper is to present accelerations of the Mann and CQ algorithms. We first apply the Picard algorithm to the smooth convex minimization problem and point out that the Picard algorithm is the steepest ...
12
A New Conjugancy Coefficient of Conjugate Gradient Method
... steepest descent method with Armijo-type search is proved under very general conditions in (Andrei, ...any conjugate gradient method with strong Wolfe line search, the following general ...
6
A New Preconditioned Conjugate Gradient Method for Optimization
... weighted descent Conjugate Gradient method with multi-step quasi-Newton updates is ...The method generates search directions that are a combination of the two-step quasi-Newton and CG ...
8
Logistic regression with conjugate gradient descent for document classification
... use gradient descent as their optimization ...that conjugate gradient descent outperforms gradient descent because the method first computes the gradient to ...
34
A new accelerated conjugate gradient method for large scale unconstrained optimization
... accelerated conjugate gradient method (NACG) for large-scale unconstrained ...sufficient descent condition and Dai–Liao conjugacy ...given method provides more useful information and adds ...
13
The effect of adaptive gain and adaptive momentum in improving training time of Gradient Descent back propagation algorithm on classification problems
... a method for automatic gain tuning using a fuzzy logic ...a method to change adaptively gain value on other optimisation method such as conjugate ...
7
Global convergence of a modified conjugate gradient method
... modified conjugate gradient method to solve unconstrained optimization problems is proposed which satisfies the sufficient descent condition in the case of the strong Wolfe line search, and its ...
12
Vol 4, No 11 (2013)
... new conjugate gradient method for unconstrained optimization by using Logistics Equation ....Conjugate gradient methods are widely used for large scale unconstrained optimization ...of ...
5
PRP Type Direct Search Methods for Unconstrained Optimization
... PRP+ method with some descent conjugate gradient methods to make use of the gradient ...These descent conjugate gradient methods for solving unconstrained ...
7
The Effect of Adaptive Gain and Adaptive Momentum in Improving Training Time of Gradient Descent Back Propagation Algorithm on Classification Problems
... a method for automatic gain tuning using a fuzzy logic ...a method to change adaptively gain value on other optimisation method such as conjugate ...
7
A DESCENT PRP CONJUGATE GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION
... sufficient descent condition is very important to the global convergence of the nonlinear conjugate gradient ...a conjugate gradient method may not be a descent ...PRP ...
14
A New Descent Nonlinear Conjugate Gradient Method for Unconstrained Optimization
... nonlinear conjugate gradient method is proposed for large-scale unconstrained optimiza- ...sufficient descent property holds without any line ...this method is proved to be globally ...
5
The modified accelerated Bregman method for regularized basis pursuit problem
... iteration method was presented in [], which was motivated by ...Bregman method is to combine a fixed point iteration with the Bregman method in [, ], but the linearized Bregman method is ...
17
A hybrid conjugate gradient method for optimization problems
... hybrid method of the Polak-Ribière-Polyak (PRP) method and the Wei-Yao-Liu (WYL) method is proposed for unconstrained optimization pro- blems, which possesses the following proper- ties: i) This ...
6