Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Monique Laurent - MaRDI portal

Monique Laurent

From MaRDI portal
(Redirected from Person:408439)
Person:344892

Available identifiers

zbMath Open laurent.moniqueDBLP94/3960WikidataQ25305641 ScholiaQ25305641MaRDI QIDQ344892

List of research outcomes





PublicationDate of PublicationType
Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks2024-04-09Paper
Exactness of Parrilo’s Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph2024-02-23Paper
An effective version of Schmüdgen's Positivstellensatz for the hypercube2023-03-24Paper
Sum-of-squares hierarchies for binary polynomial optimization2023-03-14Paper
Copositive matrices, sums of squares and the stability number of a graph2023-02-09Paper
On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices2022-07-26Paper
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere2022-06-14Paper
Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets2022-06-14Paper
Bounding the separable rank via polynomial optimization2022-06-01Paper
Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph2022-04-29Paper
Sum-of-squares hierarchies for binary polynomial optimization2021-12-21Paper
Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling2021-09-24Paper
An effective version of Schm\"udgen's Positivstellensatz for the hypercube2021-09-20Paper
Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization2021-08-11Paper
https://portal.mardi4nfdi.de/entity/Q51169962020-08-19Paper
A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis2020-07-07Paper
Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube2020-04-30Paper
Perfect elimination orderings for symmetric matrices2020-04-27Paper
Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing2020-03-12Paper
Lower bounds on matrix factorization ranks via noncommutative polynomial optimization2019-10-17Paper
On the linear extension complexity of stable set polytopes for perfect graphs2019-07-10Paper
The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure2018-09-28Paper
A Lex-BFS-based recognition algorithm for Robinsonian matrices2018-09-25Paper
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization2018-07-13Paper
https://portal.mardi4nfdi.de/entity/Q46022762018-01-09Paper
On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings2017-11-24Paper
https://portal.mardi4nfdi.de/entity/Q45890322017-11-06Paper
Bound-Constrained Polynomial Optimization Using Only Elementary Calculations2017-09-22Paper
Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition2017-08-31Paper
Lower bounds on matrix factorization ranks via noncommutative polynomial optimization2017-08-04Paper
https://portal.mardi4nfdi.de/entity/Q52780252017-07-12Paper
A structural characterization for certifying Robinsonian matrices2017-05-18Paper
Entanglement-Assisted Zero-Error Source-Channel Coding2017-04-28Paper
On the convergence rate of grid search for polynomial optimization over the simplex2017-04-05Paper
Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization2017-03-23Paper
Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization2017-03-10Paper
Matrices with high completely positive semidefinite rank2016-11-25Paper
The Approach of Moments for Polynomial Equations2016-04-26Paper
Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone2015-12-11Paper
A Lex-BFS-based recognition algorithm for Robinsonian matrices2015-09-21Paper
An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution2015-08-18Paper
An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex2015-06-19Paper
Handelman's hierarchy for the maximum stable set problem2014-12-11Paper
Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope2014-09-04Paper
A new graph parameter related to bounded rank positive semidefinite matrix completions2014-06-27Paper
Entanglement-Assisted Zero-Error Source-Channel Coding2014-06-11Paper
Positive semidefinite matrix completion, universal rigidity and the strong Arnold property2014-06-04Paper
Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint2013-09-13Paper
Moment matrices, border bases and real radical computation2013-03-11Paper
The Gram Dimension of a Graph2012-11-02Paper
A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs2012-06-26Paper
https://portal.mardi4nfdi.de/entity/Q28893012012-06-06Paper
Computing the Grothendieck constant of some graph classes2012-04-05Paper
https://portal.mardi4nfdi.de/entity/Q31131732012-02-08Paper
On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems2012-01-09Paper
Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube2011-03-21Paper
On Leonid Gurvits’s Proof for Permanents2011-01-25Paper
A generalized flat extension theorem for moment matrices2009-11-23Paper
Geometry of cuts and metrics2009-10-28Paper
Semidefinite characterization and computation of zero-dimensional real radical ideals2009-07-13Paper
A prolongation-projection algorithm for computing the finite real variety of an ideal2009-07-10Paper
The Operator $\Psi$ for the Chromatic Number of a Graph2009-05-27Paper
Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization2009-05-27Paper
Block-diagonal semidefinite programming hierarchies for 0/1 programming2009-02-23Paper
https://portal.mardi4nfdi.de/entity/Q36019892009-02-12Paper
https://portal.mardi4nfdi.de/entity/Q36019902009-02-12Paper
Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials2007-08-30Paper
https://portal.mardi4nfdi.de/entity/Q52920902007-06-19Paper
Semidefinite bounds for the stability number of a graph via sums of squares of polynomials2007-04-19Paper
Semidefinite representations for finite varieties2007-03-05Paper
Strengthened semidefinite programming bounds for codes2007-03-05Paper
A PTAS for the minimization of polynomials of fixed degree over the simplex2006-09-14Paper
Semidefinite Approximations for Global Unconstrained Polynomial Optimization2006-05-30Paper
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming2005-11-11Paper
Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope2005-11-11Paper
https://portal.mardi4nfdi.de/entity/Q54651212005-08-22Paper
Revisiting two theorems of Curto and Fialkow on moment matrices2005-07-26Paper
On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex2005-06-24Paper
On the sparsity order of a graph and its deficiency in chordality2002-06-25Paper
Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lovász--Schrijver Lift-and-Project Procedure2002-04-23Paper
Embedding into rectilinear spaces2001-11-27Paper
Equilateral dimension of the rectilinear space2001-10-15Paper
Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems2001-03-19Paper
Cycle bases for lattices of binary matroids with no Fano dual minor and their one-element extensions2000-06-25Paper
https://portal.mardi4nfdi.de/entity/Q44006381999-02-04Paper
https://portal.mardi4nfdi.de/entity/Q43983721998-07-19Paper
Connection between semidefinite relaxations of the max-cut and stable set problems1998-06-08Paper
Cuts, matrix completions and graph rigidity1998-05-25Paper
A connection between positive semidefinite and Euclidean distance matrix completion problems1998-05-04Paper
Geometry of cuts and metrics1997-07-01Paper
A minor-monotone graph parameter based on oriented matroids1997-06-10Paper
The real positive semidefinite completion problem for series-parallel graphs1997-05-11Paper
On the Facial Structure of the Set of Correlation Matrices1997-02-04Paper
One-third-integrality in the max-cut problem1997-02-03Paper
Gap inequalities for the cut polytope1996-10-29Paper
https://portal.mardi4nfdi.de/entity/Q48949761996-10-09Paper
Graphic vertices of the metric polytope1996-07-03Paper
Hilbert bases of cuts1996-07-02Paper
On a minor-monotone graph invariant1996-06-05Paper
Some new classes of facets for the equicut polytope1996-05-30Paper
A characterization of box \(\frac 1d\)-integral binary clutters1996-04-08Paper
Delaunay transformations of a Delaunay polytope1996-02-12Paper
Hypercube embedding of generalized bipartite metrics1995-10-03Paper
On a positive semidefinite relaxation of the cut polytope1995-07-24Paper
Applications of cut polyhedra. II1995-07-05Paper
Application of cut polyhedra. I1995-05-28Paper
https://portal.mardi4nfdi.de/entity/Q43208171995-05-18Paper
https://portal.mardi4nfdi.de/entity/Q48407711995-01-01Paper
The inequicut cone1994-12-01Paper
The hypermetric cone is polyhedral1994-12-01Paper
Collapsing and lifting for the cut cone1994-05-05Paper
\(\ell_ 1\)-rigid graphs1994-04-28Paper
https://portal.mardi4nfdi.de/entity/Q31371801994-04-04Paper
https://portal.mardi4nfdi.de/entity/Q31373701994-01-09Paper
The even and odd cut polytopes1993-12-20Paper
\((s,r;\mu )\)-nets and alternating forms graphs1993-10-24Paper
The cut cone. III: On the role of triangle facets1993-08-11Paper
Clique-Web Facets for Multicut Polytopes1993-03-01Paper
A characterization of knapsacks with the max-flow--min-cut property1993-01-16Paper
Extension operations for cuts1993-01-16Paper
Facets for the cut cone. I1993-01-16Paper
Facets for the cut cone. II: Clique-web inequalities1993-01-16Paper
The cut cone. III: On the role of triangle facets1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q39910001992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39749681992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39749691992-06-26Paper
Bouquets of geometric lattices: Some algebraic and topological aspects1992-06-25Paper
A generalization of antiwebs to independence systems and their canonical facets1989-01-01Paper
On the geometric structure of independence systems1989-01-01Paper
A characterization of matroidal systems of inequalities1988-01-01Paper
On the Facial Structure of Independence System Polyhedra1988-01-01Paper
Bouquets of maroids, d-injection geometries and diagrams1987-01-01Paper
Upper bounds for the cardinality of s-distances codes1986-01-01Paper
Semidefinite approximations for bicliques and biindependent pairsN/APaper

Research outcomes over time

This page was built for person: Monique Laurent