WOLFRAM

Minimize[f,x]

minimizes f symbolically with respect to x.

Minimize[f,{x,y,}]

minimizes f symbolically with respect to x, y, .

Minimize[{f,cons},{x,y,}]

minimizes f symbolically subject to the constraints cons.

Minimize[,xrdom]

constrains x to be in the region or domain rdom.

Minimize[,,dom]

constrains variables to the domain dom, typically Reals or Integers.

Details and Options

  • Minimize is also known as infimum, symbolic optimization and global optimization (GO).
  • Minimize finds the global minimum of f subject to the constraints given.
  • Minimize is typically used to find the smallest possible values given constraints. In different areas, this may be called the best strategy, best fit, best configuration and so on.
  • Minimize returns a list of the form {fmin,{x->xmin,y->ymin,}}.
  • If f and cons are linear or polynomial, Minimize will always find a global minimum.
  • The constraints cons can be any logical combination of:
  • lhs==rhsequations
    lhs>rhs, lhsrhs, lhs<rhs, lhsrhsinequalities (LessEqual,)
    lhsrhs, lhsrhs, lhsrhs, lhsrhsvector inequalities (VectorLessEqual,)
    Exists[], ForAll[]quantified conditions
    {x,y,}rdomregion or domain specification
  • Minimize[{f,cons},xrdom] is effectively equivalent to Minimize[{f,consxrdom},x].
  • For xrdom, the different coordinates can be referred to using Indexed[x,i].
  • Possible domains rdom include:
  • Realsreal scalar variable
    Integersinteger scalar variable
    Vectors[n,dom]vector variable in
    Matrices[{m,n},dom]matrix variable in
    vector variable restricted to the geometric region
  • By default, all variables are assumed to be real.
  • Minimize will return exact results if given exact input. With approximate input, it automatically calls NMinimize.
  • Minimize will return the following forms:
  • {fmin,{xxmin,}}finite minimum
    {,{xIndeterminate,}}infeasible, i.e. the constraint set is empty
    {-,{xxmin,}}unbounded, i.e. the values of f can be arbitrarily small
  • If the minimum is achieved only infinitesimally outside the region defined by the constraints, or only asymptotically, Minimize will return the infimum and the closest specifiable point.
  • Even if the same minimum is achieved at several points, only one is returned.
  • N[Minimize[]] calls NMinimize for optimization problems that cannot be solved symbolically.
  • Minimize[f,x,WorkingPrecision->n] uses n digits of precision while computing a result. »

Examples

open allclose all

Basic Examples  (5)Summary of the most common use cases

Minimize a univariate function:

Out[1]=1

Minimize a multivariate function:

Out[1]=1

Minimize a function subject to constraints:

Out[1]=1

A minimization problem containing parameters:

Out[1]=1

Minimize a function over a geometric region:

Out[1]=1

Plot it:

Out[2]=2

Scope  (36)Survey of the scope of standard use cases

Basic Uses  (7)

Minimize over the unconstrained reals:

Out[1]=1

Minimize subject to constraints :

Out[1]=1

Constraints may involve arbitrary logical combinations:

Out[1]=1

An unbounded problem:

Out[1]=1

An infeasible problem:

Out[1]=1

The infimum value may not be attained:

Out[1]=1

Use a vector variable and a vector inequality:

Out[1]=1

Univariate Problems  (7)

Unconstrained univariate polynomial minimization:

Out[1]=1

Constrained univariate polynomial minimization:

Out[1]=1

Exp-log functions:

Out[1]=1

Analytic functions over bounded constraints:

Out[1]=1
Out[2]=2
Out[3]=3
Out[4]=4

Periodic functions:

Out[1]=1

Combination of trigonometric functions with commensurable periods:

Out[2]=2

Combination of periodic functions with incommensurable periods:

Out[3]=3
Out[4]=4

Piecewise functions:

Out[1]=1

Unconstrained problems solvable using function property information:

