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

The package CG+ is a Conjugate Gradient code for solving large-scale, unconstrained, nonlinear optimization problems. CG+ implements three different versions of the Conjugate Gradient method: the ...

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

CSE Core Courses are classified into six areas: Introduction to CSE, Computational Mathematics, High Performance Computing, Intelligent Computing, Scientific Visualization, and Computational ...

Based on the nonmonotone line search technique proposed by Gu and Mo (Appl. Math. Comput. 55, (2008) pp. 2158-2172), a new nonmonotone trust region algorithm is proposed for solving unconstrained ...

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

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

See "Nonlinear Optimization and Related Subroutines" for a listing of all NLP subroutines. See Chapter 11, "Nonlinear Optimization Examples," for a description of the inputs to and outputs of all NLP ...

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