In mathematical optimization, the ellipsoid method is an iterative method for minimizing convex functions. When specialized to solving feasible linear optimization problems with rational data, the ellipsoid method is an algorithm, which finds an optimal solution in a finite number of steps.
The ellipsoid method generates a sequence of ellipsoids whose volume uniformly decreases at every step, thus enclosing a minimizer of a convex function.
Read more about Ellipsoid Method: History, Description, Unconstrained Minimization, Inequality-Constrained Minimization, Performance
Famous quotes containing the word method:
““I have usually found that there was method in his madness.”
“Some folk might say there was madness in his method.””
—Sir Arthur Conan Doyle (1859–1930)