Find Research Outputs

Search concepts
Selected filters
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

Breadth-first Search
Recognition Algorithm
Seriation
Interval Graphs
Divide and conquer

Perfect elimination orderings for symmetric matrices

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

Research output: Contribution to journalArticleScientificpeer-review

Open Access
Symmetric matrix
Elimination
Structured Matrices
Chordal Graphs
Weighted Graph

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
Symmetric matrix
Elimination
Structured Matrices
Chordal Graphs
Weighted Graph

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

Rate of Convergence
Grid
Polynomial
Optimization
Hypergeometric Distribution
2019
19 Downloads (Pure)

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
Convex Cone
Semidefinite Programming
Error Analysis
Moment
Outer Approximation
2018
80 Downloads (Pure)

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
Simulated annealing
Simulated Annealing
Polynomials
Polynomial
Optimization
2020
19 Downloads (Pure)

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
Hypercube
Polynomials
Polynomial
Optimization
Convergence Rate
2017
14 Downloads (Pure)

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
Simulated Annealing
Polynomial
Optimization
Convex Body
Compact Set

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
Positive semidefinite
Positive Semidefinite Matrix
Completely Positive Matrices
Upper bound
Quantum Information Theory
42 Downloads (Pure)

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
Interval Graphs
Unit
Adjacency Matrix
Weighted Graph
Substructure
43 Downloads (Pure)

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
Positive semidefinite
Linear Approximation
Colouring
Closure
Cone
2016

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
Positive semidefinite
Completely Positive Matrices
Upper bound
Quantum Information Theory
Positive Semidefinite Matrix
2017
13 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
Matrix Factorization
Lower bound
Polynomial
Optimization
Positive semidefinite
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
Matrix Factorization
Lower bound
Polynomial
Optimization
Positive semidefinite
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
Convergence Analysis
Rate of Convergence
Polynomials
Upper bound
Polynomial
2017

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

Quantum Graphs
Entanglement
Stability number
Polynomial
Optimization

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

Linear Extension
Perfect Graphs
Stable Set
Polytopes
Stable Set Polytope
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
Quantum Graphs
Entanglement
Polynomials
Polynomial
Optimization
2020

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

2017

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

Breadth-first Search
Interval Graphs
Weighted Graph
Sweep
Combinatorial Algorithms
2016
18 Downloads (Pure)

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
2017
46 Downloads (Pure)

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
Sum of squares
Error Bounds
Convergence Rate
Polynomials
Upper bound

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

Convergence Analysis
Compact Set
Probability density function
Polynomials
Upper bound

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

Hypercube
Polynomials
Polynomial
Optimization
Rate of Convergence
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