Algorithm 896: LSA: Algorithms for Large-Scale Optimization

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F09%3A00328063" target="_blank" >RIV/67985807:_____/09:00328063 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Algorithm 896: LSA: Algorithms for Large-Scale Optimization

Original language description

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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BB - Applied statistics, operational research

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2009

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

ACM Transactions on Mathematical Software

ISSN

0098-3500

e-ISSN

—

Volume of the periodical

36

Issue of the periodical within the volume

3

Country of publishing house

US - UNITED STATES

Number of pages

29

Pages from-to

—

UT code for WoS article

000268474100004

EID of the result in the Scopus database

—