Narrow search
Showing 1 - 6 of 6
Cover Image
Worst-case examples for Lasserre's measure-based hierarchy for polynomial optimization on the hypercube
Klerk, Etienne de; Laurent, Monique - In: Mathematics of operations research 45 (2020) 1, pp. 86-98
Persistent link: https://www.econbiz.de/10012183021
Cover Image
Bound-constrained polynomial optimization using only elementary calculations
Klerk, Etienne de; Lasserre, Jean B.; Laurent, Monique; … - In: Mathematics of operations research 42 (2017) 3, pp. 834-853
Persistent link: https://www.econbiz.de/10011742535
Cover Image
Exactness of parrilo's conic approximations for copositive matrices and associated low order bounds for the stability number of a graph
Laurent, Monique; Vargas, Luis Felipe - In: Mathematics of operations research 48 (2023) 2, pp. 1017-1043
Persistent link: https://www.econbiz.de/10014314973
Cover Image
Complexity analysis of a sampling-based interior point method for convex optimization
Badenbroek, Riley; Klerk, Etienne de - In: Mathematics of operations research 47 (2022) 1, pp. 779-811
Persistent link: https://www.econbiz.de/10013364947
Cover Image
Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
Laurent, Monique - In: Mathematics of operations research 28 (2003) 4, pp. 871-883
Persistent link: https://www.econbiz.de/10006417851
Cover Image
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming
Laurent, Monique - In: Mathematics of operations research 28 (2003) 3, pp. 470-496
Persistent link: https://www.econbiz.de/10006417965