Results 41 to 50 of about 118,790 (360)
A Dai-Liao-type projection method for monotone nonlinear equations and signal processing
In this article, inspired by the projection technique of Solodov and Svaiter, we exploit the simple structure, low memory requirement, and good convergence properties of the mixed conjugate gradient method of Stanimirović et al.
Ibrahim Abdulkarim Hassan +4 more
doaj +1 more source
In this Research we developed a New Hybrid method of conjugate gradient type, this Method depends basically on combining Hestenes-Stiefel and Dai-Yuan algorithms by using spectral direction conjugate algorithm, which is developed by Yang Z & Kairong W ...
Khalil K. Abbo, Hisham M. Khudhur
doaj +1 more source
A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization [PDF]
Conjugate gradient methods are widely used for solving large-scale unconstrained optimization problems, because they do not need the storage of matrices.
Hager W. W. +4 more
core +1 more source
Continuation-conjugate gradient methods for the least squares solution of nonlinear boundary value problems [PDF]
We discuss in this paper a new combination of methods for solving nonlinear boundary value problems containing a parameter. Methods of the continuation type are combined with least squares formulations, preconditioned conjugate gradient algorithms and ...
Glowinski, R. +2 more
core +1 more source
Global Convergence of a Nonlinear Conjugate Gradient Method
A modified PRP nonlinear conjugate gradient method to solve unconstrained optimization problems is proposed. The important property of the proposed method is that the sufficient descent property is guaranteed independent of any line search. By the use of the Wolfe line search, the global convergence of the proposed method is established for nonconvex ...
Liu, Jin-Kui +2 more
openaire +2 more sources
In this article, we propose a three-term conjugate gradient projection algorithm for solving constrained monotone nonlinear equations. The global convergence of the algorithm was established under suitable assumptions.
Auwal Bala Abubakar +2 more
doaj +1 more source
A New Smoothing Conjugate Gradient Method for Solving Nonlinear Nonsmooth Complementarity Problems
In this paper, by using the smoothing Fischer-Burmeister function, we present a new smoothing conjugate gradient method for solving the nonlinear nonsmooth complementarity problems.
Ajie Chu, Shouqiang Du, Yixiao Su
doaj +1 more source
Combining the projection method of Solodov and Svaiter with the Liu-Storey and Fletcher Reeves conjugate gradient algorithm of Djordjević for unconstrained minimization problems, a hybrid conjugate gradient algorithm is proposed and extended to solve ...
Abdulkarim Hassan Ibrahim +4 more
doaj +1 more source
Regularized Nonlinear Acceleration [PDF]
We describe a convergence acceleration technique for unconstrained optimization problems. Our scheme computes estimates of the optimum from a nonlinear average of the iterates produced by any optimization method.
Bach, Francis +2 more
core +4 more sources
A New Hybrid Conjugate Gradient Method with Guaranteed Descent for Unconstraint Optimization
The conjugate gradient method an efficient technique for solving the unconstrained optimization problem. In this paper, we propose a new hybrid nonlinear conjugate gradient methods, which have the descent at every iteration and globally convergence ...
Basim A. Hassan
doaj +1 more source

