From 112fedd17bcf6e9829c21bb2eeccd2d85469f3e8 Mon Sep 17 00:00:00 2001
From: Christoph Ruegg <git@cdrnet.ch>
Date: Sun, 14 Oct 2018 14:48:22 +0200
Subject: [PATCH] FindMinimum: add two Nelder-Mead overloads for simpler usage
 with existing two and three argument functions #597

---
 src/Numerics/FindMinimum.cs | 22 ++++++++++++++++++++++
 1 file changed, 22 insertions(+)

diff --git a/src/Numerics/FindMinimum.cs b/src/Numerics/FindMinimum.cs
index b34c824e..b37bcfcd 100644
--- a/src/Numerics/FindMinimum.cs
+++ b/src/Numerics/FindMinimum.cs
@@ -46,6 +46,28 @@ namespace MathNet.Numerics
             return result.MinimizingPoint;
         }
 
+        /// <summary>
+        /// Find vector x that minimizes the function f(x) using the Nelder-Mead Simplex algorithm.
+        /// For more options and diagnostics consider to use <see cref="NelderMeadSimplex"/> directly.
+        /// </summary>
+        public static Tuple<double, double> OfFunction(Func<double, double, double> function, double initialGuess0, double initialGuess1, double tolerance = 1e-8, int maxIterations = 1000)
+        {
+            var objective = ObjectiveFunction.Value(v => function(v[0], v[1]));
+            var result = NelderMeadSimplex.Minimum(objective, CreateVector.Dense(new[] { initialGuess0, initialGuess1 }), tolerance, maxIterations);
+            return Tuple.Create(result.MinimizingPoint[0], result.MinimizingPoint[1]);
+        }
+
+        /// <summary>
+        /// Find vector x that minimizes the function f(x) using the Nelder-Mead Simplex algorithm.
+        /// For more options and diagnostics consider to use <see cref="NelderMeadSimplex"/> directly.
+        /// </summary>
+        public static Tuple<double, double, double> OfFunction(Func<double, double, double, double> function, double initialGuess0, double initialGuess1, double initialGuess2, double tolerance = 1e-8, int maxIterations = 1000)
+        {
+            var objective = ObjectiveFunction.Value(v => function(v[0], v[1], v[2]));
+            var result = NelderMeadSimplex.Minimum(objective, CreateVector.Dense(new[] { initialGuess0, initialGuess1, initialGuess2 }), tolerance, maxIterations);
+            return Tuple.Create(result.MinimizingPoint[0], result.MinimizingPoint[1], result.MinimizingPoint[2]);
+        }
+
         /// <summary>
         /// Find vector x that minimizes the function f(x) using the Nelder-Mead Simplex algorithm.
         /// For more options and diagnostics consider to use <see cref="NelderMeadSimplex"/> directly.