Algorithm 896: LSA: Algorithms for Large-Scale Optimization

Abstract

We present 14 basic Fortran subroutines for large-scale unconstrained and box constrained optimization and large-scale systems of nonlinear equations. Subroutines, based on various strategies, are intended for dense and sparse general optimization problems, smooth and nonsmooth partially separable optimization problems, sparse nonlinear least-squares problems, minimization of a maximum value (minimax), minimization of a sum of absolute values, and sparse systems of nonlinear equations. Besides the description of methods and codes, we propose computational experiments which demonstrate the efficiency of the proposed algorithms.

Categories and tags

  • Článek v odborném periodiku