[Home] . . . Search by [Problem] [Package] [Name or Keyword] . . . [Math at NIST]

Module 811 in TOMS

General Information

NDA: Algorithms for nondifferentiable optimization with simple bounds and general linear constraints. Four Fortran subroutines are provided: PMIN, intended for minimax optimization, PBUN and PNEW, intended for general nonsmooth problems, and PVAR, based on special nonsmooth variable metric methods. (See L. Luksan and J. Vlcek, ACM TOMS 27 (2001) pp. 193-213).

Classification
G2h2bGeneral nonlinear optimization with linear equality or inequality constraints of a general function (no smoothness assumed)
K2Minimax (L-infinity) approximation
Type
subroutine in TOMS package
Language
Fortran 77
Availability
Some uses prohibited, Portable
Precision
Double Precision

Download from NETLIB; Public access repository

Location
The University of Tennessee at Knoxville and Bell Laboratories
Contact
Jack Dongarra, ORNL (dongarra@cs.utk.edu) and Eric Grosse, Bell Labs (ehg@research.att.com)
Comments? gams@nist.gov