Class G1b1b ... Unconstrained optimization of a smooth multivariate function, user provides first derivatives

• Parent class.
• Top of Tree

Modules for class G1b1b

• DSUMSL (SUMSL) Minimizes a general uncontrained objective function using analytic gradient and ...
• OPTIF9 Solves the unconstrained minimization problem: minimize the real-valued function ...
• SUMSL (DSUMSL) Minimizes a general unconstrained objective function using analytic gradient and ...

• DUMCGG (UMCGG) Minimize a function of N variables using a conjugate gradient algorithm and a us ...
• DUMIDH (UMIDH) Minimize a function of N variables using a modified Newton method and a finite-d ...
• DUMING (UMING) Minimize a function of N variables using a quasi-Newton method and a user-suppli ...
• DUNLSJ (UNLSJ) Solve a nonlinear least squares problem using a modified Levenberg-Marquardt alg ...
• UMCGG (DUMCGG) Minimize a function of N variables using a conjugate gradient algorithm and a us ...
• UMIDH (DUMIDH) Minimize a function of N variables using a modified Newton method and a finite-d ...
• UMING (DUMING) Minimize a function of N variables using a quasi-Newton method and a user-suppli ...
• UNLSJ (DUNLSJ) Solve a nonlinear least squares problem using a modified Levenberg-Marquardt alg ...

• E04DGF Minimizes an unconstrained nonlinear function of several variables using a pre-c ...
• E04GYF E04GYF is an easy-to-use quasi-Newton algorithm for finding an unconstrained min ...
• E04GZF Easy-to-use modified Gauss-Newton algorithm for finding an unconstrained minimum ...

• NAG_OPT_CONJ_GRAD Minimizes an unconstrained nonlinear function of several variables using a preco ...

• CG Minimizes a multivariate function using the Fletcher-Reeves form of the conjugat ...

• A21 Finds the minimum of a function of n variables using a variable metric algorithm ...
• A22 Finds the minimum of a function of n variables using a conjugate gradient algori ...

• LBFGS_BCM Solves large nonlinear optimization problems with simple bounds on the variables ...
• LBFGS_UM Solves large unconstrained optimization problems, using a limited-memory BFGS qu ...
• TN Solves unconstrained and simply bounded nonlinear optimization problems using a ...
• VE08 Minimizes partially separable objective function with optional upper and lower b ...

• DMNG (MNG) Finds a local minimum of a continuously differentiable function. User supplies g ...
• DRMNG (RMNG) Reverse communication version of PORT's MNG. Finds a local minimum of a continuo ...
• MNG (DMNG) Finds a local minimum of a continuously differentiable function. User supplies g ...
• RMNG (DRMNG) Reverse communication version of PORT's MNG. Finds a local minimum of a continuo ...

• 500 MINI: a subprogram for finding an unconstrained minimum of a multivariate functi ...
• 611 SMSNO, SUMSL, and HUMSL: Fortran subprograms for solving general unconstrained m ...
• 630 BBVSCG: a variable storage Fortran subprogram for function minimization. (See A.
• 711 BTN: A collection of subroutines for solving unconstrained nonlinear optimizatio ...
• 734 Fortran 90 routine for unconstrained nonlinear minimization, designed for use in ...
• 739 Unconstrained optimization using tensor methods. Finds the unconstrained minimiz ...
• 765 STENMIN: a Fortran package for large sparse unconstrained optimization using ten ...
• 778 L-BFGS-B: Solves large nonlinear optimization problems with simple bounds on the ...