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 presents a numerical comparison between algorithms for unconstrained optimization that take account of sparsity in the second derivative matrix of the objective function. Some of the ...

In this paper we test different conjugate gradient (CG) methods for solving largescale unconstrained optimization problems. The methods are divided in two groups: the first group includes five basic ...

This course introduces high-performance computing (“HPC”) systems, software, and methods used to solve large-scale problems in science and engineering. It will focus on the intersection of two ...