Live briefing
Everything about Ellipsoid method
Iterative method for minimizing convex functions
In mathematical optimization, the ellipsoid method is an iterative method for minimizing convex functions over convex sets. The ellipsoid method generates a sequence of ellipsoids whose volume uniformly decreases at every step, thus enclosing a minimizer of a convex function. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Ellipsoid methodA 5-minute orientation
- Skim a recent paper: A Novel Interval Power Flow Method Based on Hybrid Box-Ellipsoid Uncertain SetsInfluential work since 2022
- Pick up a classic book: The exciting forces on fixed bodies in wavesThe most-reprinted book on the subject
- Read the landmark paper: The ellipsoid method and its consequences in combinatorial optimizationCited 1,359 times
- Go sideways: Interior-point methodA closely related topic
- Go sideways: Separation oracleA closely related topic
📖 Definitions
Noun An iterative method for optimizing convex functions over convex sets.
🏆 Landmark papers (most cited)
The ellipsoid method and its consequences in combinatorial optimization
Feature Article—The Ellipsoid Method: A Survey
A poly‐ellipsoid particle for non‐spherical discrete element method
Dynamic sliding mode control design using attracting ellipsoid method
Karmarkar's algorithm and the ellipsoid method
An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization
Calibration of triaxial magnetometer with ellipsoid fitting method
Drilling vibration reduction via attractive ellipsoid method
🆕 Influential since 2022
A Novel Interval Power Flow Method Based on Hybrid Box-Ellipsoid Uncertain Sets
Novel data-driven method for non-probabilistic uncertainty analysis of engineering structures based on ellipsoid model
An ellipsoid modelling method for discrete element simulation of wheat seeds
Robust fault detection method based on interval neural networks optimized by ellipsoid bundles
Research on Calibration Method of Triaxial Magnetometer Based on Improved PSO-Ellipsoid Fitting Algorithm
📚 Books worth reading
The exciting forces on fixed bodies in wavesJ. N. Newman · 1963
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Interior-point method Interior-point methods (also referred to as barrier methods or IPMs) are algorithms for solving linear and non-linear convex optimization problems. IPMs…
- Separation oracle A separation oracle (also called a cutting-plane oracle) is a concept in the mathematical theory of convex optimization. It is a method to describe a convex…
- Center-of-gravity method The center-of-gravity method is a theoretic algorithm for convex optimization. It can be seen as a generalization of the bisection method from one-dimensional…
- Penalty method In mathematical optimization, penalty methods are a certain class of algorithms for solving constrained optimization problems. A penalty method replaces…
- Algorithmic problems on convex sets Many problems in mathematical programming can be formulated as problems on convex sets or convex bodies. Six kinds of problems are particularly important:…
- Semidefinite programming Semidefinite programming (SDP) is a subfield of mathematical programming concerned with the optimization of a linear objective function (a user-specified…
- Approximation algorithm In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems…
- Line search In optimization, line search is a basic iterative approach to find a local minimum x ∗ {\displaystyle \mathbf {x} ^{*}} of an objective function f : R…