1986 …2020

Research output per year

If you made any changes in Pure these will be visible here soon.

Research Output

Filter
Article
2020

Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere

de Klerk, E. & Laurent, M., Jan 2020, In : Mathematical Programming .

Research output: Contribution to journalArticleScientificpeer-review

Open Access

Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets

Slot, L. & Laurent, M., Jan 2020, (Accepted/In press) In : Mathematical Programming .

Research output: Contribution to journalArticleScientificpeer-review

Worst-case examples for Lasserre's measure-based hierarchy for polynomial optimization on the hypercube

de Klerk, E. & Laurent, M., 2020, In : Mathematics of Operations Research. 45, 1, p. 86-98

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File
20 Downloads (Pure)
2019

Lower bounds on matrix factorization ranks via noncommutative polynomial optimization

Gribling, S., De Laat, D. & Laurent, M., Oct 2019, In : Foundations of Computational Mathematics. 19, 5, p. 1013-1070

Research output: Contribution to journalArticleScientificpeer-review

Open Access
2018

Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization

Gribling, S., de Laat, D. & Laurent, M., Jul 2018, In : Mathematical Programming . 170, 1, p. 5-42

Research output: Contribution to journalArticleScientificpeer-review

Open Access

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

de Klerk, E. & Laurent, M., Nov 2018, In : Mathematics of Operations Research. 43, 4, p. 1317-1325

Research output: Contribution to journalArticleScientificpeer-review

File
80 Downloads (Pure)
2017

A Lex-BFS-based recognition algorithm for Robinsonian matrices

Laurent, M. & Seminaroti, M., May 2017, In : Discrete Applied Mathematics. 222, p. 151-165

Research output: Contribution to journalArticleScientificpeer-review

A structural characterization for certifying robinsonian matrices

Laurent, M., Seminaroti, M. & Tanigawa, S., 5 May 2017, In : The Electronic Journal of Combinatorics: EJC. 24, 2, p. 1-22 22 p., P2.21.

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File
42 Downloads (Pure)

Bound-constrained polynomial optimization using only elementary calculations

de Klerk, E., Lasserre, J. B., Laurent, M. & Sun, Z., Aug 2017, In : Mathematics of Operations Research. 42, 3, p. 834-853

Research output: Contribution to journalArticleScientificpeer-review

Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization

de Klerk, E., Laurent, M. & Sun, Z., Mar 2017, In : Mathematical Programming . 162, 1, p. 363-392

Research output: Contribution to journalArticleScientificpeer-review

Improved convergence rates for Lasserre-type hierarchies of upper bounds for box-constrained polynomial optimization

de Klerk, E., Hess, R. & Laurent, M., 2017, In : SIAM Journal on Optimization. 27, 1, p. 346-367

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File
46 Downloads (Pure)

Matrices with high completely positive semidefinite rank

de Laat, D., Gribling, S. & Laurent, M., 15 Jan 2017, In : Linear Algebra and its Applications. 513, p. 122-148

Research output: Contribution to journalArticleScientificpeer-review

Open Access

On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings

Burgdorf, S., Laurent, M. & Piovesan, T., 1 Jan 2017, In : Electronic Journal of Linear Algebra. 32, p. 15-40 2.

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File
45 Downloads (Pure)

On the convergence rate of grid search for polynomial optimization over the simplex

de Klerk, E., Laurent, M., Sun, Z. & Vera Lizcano, J., Mar 2017, In : Optimization Letters. 11, 3, p. 597-608

Research output: Contribution to journalArticleScientificpeer-review

Perfect elimination orderings for symmetric matrices

Laurent, M. & Tanigawa, S., Nov 2017, In : Optimization Letters.

Research output: Contribution to journalArticleScientificpeer-review

Open Access

Similarity-first search: A new algorithm with application to Robinsonian matrix recognition

Laurent, M. & Seminaroti, M., 2017, In : SIAM Journal on Discrete Mathematics. 31, 3, p. 1765–1800

Research output: Contribution to journalArticleScientificpeer-review

2015

An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex

de Klerk, E., Laurent, M. & Sun, Z., Jul 2015, In : Mathematical Programming. 151, 2, p. 433-457 24 p.

Research output: Contribution to journalArticleScientificpeer-review

