Search Results - person:"Laurent, Monique"

Semidefinite approximations for bicliques and bi-independent pairs

Laurent, Monique; Polak, Sven; Vargas, Luis - In: Mathematics of operations research 50 (2025) 1, pp. 537-572

Persistent link: https://www.econbiz.de/10015211748

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

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

Comparison of Lasserre's measure-based bounds for polynomial optimization to bounds obtained by simulated annealing

Klerk, Etienne de; Laurent, Monique - In: Mathematics of operations research 43 (2018) 4, pp. 1317-1325

Persistent link: https://www.econbiz.de/10011957064

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

Hidden Convexity in Partially Separable Optimization

Ben-Tal, Aharon - 2011

The paper identifies classes of nonconvex optimization problems whose convex relaxations have optimal solutions which at the same time are global optimal solutions of the original nonconvex problems. Such a hidden convexity property was so far limited to quadratically constrained quadratic...

Persistent link: https://www.econbiz.de/10013123787

Handelman’s hierarchy for the maximum stable set problem

Laurent, Monique; Sun, Zhao - In: Journal of Global Optimization 60 (2014) 3, pp. 393-423

The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over the (Boolean) hypercube. We investigate a hierarchy of linear programming relaxations for this problem, based on a...

Persistent link: https://www.econbiz.de/10010938216

Hidden convexity in partially separable optimization

Ben-Tal, Aharon; Hertog, Dirk den; Laurent, Monique - 2011

Persistent link: https://www.econbiz.de/10009156483

Computing the Grotendieck constant of some graph classes

Laurent, Monique; Varvitsiotis, A. - In: Operations research letters 39 (2011) 6, pp. 452-456

Persistent link: https://www.econbiz.de/10009404686

Block-diagonal semidefinite programming hierarchies for 0/1 programming

Gvozdenović, Nebojša; Laurent, Monique; Vallentin, Frank - In: Operations research letters 37 (2009) 1, pp. 27-31

Persistent link: https://www.econbiz.de/10003846191