Below, you will find information about software developed by the Center, as well as download links. Disclaimer: This software is provided without any expressed or implied warranty. In particular, ...

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

Description: Survey of computational tools for solving constrained and unconstrained nonlinear optimization problems. Emphasis on algorithmic strategies and characteristic structures of nonlinear ...

Computational methods for fitting nonlinear models have developed considerably in the last decade. Statistical use of these techniques has, as yet, lagged somewhat behind. The present paper gives a ...

When solving the general smooth nonlinear and possibly nonconvex optimization problem involving equality and/or inequality constraints, an approximate first-order critical point of accuracy ϵ can be ...

The course is designed to provide engineering students a view of optimization as a tool for engineering decision making. Students will be given a fundamental introduction to the optimization ...

Studies linear and nonlinear programming, the simplex method, duality, sensitivity, transportation and network flow problems, some constrained and unconstrained optimization theory, and the ...

Established in 2002, the Lagrange Prize in Continuous Optimization is awarded jointly by the Mathematical Programming Society (MPS) and the Society for Industrial and Applied Mathematics (SIAM). SIAM ...