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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
This paper presents the development of an adaptive state estimator and an output controller based on the attractive ellipsoid… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2011
2011
Magnetic compass is widely used to indicate the heading of vehicle by measuring the Earth's magnetic field. However, it suffers… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2009
2009
In this work, we extend the ellipsoid method, which was originally designed for convex optimization, for online learning. The key… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
The design and optimization of multicarrier communications systems often involve a maximization of the total throughput subject… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In this paper, a sufficient condition for a quadric surface to be an ellipsoid has been developed and a closed-form solution for… (More)
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present a practical algorithm for computing the minimum-volume n-dimensional ellipsoid that must contain m given points a1 am… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Ellipsoids are important primitives used in visualization and modeling, where often a larger number of ellipsoids have to be… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1984
Highly Cited
1984
We present a new polynomial-time algorithm for linear programming. The running-time of this algorithm is <italic>O</italic… (More)
Is this relevant?
Highly Cited
1981
Highly Cited
1981
L. G. Khachiyan recently published a polynomial algorithm to check feasibility of a system of linear inequalities. The method is… (More)
Is this relevant?