A new smoothing modified three-term conjugate gradient method for l1 $l_{1}$-norm minimization problem [PDF]
We consider a kind of nonsmooth optimization problems with l1 $l_{1}$-norm minimization, which has many applications in compressed sensing, signal reconstruction, and the related engineering problems.
Shouqiang Du, Miao Chen
doaj +2 more sources
A Combined Conjugate Gradient Quasi-Newton Method with Modification BFGS Formula [PDF]
The conjugate gradient and Quasi-Newton methods have advantages and drawbacks, as although quasi-Newton algorithm has more rapid convergence than conjugate gradient, they require more storage compared to conjugate gradient algorithms.
Mardeen Sh. Taher, Salah G. Shareef
doaj +3 more sources
A New Parameterized Conjugate Gradient Method based on Generalized Perry Conjugate Gradient Method
A New Parameterized Conjugate Gradient Method based on Generalized Perry Conjugate Gradient Method is proposed to be based on Perry's idea, the descent condition and the global convergent is proven under Wolfe condition.
Khalil K. Abbo, Nazar K. Hussein
doaj +1 more source
Parallel conjugate gradient method
We investigate a parallel version of the preconditioned conjugate gradientmethod. A scalability analysis is done for a finite difference schemewhich approximates the 3D elliptic problem.
Raimondas Čiegis, Galina Šilko
doaj +3 more sources
Differentiating the Method of Conjugate Gradients [PDF]
The method of conjugate gradients (CG) is widely used for the iterative solution of large sparse systems of equations $Ax=b$, where $A\in\Re^{n\times n}$ is symmetric positive definite. Let $x_k$ denote the $k$th iterate of CG. This is a nonlinear differentiable function of $b$. In this paper we obtain expressions for $J_k$, the Jacobian matrix of $x_k$
Serge Gratton +3 more
openaire +2 more sources
Comparison Between Steepest Descent Method and Conjugate Gradient Method by Using Matlab
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
A New Paired Spectral Gradient Method to Improve Unconstrained and Non-Linear Optimization [PDF]
The conjugated spectral gradient (SCG) method is an effective method for non-constrained large-scale nonlinear optimization. In this work, a new spectral conjugate gradient method is proposed with a strong Wolfe-Powell line search (SWP). The new proposal
Siham Aziz, Zeyad Abdullah
doaj +1 more source
Anew Conjugate Gradient Algorithm Based on The (Dai-Liao) Conjugate Gradient Method
In this paper we can derive a new search direction of conjugating gradient method associated with (Dai-Liao method ) the new algorithm becomes converged by assuming some hypothesis.
SHAHER QAHTAN HUSSEIN +2 more
doaj +1 more source
Conjugate Gradient Methods for Toeplitz Systems [PDF]
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)\).
Raymond H. Chan, Michael K. Ng 0001
openaire +2 more sources
Block Preconditioning for the Conjugate Gradient Method [PDF]
Different block preconditionings for the conjugate gradient methods are investigated for solving positive definite block tridiagonal systems. These preconditionings are based on different sparse approximate matrix inverses. The proposed methods are compared with other well-known preconditionings as for example the point incomplete Cholesky ...
Concus, P., Golub, G.H., Meurant, G.
openaire +3 more sources

