Results 21 to 30 of about 244,425 (248)
Optimal CD-DY Conjugate Gradient Methods with Sufficient Descent [PDF]
المجلة العراقية للعلوم الاحصائية, 2013 Conjugate Gradient (CG) methods are widely used for large scale unconstrained optimization problems. Most of CG-methods don’t always generate a descent search direction, so the descent condition is usually assumed in the analysis and implementations.
Abbas Y. Al-Bayati, Hawraz N. Al-Khayat
doaj +1 more source
New Conjugacy Coefficient for Conjugate Gradient Method for Unconstrained Optimization [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2013 In this paper, we derived a new conjugacy coefficient of conjugate gradient method which is based on non-linear function using inexact line searches. This method satisfied sufficient descent condition and the converges globally is provided. The numerical
Hamsa Chilmeran, Huda Najm
doaj +1 more source
A New Three–Term Conjugate Gradient Method with Descent Direction for Unconstrained Optimization
Mathematical Modelling and Analysis, 2016 In this paper, we propose a three–term PRP–type conjugate gradient method which always satisfies the sufficient descent condition independently of line searches employed.
XiaoLiang Dong +4 more
doaj +1 more source
Algorithms, 2021 The conjugate gradient method is one of the most popular methods to solve large-scale unconstrained optimization problems since it does not require the second derivative, such as Newton’s method or approximations.
Zabidin Salleh +3 more
doaj +1 more source
A New Conjugate Gradient Coefficient for Unconstrained Optimization Based On Dai-Liao
Science Journal of University of Zakho, 2019 This paper, proposes a new conjugate gradient method for unconstrained optimization based on Dai-Liao (DL) formula; descent condition and sufficient descent condition for our method are provided.
Alaa L. Ibrahim +2 more
doaj +1 more source
New Projection Matrix for the Stander Conjugate Gradient Method [PDF]
المجلة العراقية للعلوم الاحصائية, 2013 In this paper, we have derived anew proposed algorithm for conjugate gradient method based on a projection matrix. This Algorithm satisfies the sufficient descent condition and the globally converges .
Abaas Y. BAYATI +2 more
doaj +1 more source
Practical Inexact Proximal Quasi-Newton Method with Global Complexity Analysis [PDF]
, 2015 Recently several methods were proposed for sparse optimization which make careful use of second-order information [10, 28, 16, 3] to improve local convergence rates.
Scheinberg, Katya, Tang, Xiaocheng
core +1 more source
Mathematical Problems in Engineering, 2009 Two nonlinear conjugate gradient‐type methods for solving unconstrained optimization problems are proposed. An attractive property of the methods, is that, without any line search, the generated directions always descend. Under some mild conditions, global convergence results for both methods are established.
Zhang, Jianguo +2 more
openaire +1 more source
A Robust Spectral Three-Term Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2019 In this paper, we investigated a new improved Conjugate Gradient (CG) algorithm of a Three-Term type (TTCG) based on Dai and Liao procedure to improve the CG algorithm of (Hamoda, Rivaie, and Mamat / HRM).
Abbas Al-Bayati, Sabreen Abbas
doaj +1 more source
Algorithm for Optimal Mode Scheduling in Switched Systems [PDF]
, 2011 This paper considers the problem of computing the schedule of modes in a switched dynamical system, that minimizes a cost functional defined on the trajectory of the system's continuous state variable.
Egerstedt, Magnus, Wardi, Yorai
core +2 more sources