Nonlinear conjugate gradient methods in micromagnetics
AIP Advances, 2017 Conjugate gradient methods for energy minimization in micromagnetics are compared. The comparison of analytic results with numerical simulation shows that standard conjugate gradient method may fail to produce correct results. A method that restricts the
J. Fischbacher +11 more
doaj +2 more sources
Conjugate Gradient Methods for Toeplitz Systems [PDF]
SIAM Review, 1996 The use of preconditioned conjugate gradient methods to solve linear systems of equations with Toeplitz matrices is discussed. Using this iterative method, the complexity is reduced from \(O(n\log^2n)\) operations for fast direct Toeplitz solvers to \(O(n \log n)\).
Chan, Raymond H., Ng, Michael K.
openaire +4 more sources
A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization [PDF]
, 2011 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
Sufficient Descent Riemannian Conjugate Gradient Methods
Journal of Optimization Theory and Applications, 2021 This paper considers sufficient descent Riemannian conjugate gradient methods with line search algorithms. We propose two kinds of sufficient descent nonlinear conjugate gradient methods and prove these methods satisfy the sufficient descent condition even on Riemannian manifolds.
Hiroyuki Sakai, Hideaki Iiduka
openaire +2 more sources
Comparison Between Steepest Descent Method and Conjugate Gradient Method by Using Matlab
Journal of Studies in Science and Engineering, 2021 The Steepest descent method and the Conjugate gradient method to minimize nonlinear functions have been studied in this work. Algorithms are presented and implemented in Matlab software for both methods.
Dana Taha Mohammed Salih +1 more
doaj +1 more source
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
Three-terms conjugate gradient algorithm based on the Dai-Liao and the Powell symmetric methods [PDF]
Kirkuk Journal of Science, 2017 Based on the Dai-Laio and Powell symmetric methods, we developed a new three – term conjugate gradient method for solving large-scale unconstrained optimization problem.
Prof. Khalil K. Abbo, Aynur J. Namik
doaj +1 more source
The implementation of conjugate gradient methods for data fitting
Data Analytics and Applied Mathematics, 2023 The conjugate gradient (CG) method is widely used to solve the unconstrained optimization problem by finding the optimal solution. This problem can be solved by an iterative method.
NORHASLINDA ZULL PAKKAL +6 more
doaj +1 more source
Two efficient modifications of AZPRP conjugate gradient method with sufficient descent property
Journal of Inequalities and Applications, 2022 The conjugate gradient method can be applied in many fields, such as neural networks, image restoration, machine learning, deep learning, and many others.
Zabidin Salleh +2 more
doaj +1 more source
A Modified Hybrid Conjugate Gradient Method for Unconstrained Optimization
Journal of Mathematics, 2021 The nonlinear conjugate gradient algorithms are a very effective way in solving large-scale unconstrained optimization problems. Based on some famous previous conjugate gradient methods, a modified hybrid conjugate gradient method was proposed.
Minglei Fang +3 more
doaj +1 more source