Skip to search formSkip to main contentSkip to account menu

Ellipsoid method

Known as: Khachiyan's algorithm, Ellipsoidal method, Khachiyan's method 
In mathematical optimization, the ellipsoid method is an iterative method for minimizing convex functions. When specialized to solving feasible… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
In this research, we apply robust optimization (RO) to the problem of locating facilities in a network facing uncertain demand… 
Highly Cited
2010
Highly Cited
2010
In this paper we study the effect of false data injection attacks on state estimation carried over a sensor network monitoring a… 
Highly Cited
2005
Highly Cited
2005
We study the stochastic transportation-inventory network design problem involving one supplier and multiple retailers. Each… 
Highly Cited
2003
Highly Cited
2003
A classification is obtained of Borel measurable, GL(n) covariant, symmetric matrix valued valuations on the space of n… 
Highly Cited
2002
Highly Cited
2002
Let Y = (Yi)i∈I be a finite or countable sequence of independent Gaussian random variables of mean f = (fi)i∈I and common… 
Highly Cited
2000
Highly Cited
2000
Remote sensing techniques that utilize light detection and ranging (lidar) provide unique data on canopy geometry and subcanopy… 
Review
2000
Review
2000
Highly Cited
1991
Highly Cited
1991
The development of the algorithm is based on a set theoretic approach to regularization. Deterministic and/or statistical… 
Highly Cited
1989
Highly Cited
1989
  • P. M. Vaidya
  • 1989
  • Corpus ID: 29555809
An algorithm for minimizing a convex function over a convex set is given. The notion of a volumetric center of a polytope and a… 
Review
1981
Review
1981
In February 1979 a note by L. G. Khachiyan indicated how an ellipsoid method for linear programming can be implemented in…