Out[1]=1
Out[2]=2

Multivariate Problems  (9)

Multivariate linear constrained minimization:

Out[1]=1

Linear-fractional constrained minimization:

Out[1]=1

Unconstrained polynomial minimization:

Out[1]=1

Constrained polynomial optimization can always be solved:

Out[1]=1

The minimum value may not be attained:

Out[2]=2

The objective function may be unbounded:

Out[3]=3

There may be no points satisfying the constraints:

Out[4]=4

Quantified polynomial constraints:

Out[5]=5

Algebraic minimization:

Out[1]=1

Bounded transcendental minimization:

Out[1]=1

Piecewise minimization:

Out[1]=1

Convex minimization:

Out[1]=1

Minimize convex objective function such that is positive semidefinite and :

Out[1]=1

Plot the region and the minimizing point:

Out[2]=2

Parametric Problems  (4)

Parametric linear optimization:

Out[1]=1

The minimum value is a continuous function of parameters:

Out[2]=2

Parametric quadratic optimization:

Out[1]=1

The minimum value is a continuous function of parameters:

Out[2]=2

Unconstrained parametric polynomial minimization:

Out[1]=1

Constrained parametric polynomial minimization:

Out[1]=1

Optimization over Integers  (3)

Univariate problems:

Out[1]=1
Out[2]=2
Out[3]=3

Integer linear programming:

Out[1]=1

Polynomial minimization over the integers:

Out[1]=1

Optimization over Regions  (6)

Minimize over a region:

Out[3]=3

Plot it:

Out[4]=4

Find the minimum distance between two regions:

Out[2]=2

Plot it:

Out[3]=3

Find the minimum such that the triangle and ellipse still intersect:

Out[2]=2

Plot it:

Out[3]=3

Find the disk of minimum radius that contains the given three points:

Out[2]=2

Plot it:

Out[3]=3

Using Circumsphere gives the same result directly:

Out[4]=4

Use to specify that is a vector in :

Out[2]=2

Find the minimum distance between two regions:

Out[2]=2

Plot it:

Out[3]=3

Options  (1)Common values & functionality for each option

WorkingPrecision  (1)

Finding the exact solution takes a long time:

Out[1]=1

With WorkingPrecision->100, you get an exact minimum value, but it might be incorrect:

Out[2]=2

Applications  (10)Sample problems that can be solved with this function

Basic Applications  (3)

Find the minimal perimeter among rectangles with a unit area:

Out[1]=1

Find the minimal perimeter among triangles with a unit area:

Out[2]=2

The minimal perimeter triangle is equilateral:

Out[3]=3

Find the distance to a parabola from a point on its axis:

Out[1]=1

Assuming a particular relationship between the and parameters:

Out[2]=2

Geometric Distances  (6)

The shortest distance of a point in a region to a given point p and a point q realizing the shortest distance is given by Minimize[EuclideanDistance[p,q],q]. Find the shortest distance and the nearest point to {1,1} in the unit Disk[]:

Out[4]=4

Plot it:

Out[5]=5

Find the shortest distance and the nearest point to {1,3/4} in the standard unit simplex Simplex[2]:

Out[2]=2

Plot it:

Out[3]=3

Find the shortest distance and the nearest point to {1,1,1} in the standard unit sphere Sphere[]:

Out[2]=2

Plot it:

Out[3]=3

Find the shortest distance and the nearest point to {-1/3,1/3,1/3} in the standard unit simplex Simplex[3]:

Out[2]=2

Plot it:

Out[3]=3

The nearest points p and q and their distance can be found through Minimize[EuclideanDistance[p,q],{p,q}]. Find the nearest points in Disk[{0,0}] and Rectangle[{3,3}] and the distance between them:

Out[2]=2

Plot it:

Out[3]=3

Find the nearest points in Line[{{0,0,0},{1,1,1}}] and Ball[{5,5,0},1] and the distance between them:

Out[2]=2

