A line of engineering research seeks to develop computers that can tackle a class of challenges called combinatorial optimization problems. These are common in real-world applications such as ...

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

This project is aimed at implementing nonlinear programming algorithms as the (un-)constrained minimization problems with the focus on their numerical expression using various programming languages.

PRIMA is a package for solving general nonlinear optimization problems without using derivatives. It provides the reference implementation for Powell's derivative-free optimization methods, i.e., ...

In this paper we propose the optimization of the snow sub-model of MORDOR using MODIS and in situ measurements for the case study of the Serre-Ponçon reservoir (one of the largest artificial lakes in ...

This method was first introduced by Hestenes and Stiefel [26] and is used to solve a system of linear equations. After that, in 1964, Fletcher and Reeves extended the form of the conjugate gradient ...

Modified spectral conjugate gradient iterative scheme for unconstrained optimization problems with application on COVID-19 model ...

MR 98e:90192 B. Chen and N. Xiu, "A global linear and local quadratic non-interior continuation method for nonlinear complementarity problems based on Chen-Mangasarian smoothing function", to appear ...