Minimize
✖
Minimize
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==rhs equations lhs>rhs, lhs≥rhs, lhs<rhs, lhs≤rhs inequalities (LessEqual,…) lhsrhs, lhsrhs, lhsrhs, lhsrhs vector inequalities (VectorLessEqual,…) Exists[…], ForAll[…] quantified conditions {x,y,…}∈rdom region or domain specification - Minimize[{f,cons},x∈rdom] is effectively equivalent to Minimize[{f,cons∧x∈rdom},x].
- For x∈rdom, the different coordinates can be referred to using Indexed[x,i].
- Possible domains rdom include:
-
Reals real scalar variable Integers integer 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 allBasic Examples (5)Summary of the most common use cases
Minimize a univariate function:

https://wolfram.com/xid/0bn5wuy-faqf4h

Minimize a multivariate function:

https://wolfram.com/xid/0bn5wuy-b6nuhh

Minimize a function subject to constraints:

https://wolfram.com/xid/0bn5wuy-fcm1i7

A minimization problem containing parameters:

https://wolfram.com/xid/0bn5wuy-65b19

Minimize a function over a geometric region:

https://wolfram.com/xid/0bn5wuy-ewyjra


https://wolfram.com/xid/0bn5wuy-bema4a

Scope (36)Survey of the scope of standard use cases
Basic Uses (7)
Minimize over the unconstrained reals:

https://wolfram.com/xid/0bn5wuy-86qsf

Minimize subject to constraints
:

https://wolfram.com/xid/0bn5wuy-edj208

Constraints may involve arbitrary logical combinations:

https://wolfram.com/xid/0bn5wuy-dtv7r7


https://wolfram.com/xid/0bn5wuy-pjuvi



https://wolfram.com/xid/0bn5wuy-jajckq


The infimum value may not be attained:

https://wolfram.com/xid/0bn5wuy-fbfbh6


Use a vector variable and a vector inequality:

https://wolfram.com/xid/0bn5wuy-lu8fwi

Univariate Problems (7)
Unconstrained univariate polynomial minimization:

https://wolfram.com/xid/0bn5wuy-dhud3y

Constrained univariate polynomial minimization:

https://wolfram.com/xid/0bn5wuy-bp80ai


https://wolfram.com/xid/0bn5wuy-or0am7

Analytic functions over bounded constraints:

https://wolfram.com/xid/0bn5wuy-cm5gkd


https://wolfram.com/xid/0bn5wuy-b1wc7x


https://wolfram.com/xid/0bn5wuy-z7foj



https://wolfram.com/xid/0bn5wuy-jpja8l


https://wolfram.com/xid/0bn5wuy-ch1ske

Combination of trigonometric functions with commensurable periods:

https://wolfram.com/xid/0bn5wuy-pbsb7r

Combination of periodic functions with incommensurable periods:

https://wolfram.com/xid/0bn5wuy-bqws15



https://wolfram.com/xid/0bn5wuy-3ogx


https://wolfram.com/xid/0bn5wuy-e9jn5u

Unconstrained problems solvable using function property information:

https://wolfram.com/xid/0bn5wuy-es0ujg


https://wolfram.com/xid/0bn5wuy-jxi0j

Multivariate Problems (9)
Multivariate linear constrained minimization:

https://wolfram.com/xid/0bn5wuy-cemla

Linear-fractional constrained minimization:

https://wolfram.com/xid/0bn5wuy-lr473t

Unconstrained polynomial minimization:

https://wolfram.com/xid/0bn5wuy-czwmlc

Constrained polynomial optimization can always be solved:

https://wolfram.com/xid/0bn5wuy-gzq2vq

The minimum value may not be attained:

https://wolfram.com/xid/0bn5wuy-byn0ry


The objective function may be unbounded:

https://wolfram.com/xid/0bn5wuy-i7gioe


There may be no points satisfying the constraints:

https://wolfram.com/xid/0bn5wuy-edzan1


Quantified polynomial constraints:

