1986 …2020

Research output per year

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

Research Output

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

A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis

de Klerk, E. & Laurent, M., Dec 2019, World Women in Mathematics 2018: Proceedings of the First World Meeting for Women in Mathematics (WM)². Araujo, C., Benkart, G., Praeger, C. E. & Tanbay, B. (eds.). Cham: Springer, p. 17-56 (Association for Women in Mathematics Series ; vol. 20).

Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

Open Access
File
21 Downloads (Pure)

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
43 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

Bounds on Entanglement Dimensions and Quantum Graph Parameters via Noncommutative Polynomial Optimization

Gribling, S., de Laat, D. & Laurent, M., 31 Aug 2017, Ithaca: Cornell University Library, 29 p. (arXiv; vol. 1708.09696).

Research output: Working paperOther research output

Comparison of Lasserre's Measure-based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing

de Klerk, E. & Laurent, M., Mar 2017, Ithaca: Cornell University Library, 12 p. (arXiv; vol. 1703.00744).

Research output: Working paperOther research output

Open Access
File
14 Downloads (Pure)

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)

Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization

Gribling, S., Laat, D. D. & Laurent, M., 4 Aug 2017, Ithaca: Cornell University Library, 45 p. (arXiv; vol. 1708.01573).

Research output: Working paperOther research output

File
14 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

On the Linear Extension Complexity of Stable Set Polytopes for Perfect Graphs

Hu, H. & Laurent, M., 20 Jun 2017, Ithaca: Cornell University Library, 17 p. (arXiv; vol. 1706.05496).

Research output: Working paperOther research output

Perfect elimination orderings for symmetric matrices

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

Research output: Contribution to journalArticleScientificpeer-review

Open Access

Perfect Elimination Orderings for Symmetric Matrices

Laurent, M. & Tanigawa, S., 17 Apr 2017, Ithaca: Cornell University Library, 17 p. (arXiv; vol. 1706.05115).

Research output: Working paperOther research output

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

2016

Improved Convergence Rates for Lasserre-type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization

de Klerk, E., Laurent, M. & Hess, R., 16 Mar 2016, Ithaca: Cornell University Library, 21 p. (arXiv; vol. 1603.03329).

Research output: Working paperOther research output

Open Access

Matrices With High Completely Positive Semidefinite Rank

de Laat, D., Gribling, S. & Laurent, M., 3 May 2016, Ithaca: Cornell University Library, 17 p. (arXiv; vol. 1605.00988).

Research output: Working paperOther research output

Open Access

Similarity-First Search: A New Algorithm With Application to Robinsonian Matrix Recognition

Laurent, M. & Seminaroti, M., Jan 2016, Ithaca: Cornell University Library, 35 p. (arXiv; vol. 1601.03521).

Research output: Working paperOther research output

File
18 Downloads (Pure)
2015

A Lex-BFS-based recognition algorithm for Robinsonian matrices

Laurent, M. & Seminaroti, M., 2015, Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC 2015). Vangelis, P. & Widmayer, P. (eds.). 2015 ed. Springer Verlag, Vol. 9079. p. 325-338 14 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

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

Bound-Constrained Polynomial Optimization Using Only Elementary Calculations

de Klerk, E., Lasserre, J. B., Laurent, M. & Sun, Z., 15 Jul 2015, Ithaca: Cornell University Library, 23 p. (arXiv; vol. 1507.04404).

Research output: Working paperOther research output

Open Access

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

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

Burgdorf, S., Laurent, M. & Piovesan, T., Nov 2015, Proceedings of the 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015). Beigi, S. & Koenig, R. (eds.). Leibniz: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Vol. 44. p. 127-146 (Leibniz International Proceedings in Informatics; vol. 44).

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-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

An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution

de Klerk, E., Laurent, M. & Sun, Z., 9 Jul 2014, Ithaca: Cornell University Library. 17 p. (Preprint at arXiv; vol. 1407.2108)

Research output: Book/ReportReportProfessional

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

Convergence Analysis for Lasserre's Measure-based Hierarchy of Upper Bounds for Polynomial Optimization

de Klerk, E., Laurent, M. & Sun, Z., 1 Dec 2014, Ithaca: Cornell University Library. 23 p. (Preprint at arXiv; vol. 1411.6867v3)

Research output: Book/ReportReportProfessional

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

Optimization over polynomials: Selected topics

Laurent, M., 2014, Proceedings of the International Congress of Mathematicians 2014 (ICM 2014). Jang, S. Y., Kim, Y. R., Lee, D-W. & Yie, I. (eds.). Seoul: Kyung Moon SA Co. Ltd., p. 843-869

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-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

The Quadratic Assignment Problem is Easy for Robinsonian Matrices

Laurent, M. & Seminaroti, M., 10 Jul 2014, Ithaca: Cornell University Library. 14 p. (Preprint at arXiv; vol. 1407.2801v1)

Research output: Book/ReportReportProfessional

2013

An Alternative Proof of a PTAS for Fixed-Degree Polynomial Optimization Over the Simplex

de Klerk, E., Laurent, M. & Sun, Z., 2013, Ithaca: Cornell University Library. 20 p. (Preprint at arXiv; vol. 1311.0173)

Research output: Book/ReportReportProfessional

Complexity of the positive semidefinite matrix completion problem with a rank constraint

Nagy, M., Laurent, M. & Varvitsiotis, A., 2013, Discrete Geometry and Optimization. Bezdek, K., Deza, A. & Ye, Y. (eds.). Heidelberg: Springer Verlag, p. 105-120 336 p. (Fields Institute Communications; no. 69).

Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone

Laurent, M. & Piovesan, T., 2013, Ithaca: Cornell University Library. 43 p. (Preprint at arXiv; vol. 1312.6643)

Research output: Book/ReportReportProfessional

Handelman's hierarchy for the maximum stable set problem

Laurent, M. & Sun, Z., 2013, Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2013). Cornelissen, K., Hoeksma, R., Hurink, J. & Manthey, B. (eds.). Enschede: University of Twente, Vol. WP 13-01. p. 155-158

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Handelman's Hierarchy for the Maximum Stable Set Problem

Laurent, M. & Sun, Z., 2013, Ithaca: Cornell University Library. 31 p. (Preprint at arXiv; vol. 1305.7319)

Research output: Book/ReportReportProfessional

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

Positive Semidefinite Matrix Completion, Univeral Rigidity and the Strong Arnold Property

Laurent, M. & Varvitsiotis, A., 2013, Ithaca: Cornell University Library. 28 p. (Preprint at arXiv; vol. 1301.6616)

Research output: Book/ReportReportProfessional

Zero-error source-channel coding with entanglement

Briet, J., Buhrman, H., Laurent, M., Piovesan, T. & Scarpa, G., 2013, Ithaca: Cornell University Library. 33 p. (Preprint at arXiv; vol. 1308.4283)

Research output: Book/ReportReportProfessional

2012

A New Graph Parameter Related to Bounded Rank Positive Semidefinite Matric Completions

Laurent, M. & Varvitsiotis, A., 2012, Ithaca: Cornell University Library. 31 p. (Preprint at arXiv; vol. 1204.0734)

Research output: Book/ReportReportProfessional