The following pages link to Monique Laurent (Q344892):
Displaying 35 items.
- On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings (Q4594657) (← links)
- (Q4602276) (← links)
- On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex (Q4681650) (← links)
- (Q4840771) (← links)
- On the Facial Structure of the Set of Correlation Matrices (Q4891696) (← links)
- (Q4894976) (← links)
- Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph (Q5072588) (← links)
- Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube (Q5108258) (← links)
- (Q5116996) (← links)
- Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling (Q5152478) (← links)
- Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing (Q5219701) (← links)
- (Q5278025) (← links)
- (Q5292090) (← links)
- Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition (Q5351862) (← links)
- Bound-Constrained Polynomial Optimization Using Only Elementary Calculations (Q5359122) (← links)
- Revisiting two theorems of Curto and Fialkow on moment matrices (Q5461308) (← links)
- (Q5465121) (← links)
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization (Q5470206) (← links)
- An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution (Q5502241) (← links)
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming (Q5704137) (← links)
- Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope (Q5704154) (← links)
- Geometry of cuts and metrics (Q5902168) (← links)
- The cut cone. III: On the role of triangle facets (Q5905548) (← links)
- Geometry of cuts and metrics (Q5906765) (← links)
- Sum-of-squares hierarchies for binary polynomial optimization (Q5918420) (← links)
- The cut cone. III: On the role of triangle facets (Q5919846) (← links)
- Sum-of-squares hierarchies for binary polynomial optimization (Q5925640) (← links)
- Equilateral dimension of the rectilinear space (Q5926319) (← links)
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks (Q6126663) (← links)
- Exactness of Parrilo’s Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph (Q6199282) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q6289805) (← links)
- An effective version of Schm\"udgen's Positivstellensatz for the hypercube (Q6378073) (← links)
- Semidefinite approximations for bicliques and biindependent pairs (Q6508868) (← links)
- An Overview of Convergence Rates for Sum of Squares Hierarchies in Polynomial Optimization (Q6739784) (← links)
- Moment-sos and spectral hierarchies for polynomial optimization on the sphere and quantum de Finetti theorems (Q6758597) (← links)
