book chapter · 2006

The Randomized Ellipsoid Algorithm for Constrained Robust Least Squares Problems

Cited by 3Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

Kanev, S., & Verhaegen, M. (2006). The Randomized Ellipsoid Algorithm for Constrained Robust Least Squares Problems. https://doi.org/10.1007/1-84628-095-8_8

MLA 9

Kanev, Stoyan, and Michel Verhaegen. “The Randomized Ellipsoid Algorithm for Constrained Robust Least Squares Problems.” 2006, pp. 223–42, https://doi.org/10.1007/1-84628-095-8_8.

Chicago

Kanev, Stoyan, and Michel Verhaegen. 2006. “The Randomized Ellipsoid Algorithm for Constrained Robust Least Squares Problems.” https://doi.org/10.1007/1-84628-095-8_8.

Harvard

Kanev, S. and Verhaegen, M. (2006) ‘The Randomized Ellipsoid Algorithm for Constrained Robust Least Squares Problems’. Available at: https://doi.org/10.1007/1-84628-095-8_8.

BibTeX

@incollection{kanev2006randomized,
  title = {{The Randomized Ellipsoid Algorithm for Constrained Robust Least Squares Problems}},
  author = {Kanev, Stoyan and Verhaegen, Michel},
  pages = {223--242},
  year = {2006},
  doi = {10.1007/1-84628-095-8_8}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

The Randomized Ellipsoid Algorithm for Constrained Robust Least Squares Problems

Abstract

Cite this paper

Optimized ellipsoid algorithm for LMI feasibility problems

On a Variant of the Ellipsoid Method: Using Simplices instead of Ellipsoids