NMinimize[f, x] minimizes f numerically with respect to x.NMinimize[f, {x, y, ...}] minimizes f numerically with respect to x, y, .... NMinimize[{f, cons}, {x, y, ...}] ...

"Defining Variables" discussed assignments such as x=y which set x equal to y. Here we discuss equations, which test equality. The equation x==y tests whether x is equal to ...

All the test problems presented in [MGH81] have been coded into Mathematica in the Optimization`UnconstrainedProblems` package. A data structure is used so that the problems ...

The shooting method works by considering the boundary conditions as a multivariate function of initial conditions at some point, reducing the boundary value problem to ...

Linear programming problems are optimization problems where the objective function and constraints are all linear. Mathematica has a collection of algorithms for solving ...

ArcCot[z] gives the arc cotangent cot -1 (z) of the complex number z.

EllipticNomeQ[m] gives the nome q corresponding to the parameter m in an elliptic function.

Interval[{min, max}] represents the range of values between min and max. Interval[{min_1 , max_1}, {min_2 , max_2}, ...] represents the union of the ranges min_1 to max_1, ...

InverseErfc[s] gives the inverse complementary error function obtained as the solution for z in s = erfc(z).

MathieuC[a, q, z] gives the even Mathieu function with characteristic value a and parameter q.