Even with "Newton methods" where the local model is based on the actual Hessian, unless you are close to a root or minimum, the model step may not bring you any closer to the ...

The systems of equations that govern certain phenomena (in electrical circuits, chemical kinetics, etc.) contain a combination of differential equations and algebraic ...

MeanShift[list, d] replaces each element in list by the mean of the values of all elements that differ by less than d.

Thinning[image] finds the skeletons of foreground regions in image by applying morphological thinning until convergence.Thinning[image, n] performs n iterations of ...

A Diophantine polynomial system is an expression constructed with polynomial equations and inequalities combined using logical connectives and quantifiers where the variables ...

TimeConstraint is an option for various algorithmic functions which specifies how long to spend trying a particular transformation or part of an algorithm.

All the functionality in DiscreteMath`Combinatorica` is available in the newly created Combinatorica Package.

Numerical algorithms for constrained nonlinear optimization can be broadly categorized into gradient-based methods and direct search methods. Gradient-based methods use first ...

Projection[u, v] finds the projection of the vector u onto the vector v.Projection[u, v, f] finds projections with respect to the inner product function f.

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