Here is one way to get multiple minima: call NMinimize multiple times with different random seeds, which will cause different optimization paths to be taken. This defines a ...
ChanVeseBinarize[image] finds a two-level segmentation of image by computing optimal contours around regions of consistent intensity in image.ChanVeseBinarize[image, marker] ...
PolynomialGCD[poly_1, poly_2, ...] gives the greatest common divisor of the polynomials poly_i. PolynomialGCD[poly_1, poly_2, ..., Modulus -> p] evaluates the GCD modulo the ...
DirichletL[k, j, s] gives the Dirichlet L-function L(\[Chi], s) for the Dirichlet character \[Chi](n) with modulus k and index j.
Log2
(Built-in Mathematica Symbol) Log2[x] gives the base-2 logarithm of x.
MarcumQ
(Built-in Mathematica Symbol) MarcumQ[m, a, b] gives Marcum's Q function Q_m (a, b).MarcumQ[m, a, b_0, b_1] gives Marcum's Q function Q_m (a, b_0) - Q_m (a, b_1).
SpheroidalS1[n, m, \[Gamma], z] gives the radial spheroidal function S_n^m, (1)(\[Gamma], z) of the first kind.
TakeWhile[list, crit] gives elements e_i from the beginning of list, continuing so long as crit[e_i] is True.
UniformGraphDistribution[n, m] represents a uniform graph distribution on n-vertex, m-edge graphs.
DirectedGraph[g] gives a directed graph from the undirected graph g.DirectedGraph[g, conv] gives a directed graph using the conversion conv.