An error analysis for polynomial optimization over the simplex based on the multivariate hypergeometric distribution.

de Klerk, E., Laurent, M. & Sun, Z., 2015, In : SIAM Journal on Optimization. 25, 3, p. 1498-1514 17 p.

Research output: Contribution to journalArticleScientificpeer-review

Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone

Laurent, M. & Piovesan, T., 2015, In : SIAM Journal on Optimization. 25, 4, p. 2461-2493

Research output: Contribution to journalArticleScientificpeer-review

Entanglement-assisted zero-error source-channel coding

Briet, J., Buhrman, H., Laurent, M., Piovesan, T. & Scarpa, G., 16 Jan 2015, In : IEEE Transactions on Information Theory. 61, 2, p. 1124-1138

Research output: Contribution to journalArticleScientificpeer-review

The quadratic assignment problem is easy for robinsonian matrices

Laurent, M. & Seminaroti, M., Jan 2015, In : Operations Research Letters. 43, 1, p. 103-109

Research output: Contribution to journalArticleScientificpeer-review

2014

A new graph parameter related to bounded rank positive semidefinite matrix completions

Laurent, M. & Varvitsiotis, A., Jun 2014, In : Mathematical Programming. 145, 1-2, p. 291-325

Research output: Contribution to journalArticleScientificpeer-review

Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope

Nagy, M., Laurent, M. & Varvitsiotis, A., Sep 2014, In : Journal of Combinatorial Theory, Series B, Graph theory. 108, September 2014, p. 40-80

Research output: Contribution to journalArticleScientificpeer-review

Handelman's hierarchy for the maximum stable set problem

Laurent, M. & Sun, Z., 2014, In : Journal of Global Optimization. 60, 3, p. 393-423

Research output: Contribution to journalArticleScientificpeer-review

Positive semidefinite matrix completion, universal rigidity and the Strong Arnold Property

Laurent, M. & Varvitsiotis, A., Jul 2014, In : Linear Algebra and its Applications. 452, p. 292-317

Research output: Contribution to journalArticleScientificpeer-review

2013

Moment matrices, border bases and radical computation

Lasserre, J. B., Laurent, M., Mourrain, B., Rostalski, P. & Trébuchet, P., 2013, In : Journal of Symbolic Computation. 51, April 2013, p. 63-85

Research output: Contribution to journalArticleScientificpeer-review

2012

A new semidefinite programming relaxation for cycles in binary matroids and cuts in graphs

Gouveia, J., Laurent, M., Parrilo, P. & Thomas, R., 2012, In : Mathematical Programming. 133, 1-2, p. 203-225

Research output: Contribution to journalArticleScientificpeer-review

File
239 Downloads (Pure)

Copositive vs. moment hierarchies for stable sets

Laurent, M., 2012, In : Optima: Mathematical Optimization Society Newsletter. 89, p. 8-9

Research output: Contribution to journalArticleProfessional

2011

Computing the Grothendieck constant of some graph classes

Laurent, M. & Varvitsiotis, A., 2011, In : Operations Research Letters. 39, 6, p. 452-456

Research output: Contribution to journalArticleScientificpeer-review

On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems

de Klerk, E. & Laurent, M., 2011, In : SIAM Journal on Optimization. 21, 3, p. 824-832

Research output: Contribution to journalArticleScientificpeer-review

2010

Error bounds for some semidefinite programming approaches to polynomial minimization on the hypercube

de Klerk, E. & Laurent, M., 2010, In : SIAM Journal on Optimization. 20, 6, p. 3104-3120

Research output: Contribution to journalArticleScientificpeer-review

File
241 Downloads (Pure)

On Leonid Gurvits's proof for permanents

Laurent, M. & Schrijver, A., 2010, In : The American Mathematical Monthly. 117, 10, p. 903-911

Research output: Contribution to journalArticleScientificpeer-review

File
260 Downloads (Pure)
2009

A generalized flat extension theorem for moment matrices

Laurent, M. & Mourrain, B., 2009, In : Archiv der Mathematik. 93, 1, p. 87-98

Research output: Contribution to journalArticleScientificpeer-review

File
228 Downloads (Pure)

A prolongation-projection algorithm for computing the finite real variety of an ideal

