Conjugate gradient methods form a class of iterative algorithms that are highly effective for solving large‐scale unconstrained optimisation problems. They achieve efficiency by constructing search ...

Finding the sparse solution to under-determined or ill-condition equations is a fundamental problem encountered in most applications arising from a linear inverse problem, compressive sensing, machine ...

This is a preview. Log in through your library . Abstract A rate of convergence of the conjugate gradient method for minimizing the convex quadratic functionals in Hilbert space is investigated.