# FindMinimum [] methods [closed]

Which algorithm is used when we do not use the option Method of FindMinimum[] function.

FindMinimum[f,{x,x0}]

-

## closed as off-topic by J. M.♦Aug 20 '15 at 19:54

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question arises due to a simple mistake such as a trivial syntax error, incorrect capitalization, spelling mistake, or other typographical error and is unlikely to help any future visitors, or else it is easily found in the documentation." – J. M.
If this question can be reworded to fit the rules in the help center, please edit the question.

Please, try to use the documentation search or google before posting such elementary questions. Have you at least tried? The information you want can be found in the documentation center

• With Method->Automatic and two starting values, FindMinimum uses Brent's principal axis method. With one starting value for each variable, FindMinimum uses BFGS quasi-Newton methods, with a limited memory variant for large systems.

• If the function to be minimized is a sum of squares, FindMinimum uses the Levenberg-Marquardt method (Method->"LevenbergMarquardt").

• With constraints, FindMinimum uses interior point methods.

-
Indeed when one types "FindMinimum implementation" in the search bar it is the second hit for me. But perhaps they should have added a link to the implementation docs in the main entry. – Sjoerd C. de Vries Oct 23 '13 at 5:48