Plot it:

Out[3]=3

Geometric Centers  (1)

If n is a region that is full dimensional, then the Chebyshev center is the center of the largest inscribed ball of . The center and the radius of the largest inscribed ball of can be found through Minimize[SignedRegionDistance[,p], p]. Find the Chebyshev center and the radius of the largest inscribed ball for Rectangle[]:

Out[2]=2
Out[3]=3

Find the Chebyshev center and the radius of the largest inscribed ball for Triangle[]:

Out[5]=5
Out[6]=6

Properties & Relations  (6)Properties of the function, and connections to other functions

Minimize gives an exact global minimum of the objective function:

Out[2]=2
Out[3]=3

NMinimize attempts to find a global minimum numerically, but may find a local minimum:

Out[4]=4
Out[5]=5

FindMinimum finds local minima depending on the starting point:

Out[6]=6
Out[7]=7

The minimum point satisfies the constraints, unless messages say otherwise:

Out[1]=1
Out[2]=2

The given point minimizes the distance from the point {2,}:

Out[3]=3

When the minimum is not attained, Minimize may give a point on the boundary:

Out[1]=1

Here the objective function tends to the minimum value when y tends to infinity:

Out[2]=2

Minimize can solve linear programming problems:

Out[1]=1

LinearProgramming can be used to solve the same problem given in matrix notation:

Out[3]=3

This computes the minimum value:

Out[4]=4

Use RegionDistance and RegionNearest to compute the distance and the nearest point:

Out[2]=2
Out[3]=3

Both can be computed using Minimize:

Out[4]=4
Out[5]=5

Use RegionBounds to compute the bounding box:

Out[1]=1
Out[2]=2

Use Maximize and Minimize to compute the same bounds:

Out[3]=3
Out[4]=4

Possible Issues  (1)Common pitfalls and unexpected behavior

Minimize requires that all functions present in the input be real-valued:

Out[1]=1

Values for which the equation is satisfied but the square roots are not real are disallowed:

Out[2]=2
Wolfram Research (2003), Minimize, Wolfram Language function, https://reference.wolfram.com/language/ref/Minimize.html (updated 2021).
Wolfram Research (2003), Minimize, Wolfram Language function, https://reference.wolfram.com/language/ref/Minimize.html (updated 2021).

Text

Wolfram Research (2003), Minimize, Wolfram Language function, https://reference.wolfram.com/language/ref/Minimize.html (updated 2021).

Wolfram Research (2003), Minimize, Wolfram Language function, https://reference.wolfram.com/language/ref/Minimize.html (updated 2021).

CMS

Wolfram Language. 2003. "Minimize." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2021. https://reference.wolfram.com/language/ref/Minimize.html.

Wolfram Language. 2003. "Minimize." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2021. https://reference.wolfram.com/language/ref/Minimize.html.

APA

Wolfram Language. (2003). Minimize. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/Minimize.html

Wolfram Language. (2003). Minimize. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/Minimize.html

BibTeX

@misc{reference.wolfram_2025_minimize, author="Wolfram Research", title="{Minimize}", year="2021", howpublished="\url{https://reference.wolfram.com/language/ref/Minimize.html}", note=[Accessed: 16-April-2025 ]}

@misc{reference.wolfram_2025_minimize, author="Wolfram Research", title="{Minimize}", year="2021", howpublished="\url{https://reference.wolfram.com/language/ref/Minimize.html}", note=[Accessed: 16-April-2025 ]}

BibLaTeX

@online{reference.wolfram_2025_minimize, organization={Wolfram Research}, title={Minimize}, year={2021}, url={https://reference.wolfram.com/language/ref/Minimize.html}, note=[Accessed: 16-April-2025 ]}

@online{reference.wolfram_2025_minimize, organization={Wolfram Research}, title={Minimize}, year={2021}, url={https://reference.wolfram.com/language/ref/Minimize.html}, note=[Accessed: 16-April-2025 ]}