You are here: Symbol Reference > Optimization Namespace
MtxVec VCL
ContentsIndex
PreviousUpNext
Optimization Namespace

Function minimization routines.

Introduces the following algorithms for finding the minimum of scalar function of several variables:

  • Nelder-Mead ( crefSimplex); unconstrained and bounded minimization.
  • Quasi-Newton ( crefBFGS or DFP update scheme); unconstrained minimization.
  • Levenberg-Marquardt ( crefMarquardt); unconstrained minimization.
  • Conjugate Gradient (Fletcher - Reeves or Polak - Ribiere uate scheme); unconstrained minimization.

Introduces the following algorithms for finding the minimum of vector function of several variables:

  • Trust Region (TR); unconstrained and bounded minimization.

Introduces the following algorithms for finding the minimum of function of single variable:

  • Brent method; unconstrained minimization.

In addition, several routines for linear programming (LP) are also provided. The following algorithms are supported:

  • Two phase Simplex method.
  • Dual Simplex method.
  • Simplex method.
  • Gomory's cutting plane algorithm for solving integral problems.
Name 
Description 
The following table lists classes in this documentation. 
The following table lists functions in this documentation. 
The following table lists structs, records, enums in this documentation. 
The following table lists types in this documentation. 
 
Name 
Description 
 
Optional object class type to be passed to optimization routines. 
 
This is class Optimization.TRCustomData. 
 
Name 
Description 
 
BFGS 
Minimizes the function of several variables by using the Quasi-Newton optimization method with no log. 
 
BFGS 
Minimizes the function of several variables by using the Quasi-Newton optimization method with no log. 
 
BFGS 
Minimizes the function of several variables by using the Quasi-Newton optimization algorithm. 
 
BFGS 
Minimizes the function of several variables by using the Quasi-Newton optimization method with no log. 
 
Minimizes the function of several variables by using the Conjugate gradient optimization method with no log. 
 
Minimizes the function of several variables by using the Conjugate gradient optimization method with no log. 
 
Minimizes the function of several variables by using the Conjugate gradient optimization method with no log. 
 
Minimizes the function of several variables by using the Conjugate gradient optimization algorithm. 
 
CPA 
Gomory's cutting plane algorithm for solving the integer programming problem. 
 
Minimizes the function of several variables by using the Marquardt optimization method with no log. 
 
Minimizes the function of several variables by using the Marquardt optimization algorithm. 
 
Minimizes the function of several variables by using the Marquardt optimization method with no log. 
 
Minimizes the function of several variables by using the Marquardt optimization method with no log. 
 
Minimizes single variable function by using default settings and no log. 
 
Minimizes single variable function. 
 
Minimize function of several variables by using Simplex method with lower and/or upper bounds for parameters. 
 
Minimizes the function of several variables by using the Nelder-Mead (Simplex) optimization method. 
 
Minimizes function of several variables by using Simplex optimization method with no algorithm step log. 
 
Linear optimization by Dual Simplex algorithm. 
 
Linear optimization by using Simplex method. 
 
Linear optimization by Two-Phase Simplex algorithm. 
 
This is function Optimization.StopReasonToStr. 
 
This is function Optimization.TrustRegion. 
 
This is function Optimization.TrustRegion. 
 
Trust region algorithm for finding minimum of vector function. 
 
Trust region algorithm to find bounded minimum of vector function. 
 
Name 
Description 
 
Linear programming algorithm. 
 
LP system solution. 
 
Optimization methods. 
 
Stop reason for the main loop in optimization. 
Name 
Description 
Stores the stopping tests for TR optimization. 
Defines the procedure for calculating the gradient of a real function. 
Defines the procedure for calculating the gradient and Hessian matrix of a real function. 
Defines procedure for calculating the Jacobian matrix. 
Defines vector function of several variables. 
Copyright (c) 1999-2025 by Dew Research. All rights reserved.
What do you think about this topic? Send feedback!