Handbook on Semidefinite, Conic and Polynomial Optimization

By Miguel F. Anjos, Jean B. Lasserre. 2012

481 citations recorded by the source corpus.

Subfields: Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/6b9d429bbb92ff1fc7138ff827c9e300a385b886

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Numerical Analysis

1. Rahul Mazumder
2. Dimitris J. Bertsimas
3. Martin S. Copenhaver
4. Santosh Srinivas Vempala
5. Robert Tibshirani
6. Blaine Nelson

Citations in the corpus

• Sums of squares of polynomials with rational coefficients (2012, unknown): “The background for the question comes from semidefinite programming (see e.g. [22], [7], [15], [1]) and more specifically, from polynomial optimization.”
• Certifiably Optimal Low Rank Factor Analysis (2016, background): “There is also recent work in complementarity constraints literature (Bai et al., 2014) which connects rank-constrained optimization problems to copositive optimization (Burer, 2012).”