[PDF] Top 20 Dai Kou type conjugate gradient methods with a line search only using gradient
Has 10000 "Dai Kou type conjugate gradient methods with a line search only using gradient" found on our website. Below are the top 20 most common "Dai Kou type conjugate gradient methods with a line search only using gradient".
Dai Kou type conjugate gradient methods with a line search only using gradient
... were written in Matlab and run on a notebook computer with an Intel(R) Core(TM) i- U . GHz CPU, . GB of RAM and Linux operation system Ubuntu .. All test problems were drawn from the CUTEst test library ... See full document
17
Conjugate Gradient Methods for Computing Weighted Analytic Center for Linear Matrix Inequalities Using Exact and Quadratic Interpolation Line Searches
... four conjugate gradient methods The methods considered are the classical methods by Hestenes-Stiefel (HS), Fletcher and Reeves (FR), Polak and Ribiere (PR) discussed in [14] and a ... See full document
10
Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization
... nonlinear conjugate gra- dient algorithms for constrained smooth convex optimization which are examples of the proposed line search fixed point algorithms, in contrast to the previously reported re- ... See full document
32
A Modified FR Conjugate Gradient Method with Strong Wolfe Line Search
... Abstract. In this paper, a modified FR conjugate gradient method(MFR) is presented for solving unconstrained optimization problems. The sufficient descent property of the MFR method is satisfied without any ... See full document
7
Minimization of Unconstrained Nonpolynomial Large-Scale Optimization Problems Using Conjugate Gradient Method Via Exact Line Search
... exact line search technique coupled with the conjugate gradient method (CGM) in minimizing the large scale non-polynomial functions discussed in this research ... See full document
5
Modified Fletcher Reeves and Dai Yuan Conjugate Gradient Methods for Solving Optimal Control Problem of Monodomain Model
... any line search used. As a result, the MFR and MDY methods possess an advantageover the FR and DY methods since the Armijo line search can be ...Wolfe line search, ... See full document
9
The global proof of the Polak–Ribière–Polak algorithm under the YWL inexact line search technique
... Numerical results of Table 2 show that both of these two algorithms have a good ef- ficiency for these practical problems. The iteration number, the number of the function value and the gradient value, and the CPU ... See full document
13
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 ... See full document
12
Optimal control based on nonlinear conjugate gradient method in cardiac electrophysiology
... OCPMM using modified and hybrid nonlinear conjugate gradient ...optimization methods are proved to be superior to the classical methods in terms of optimization ...nonlinear ... See full document
46
A Conjugate Gradient Method for Unconstrained Optimization Problems
... new conjugate gradient methods see 1, 13–16, 18, 19, 29, 30 which have good properties and good numerical ...we only test Algorithm 2.1 under the WWP line search on problems in ... See full document
14
A conjugate gradient algorithm for large scale unconstrained optimization problems and nonlinear equations
... the conjugate gradient algorithm and obtained amazing ...jugate gradient algorithm is increasingly famous because of its simplicity and low require- ment of calculation ...good conjugate ... See full document
19
Three New Hybrid Conjugate Gradient Methods for Optimization
... two methods produce sufficient descent search direction at every itera- ...the line search used nor on the convexity of the objective ...new methods even for nonconvex ... See full document
6
A DESCENT PRP CONJUGATE GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION
... exact line search, the PRP method can cycle infinitely without approaching to a stationary ...the search direction is a descent direction, Yuan [20] has established the global convergence of the PRP ... See full document
14
Solving Limited-Memory BFGS Systems with Generalized Diagonal Updates
... D = αI for some constant α > 0, and we stated that the formula can be generalized to diagonal matrices. Here, we explicitly show how to generalize this approach to positive- definite diagonal matrices D. Furthermore, ... See full document
5
A New Preconditioned Conjugate Gradient Method for Optimization
... hybrid Conjugate Gradient (CG) method that generates weighted search directions is proposed in this ...matrix using data from the two most recent iterates. Multi-step methods have ... See full document
8
High-Resolution Source Localization Algorithm Based on the Conjugate Gradient
... In this paper, the CG algorithm, with its basic version given in [12], is applied to generate a signal subspace basis which is not based on the eigenvectors. This basis is rather generated using the residual ... See full document
9
Diverse Exploration via Conjugate Policies for Policy Gradient Methods
... Policy gradient (PG) (Peters and Schaal 2008; Schulman et ...2017) methods in reinforcement learning (RL) (Sutton and Barto 1998) have shown the ability to train large function approximators with many ... See full document
8
Numerical Experiments with the Lagrange Multiplier and Conjugate Gradient Methods (ILMCGM)
... Doctoral Thesis of [3] threw light on the theoretical applicability of the CGM, which was extended to optimal control problems by [4], [5] and [6].Applicability of the CGM algorithm thus depends solely on the explicit ... See full document
6
New Homotopy Conjugate Gradient for Unconstrained Optimization using Hestenes- Stiefel and Conjugate Descent
... and conjugate direction (CD) ,the comparative tests involve well-known nonlinear problems (standard test function) with different dimension 4 ≤n≤5000, all programs are written in FORTRAN95 language and for all ... See full document
6
New variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
... bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand ...These methods are based on global ... See full document
17
Related subjects