[PDF] Top 20 Minimization of Unconstrained Nonpolynomial Large-Scale Optimization Problems Using Conjugate Gradient Method Via Exact Line Search
Has 10000 "Minimization of Unconstrained Nonpolynomial Large-Scale Optimization Problems Using Conjugate Gradient Method Via Exact Line Search" found on our website. Below are the top 20 most common "Minimization of Unconstrained Nonpolynomial Large-Scale Optimization Problems Using Conjugate Gradient Method Via Exact Line Search".
Minimization of Unconstrained Nonpolynomial Large-Scale Optimization Problems Using Conjugate Gradient Method Via Exact Line Search
... The minimization of the problem using all the methods is all satisfied using the tolerance ε = 10 − 6 ...the problems in Tables 1-3, we conclude that all the methods converge very fast and ... See full document
5
A Modified FR Conjugate Gradient Method with Strong Wolfe Line Search
... FR conjugate gradient method(MFR) is presented for solving unconstrained optimization ...MFR method is satisfied without any line ...MFR method reduces to the ... See full document
7
Modified HS conjugate gradient method for solving generalized absolute value equations
... nonlinear conjugate gradi- ent methods such as Hestenes–Stiefel (HS) method [8], Fletcher–Reeves (FR) method [7], Polak–Ribiere–Polyak (PRP) method [20, 21], Dai–Yuan (DY) method [6], ... See full document
12
A new smoothing modified three term conjugate gradient method for \(l {1}\) norm minimization problem
... Bregman method [7, 8], alternating direction algorithms [9], nonsmooth equations-based method [10] and some related methods [11, ...ing gradient method has been given for solving problem (1) ... See full document
14
A new accelerated conjugate gradient method for large scale unconstrained optimization
... Conjugate gradient methods are widely used for solving large-scale unconstrained opti- mization problems, due to their simplicity and low ...quasi-Newton method to improve ... See full document
13
Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization
... proposed method is that the generated directions are always ...of line search used and the convexity of objective ...Wolfe line search condition, we establish the global convergence of ... See full document
12
A conjugate gradient algorithm and its application in large scale optimization problems and image restoration
... solve large-scale unconstrained optimization problems, a modified PRP conjugate gradient algorithm is proposed and is found to be interesting because it combines the ... See full document
25
A hybrid conjugate gradient method for optimization problems
... solving optimization problems (see [24,26,28-32,34] ...the conjugate gradient(CG) method is a powerful line search method because of its simplicity and its very low ... See full document
6
A New Descent Nonlinear Conjugate Gradient Method for Unconstrained Optimization
... the search directions for unconstrained optimization ...some line searches such as the exact line search, the Wolfe- Powell line search and the Grippo-Lucidi ... See full document
5
3. A New Conjugate Gradient for Nonlinear Unconstrained Optimization
... The conjugate gradient method is a very useful technique for solving minimization problems and has wide applications in many ...new conjugate gradient methods by) for ... See full document
13
A conjugate gradient algorithm for large scale unconstrained optimization problems and nonlinear equations
... The optimization model is an important mathematic problem since it has been applied to various fields such as economics, engineering, and physics (see ...address large-scale unconstrained ... See full document
19
A Conjugate Gradient Method for Unconstrained Optimization Problems
... , Conjugate-Descent CD 6 , Liu-Storrey LS 7 , and Dai-Yuan DY 8 ...CG method is a powerful line search method for solving optimization problems, and it remains very ... See full document
14
A Line Search Algorithm for Unconstrained Optimization
... corresponding line search method is called Newton-like method [4-6] such as Newton method, quasi-Newton method, variable metric method, ...the method for ... See full document
7
Extended Spectral Nonlinear Conjugate Gradien...
... In this paper, we present extension forms of Dai, Yuan (DY), Fletcher, Reveres (FR) and Conjugate Descent (CD) CG algorithms. The extended method have the sufficient descent and globally convergence ... See full document
8
A Non Monotone Trust Region Method with Non Monotone Wolfe Type Line Search Strategy for Unconstrained Optimization
... region method with non-monotone Wolfe-type line search strategy for unconstrained optimization problems based on (5), (6) and ...of line search strategy, new ... See full document
6
A New Preconditioned Conjugate Gradient Method for Optimization
... the search direction without having to explicitly retain the matrix in storage nor update ...new method is inspired by the works of Anderi [2] and Ford et ...CG method that does not directly involve ... See full document
8
Dai Kou type conjugate gradient methods with a line search only using gradient
... the line search () into the Dai-Kou type conjugate gradient methods, then the improved methods of this paper have several ...nonlinear optimization () only requiring gradient ... See full document
17
An adaptive nonmonotone trust region method for unconstrained optimization problems based on a simple subproblem
... methods. Using the adap- tive strategy proposed in [15], Sang et ...region method based on a simple subproblem for large-scale unconstrained optimization problems which ... See full document
24
A scaled three term conjugate gradient method for unconstrained optimization
... the search direction can be determined without requiring the storage of any ...classical conjugate gradi- ent methods PRP [] and FR [] can be seen as memoryless BFGS (see Shanno ...three-term ... See full document
16
A Non-Monotone Conic Trust Region Method With Line Search For Unconstrained Optimization
... either line search method or trust region ...region method has strong convergence and robustness, can be applied to ill-conditioned ... See full document
7
Related subjects