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 ...

This paper discusses the use of the linear conjugate-gradient method (developed via the Lanczos method) in the solution of large-scale unconstrained minimization problems. At each iteration of a ...

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 ...