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 is a preview. Log in through your library . Abstract Based on the nonmonotone line search technique proposed by Gu and Mo (Appl. Math. Comput. 55, (2008) pp. 2158-2172), a new nonmonotone trust ...

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

Purdue faculty dedicate countless hours to exploring the frontiers of their respective fields, pushing the boundaries of knowledge and contributing to the ever-evolving landscape of academia. To ...

Recently, a research team from the Rudolf Technology Center in Slovenia proposed a new method to optimize the sparse subgraph problem, which has wide applications in fields such as network analysis ...