Mathematica > Mathematics and Algorithms > Optimization >

FindArgMin

FindArgMin[f, x]
gives the position xmin of a local minimum of f.
FindArgMin[f, {x, x0}]
gives the position xmin of a local minimum of f, found by a search starting from the point x=x0.
FindArgMin[f, {{x, x0}, {y, y0}, ...}]
gives the position {xmin, ymin, ...} of a local minimum of a function of several variables.
FindArgMin[{f, cons}, {{x, x0}, {y, y0}, ...}]
gives the position of a local minimum subject to the constraints cons.
FindArgMin[{f, cons}, {x, y, ...}]
starts from a point within the region defined by the constraints.
  • If the starting point for a variable is given as a list, the values of the variable are taken to be lists with the same dimensions.
  • cons can contain equations, inequalities or logical combinations of these.
  • FindArgMin first localizes the values of all variables, then evaluates f with the variables being symbolic, and then repeatedly evaluates the result numerically.
  • FindArgMin[f, {x, x0, x1}] searches for a local minimum in f using x0 and x1 as the first two values of x, avoiding the use of derivatives.
  • FindArgMin[f, {x, x0, xmin, xmax}] searches for a local minimum, stopping the search if x ever gets outside the range xmin to xmax.
  • Except when f and cons are both linear, the results found by FindArgMin may correspond only to local, but not global, minima.
  • By default, all variables are assumed to be real.
  • For linear f and cons, xElementIntegers can be used to specify that a variable can take on only integer values.
Find a point {x} at which the univariate function 2x^2+3x-5 has a minimum:
In[1]:=
Click for copyable input
Out[1]=
 
Find a point {x, y} at which the function Sin[x]Sin[2y] has a minimum:
In[1]:=
Click for copyable input
Out[1]=
 
Find a point at which a function is a minimum subject to constraints:
In[1]:=
Click for copyable input
Out[1]=
New in 7
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team