https://wolfram.com/xid/0bn5wuy-bj2pwq


https://wolfram.com/xid/0bn5wuy-dsj2qz

Bounded transcendental minimization:

https://wolfram.com/xid/0bn5wuy-pc6y7


https://wolfram.com/xid/0bn5wuy-cgyyk8


https://wolfram.com/xid/0bn5wuy-81pld6

Minimize convex objective function such that
is positive semidefinite and
:

https://wolfram.com/xid/0bn5wuy-ml87f0

Plot the region and the minimizing point:

https://wolfram.com/xid/0bn5wuy-5jo4bk

Parametric Problems (4)
Parametric linear optimization:

https://wolfram.com/xid/0bn5wuy-ds69uj

The minimum value is a continuous function of parameters:

https://wolfram.com/xid/0bn5wuy-hbs678

Parametric quadratic optimization:

https://wolfram.com/xid/0bn5wuy-8l1oto

The minimum value is a continuous function of parameters:

https://wolfram.com/xid/0bn5wuy-cgw39

Unconstrained parametric polynomial minimization:

https://wolfram.com/xid/0bn5wuy-hvvtn9

Constrained parametric polynomial minimization:

https://wolfram.com/xid/0bn5wuy-e7xyfo

Optimization over Integers (3)

https://wolfram.com/xid/0bn5wuy-ylokw


https://wolfram.com/xid/0bn5wuy-0kjmh



https://wolfram.com/xid/0bn5wuy-lzeg4t


https://wolfram.com/xid/0bn5wuy-b4esd5

Polynomial minimization over the integers:

https://wolfram.com/xid/0bn5wuy-i09s0l

Optimization over Regions (6)

https://wolfram.com/xid/0bn5wuy-i9nmj9

https://wolfram.com/xid/0bn5wuy-hkqjtu


https://wolfram.com/xid/0bn5wuy-otv084

Find the minimum distance between two regions:

https://wolfram.com/xid/0bn5wuy-dkte2m

https://wolfram.com/xid/0bn5wuy-khhnmt


https://wolfram.com/xid/0bn5wuy-bvatmu

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

https://wolfram.com/xid/0bn5wuy-ho0zb

https://wolfram.com/xid/0bn5wuy-c896h8


https://wolfram.com/xid/0bn5wuy-dy0urb

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

https://wolfram.com/xid/0bn5wuy-fxoyak

https://wolfram.com/xid/0bn5wuy-h8k62r


https://wolfram.com/xid/0bn5wuy-m75xbi

Using Circumsphere gives the same result directly:

https://wolfram.com/xid/0bn5wuy-ccn5a7

Use to specify that
is a vector in
:

https://wolfram.com/xid/0bn5wuy-e7unye

https://wolfram.com/xid/0bn5wuy-bfw719

Find the minimum distance between two regions:

https://wolfram.com/xid/0bn5wuy-kgd51l

https://wolfram.com/xid/0bn5wuy-cjdzl7


https://wolfram.com/xid/0bn5wuy-ifh0j0

Options (1)Common values & functionality for each option
WorkingPrecision (1)
Finding the exact solution takes a long time:

https://wolfram.com/xid/0bn5wuy-dt4zl

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

https://wolfram.com/xid/0bn5wuy-c5mizn

Applications (10)Sample problems that can be solved with this function
Basic Applications (3)
Find the minimal perimeter among rectangles with a unit area:

https://wolfram.com/xid/0bn5wuy-wtuty

Find the minimal perimeter among triangles with a unit area:

https://wolfram.com/xid/0bn5wuy-jayfl1

https://wolfram.com/xid/0bn5wuy-bx6cxm

The minimal perimeter triangle is equilateral:

https://wolfram.com/xid/0bn5wuy-m0jx

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

https://wolfram.com/xid/0bn5wuy-mcgw7a

Assuming a particular relationship between the and
parameters:

https://wolfram.com/xid/0bn5wuy-h6oc0

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[]:

