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

Class K1b2b: Nonlinearly constrained nonlinear least squares approximation

General Information

Parent Class
K1b2
Top of Tree
GAMS

Modules

Package NAG

E04USF
Minimum of a sum of squares, nonlinear constraints, sequential QP method, using function values and optionally first derivatives (comprehensive)

Package NAGC

e04unc
Solves nonlinear least-squares problems using the sequential QP method

Package OPT (Downloadable)

DQED
Solves nonlinear least squares problems with linear constraints and simple bounds using a quadratic-tensor local model. Some problems with nonlinear constraints can also be solved. Derivatives required. Forward or reverse communication. (See R.J. Hanson, SIAM J. Sci. Stat. Comput. 7 (1986) pp. 826-834.).
Comments? gams@nist.gov