Lasserre, J. B., Laurent, M. & Rostalski, P., 2009, In : Theoretical Computer Science: The journal of the EATCS. 410, 27/29, p. 2685-2700

Research output: Contribution to journalArticleScientificpeer-review

Block-diagonal semidenfinite programming hierarchies for 0/1 programming

Gvozdenovic, N., Laurent, M. & Vallentin, F., 2009, In : Operations Research Letters. 37, 1, p. 27-31

Research output: Contribution to journalArticleScientificpeer-review

File
304 Downloads (Pure)
2008

Computing semidefinite programming lower bounds for the (fractional) chromatic number via block-diagonalization

Gvozdenović, N. & Laurent, M., 2008, In : SIAM Journal on Optimization. 19, 2, p. 592-615 24 p.

Research output: Contribution to journalArticleProfessional

File
32 Downloads (Pure)

Semidefinite characterization and computation of zero-dimensional real radical ideals

Lasserre, J-B., Laurent, M. & Rostalski, P., 2008, In : Foundations of Computational Mathematics. 8, 5, p. 607-647

Research output: Contribution to journalArticleProfessional

The operator $\Psi$ for the chromatic number of a graph

Gvozdenović, N. & Laurent, M., 2008, In : SIAM Journal on Optimization. 19, 2, p. 572-591 20 p.

Research output: Contribution to journalArticleProfessional

File
49 Downloads (Pure)
2007

Semidefinite bounds for the stability number of a graph via sums of squares of polynomials

Gvozdenović, N. & Laurent, M., 2007, In : Mathematical Programming. 110, 1, p. 145-173

Research output: Contribution to journalArticleProfessional

File
58 Downloads (Pure)

Semidefinite representations for finite varieties

Laurent, M., 2007, In : Mathematical Programming. 109, 1, p. 1-26

Research output: Contribution to journalArticleProfessional

Strengthened semidefinite programming bounds for codes

Laurent, M., 2007, In : Mathematical Programming. 109, 2-3, p. 239-261

Research output: Contribution to journalArticleProfessional

File
88 Downloads (Pure)
2006

A PTAS for the minimization of polynomials of fixed degree over the simplex

de Klerk, E., Laurent, M. & Parrilo, P., 2006, In : Theoretical Computer Science: The journal of the EATCS. 361, 2-3, p. 210-225

Research output: Contribution to journalArticleScientificpeer-review

File
255 Downloads (Pure)
2005

Revisiting two theorems of Curto and Fialkow on moment matrices

Laurent, M., 2005, In : Proceedings of the American Mathematical Society. 133, 10, p. 2965-2976 12 p.

Research output: Contribution to journalArticleProfessional

Semidefinite approximations for global unconstrained polynomial optimization

Jibetean, D. & Laurent, M., 2005, In : SIAM Journal on Optimization. 16, 2, p. 490-514 25 p.

Research output: Contribution to journalArticleProfessional

File
113 Downloads (Pure)
2003

A comparison of the Sherali-Adams, Lov´asz-Schrijver and Lasserre relaxations for 0-1 programming

Laurent, M., 2003, In : Mathematics of Operations Research. 28, 3, p. 470-496 27 p.

Research output: Contribution to journalArticleProfessional

File
156 Downloads (Pure)

Lower bound for the number of iterations in semidefinite relaxations for the cut polytope

Laurent, M., 2003, In : Mathematics of Operations Research. 28, 4, p. 871-883 13 p.

Research output: Contribution to journalArticleProfessional

File
9 Downloads (Pure)
2001

On the sparsity order of a graph and its deficiency in chordality

Laurent, M., 2001, In : Combinatorica. 21, 4, p. 543-570

Research output: Contribution to journalArticleProfessional

File
7 Downloads (Pure)

Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure

Laurent, M., 2001, In : SIAM Journal on Optimization. 12, 2, p. 345-375 31 p.

Research output: Contribution to journalArticleProfessional

File
42 Downloads (Pure)
2000

Equilateral dimension of the rectilinear space

Koolen, J., Laurent, M. & Schrijver, A., 2000, In : Designs, Codes and Cryptography. 21, 1-3, p. 149-164

Research output: Contribution to journalArticleProfessional

File
44 Downloads (Pure)