https://wolfram.com/xid/0bn5wuy-bbe5gq

https://wolfram.com/xid/0bn5wuy-ebjkmb


https://wolfram.com/xid/0bn5wuy-d8p3tv

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

https://wolfram.com/xid/0bn5wuy-bi7hqn

https://wolfram.com/xid/0bn5wuy-bfqxai


https://wolfram.com/xid/0bn5wuy-hfmqh

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

https://wolfram.com/xid/0bn5wuy-dj6j8q

https://wolfram.com/xid/0bn5wuy-g49fxz


https://wolfram.com/xid/0bn5wuy-jz2mh

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

https://wolfram.com/xid/0bn5wuy-jqaty

https://wolfram.com/xid/0bn5wuy-dfalqn


https://wolfram.com/xid/0bn5wuy-e5f7z2

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:

https://wolfram.com/xid/0bn5wuy-ft5pzx

https://wolfram.com/xid/0bn5wuy-bsjb93


https://wolfram.com/xid/0bn5wuy-jze3u8

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

https://wolfram.com/xid/0bn5wuy-ogx39

https://wolfram.com/xid/0bn5wuy-fggxwj


https://wolfram.com/xid/0bn5wuy-d7lqct

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[]:

https://wolfram.com/xid/0bn5wuy-c10aaw

https://wolfram.com/xid/0bn5wuy-jhcnbu


https://wolfram.com/xid/0bn5wuy-jdkw0n

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

https://wolfram.com/xid/0bn5wuy-b0ca3

https://wolfram.com/xid/0bn5wuy-et09g2


https://wolfram.com/xid/0bn5wuy-bpix6d

Properties & Relations (6)Properties of the function, and connections to other functions
Minimize gives an exact global minimum of the objective function:

https://wolfram.com/xid/0bn5wuy-c3l3pu

https://wolfram.com/xid/0bn5wuy-z9fmn


https://wolfram.com/xid/0bn5wuy-dxhraz

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

https://wolfram.com/xid/0bn5wuy-kxmpp


https://wolfram.com/xid/0bn5wuy-ffnzus

FindMinimum finds local minima depending on the starting point:

https://wolfram.com/xid/0bn5wuy-ddl886


https://wolfram.com/xid/0bn5wuy-jjukrq

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

https://wolfram.com/xid/0bn5wuy-d7nsku


https://wolfram.com/xid/0bn5wuy-qmgbx

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

https://wolfram.com/xid/0bn5wuy-l7yvm2

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

https://wolfram.com/xid/0bn5wuy-g84p9r


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

https://wolfram.com/xid/0bn5wuy-gqziww


Minimize can solve linear programming problems:

https://wolfram.com/xid/0bn5wuy-mm3mtp

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

https://wolfram.com/xid/0bn5wuy-i8n5ly

https://wolfram.com/xid/0bn5wuy-b7q2kw

This computes the minimum value:

https://wolfram.com/xid/0bn5wuy-bu9vnc

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

https://wolfram.com/xid/0bn5wuy-f4g5uc

https://wolfram.com/xid/0bn5wuy-lbd2cp


https://wolfram.com/xid/0bn5wuy-m854ft

Both can be computed using Minimize:

https://wolfram.com/xid/0bn5wuy-eb1ko5


https://wolfram.com/xid/0bn5wuy-if73ua

Use RegionBounds to compute the bounding box:

https://wolfram.com/xid/0bn5wuy-eqkvxp


https://wolfram.com/xid/0bn5wuy-jf4d0

Use Maximize and Minimize to compute the same bounds:

https://wolfram.com/xid/0bn5wuy-gkt1lb


https://wolfram.com/xid/0bn5wuy-ckoox0

Possible Issues (1)Common pitfalls and unexpected behavior
Minimize requires that all functions present in the input be real-valued:

https://wolfram.com/xid/0bn5wuy-due48b

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

https://wolfram.com/xid/0bn5wuy-mnsihk

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
]}
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
]}