Find Research Outputs

Search concepts
Selected filters

Publication Year

  • 2020
  • 2019
  • 2018
  • 2017
  • 2016
  • 2015
  • 2014
  • 2013
  • 2012
  • 2011

Author

  • Etienne de Klerk
2017

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

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

2020

Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy

de Klerk, E., Marandi, A. & Dahl, J., Mar 2020, In : Discrete Applied Mathematics. 275, p. 95-110

Research output: Contribution to journalArticleScientificpeer-review

2012

Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry

de Klerk, E. & Sotirov, R., 2012, In : Mathematical Programming. 133, 1, p. 75-91

Research output: Contribution to journalArticleScientificpeer-review

2011

On the complexity of computing the handicap of a sufficient matrix

de Klerk, E. & Nagy, M., 2011, In : Mathematical Programming. 129, 2, p. 383-402

Research output: Contribution to journalArticleScientificpeer-review

2013

On semidefinite programming bounds for graph bandwidth

de Klerk, E., Nagy, M. & Sotirov, R., 2013, In : Optimization Methods and Software. 28, 3, p. 485-500

Research output: Contribution to journalArticleScientificpeer-review

2017

On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions

de Klerk, E., Glineur, F. & Taylor, A., Oct 2017, In : Optimization Letters. 11, 7, p. 1185–1199 15 p.

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File
87 Downloads (Pure)
2016

Computer-assisted proofs and semidefinite programming

de Klerk, E., May 2016, In : Optima: Mathematical Optimization Society Newsletter. 100, p. 11-11 1 p.

Research output: Contribution to journalBook/Film/Article reviewOther research output

2011

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

2016

On the Turing model complexity of interior point methods for semidefinite programming

de Klerk, E. & Vallentin, F., Sep 2016, In : SIAM Journal on Optimization. 26, 3, p. 1944-1961

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/ReportReport

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/ReportReport

2015

On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming.

de Klerk, E. & Vallentin, F., Jul 2015, Ithaca: Cornell University Library, 16 p. (arXiv; vol. 1507.03549).

Research output: Working paperOther research output

2019

Distributionally robust optimization with polynomial densities: Theory, models and algorithms

de Klerk, E., Kuhn, D. & Postek, K. S., Sep 2019, In : Mathematical Programming .

Research output: Contribution to journalArticleScientificpeer-review

16 Downloads (Pure)
2018

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

Solving Sparse Polynomial Optimization Problems with Chordal Structure Using the Sparse, Bounded-Degree Sum-of-Squares Hierarchy

Marandi, A., de Klerk, E. & Dahl, J., May 2017, Optimization Online.

Research output: Working paperDiscussion paperOther research output

2016

[Review of the book An Introduction to Polynomial and Semi-Algebraic Optimization, Jean-Bernard Lasserre, 2015]

de Klerk, E., 2016, In : European Journal of Operational Research. 249, 2, p. 789-790 2 p.

Research output: Contribution to journalBook/Film/Article reviewOther research output

On the Worst-Case Complexity of the Gradient Method with Exact Line Search for Smooth Strongly Convex Functions

de Klerk, E., Glineur, F. & Taylor, A., 30 Jun 2016, Itacha: Cornell University Library, 10 p. (arXiv; vol. arXiv:1606.09365).

Research output: Working paperOther research output

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/ReportReport

2012

On semidefinite programming relaxations of maximum k-section

de Klerk, E., Pasechnik, D. V., Sotirov, R. & Dobre, C., 2012, In : Mathematical Programming . 136, 2, p. 253-278

Research output: Contribution to journalArticleScientificpeer-review

2018

A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem

Marandi, A., Dahl, J. & de Klerk, E., Jun 2018, In : Annals of Operations Research. 265, 1, p. 67-92

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File
126 Downloads (Pure)
2011

Numerical block diagonalization of matrix *-algebras with application to semidefinite programming

de Klerk, E., Dobre, C. & Pasechnik, D. V., 2011, In : Mathematical Programming. 129, 1, p. 91-111

Research output: Contribution to journalArticleScientificpeer-review

2015

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

2011

A comparison of lower bounds for the symmetric circulant traveling salesman problem

de Klerk, E. & Dobre, C., 2011, In : Discrete Applied Mathematics. 159, 16, p. 1815-1826

Research output: Contribution to journalArticleScientificpeer-review

Open Access
2015

Convex programming approaches for polynomial MINLP

de Klerk, E., 2015, Mathematisches Forschungsinstitut Oberwolfach Report No. 46/2015. p. 2716-2718 3 p. (Mathematisches Forschungsinstitut Oberwolfach Report).

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientific

Open Access
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
2017

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)
2012

Improved lower bounds for the 2-page crossing number of Km, n and Kn via semidefinite programming

de Klerk, E. & Pasechnik, D. V., 2012, In : SIAM Journal on Optimization. 22, 2, p. 581-595

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File
245 Downloads (Pure)
2017

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)
2019

Polynomial norms

Ahmadi, A., de Klerk, E. & Hall, G., 2019, In : SIAM Journal on Optimization. 29, 1, p. 399–422

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File
19 Downloads (Pure)
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
2015

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
2012

Relaxations of combinatorial problems via association schemes

de Klerk, E., De Oliveira Filho, F. M. & Pasechnik, D. V., 2012, Handbook on Semidefinite, Conic and Polynomial Optimization. Anjos, M. F. & Lasserre, J. B. (eds.). Berlin: Springer Verlag, p. 171-200 957 p. (International Series in Operations Research & Management Science; no. 166).

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

2017

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

2014

Book drawings of complete bipartite graphs

de Klerk, E., Pasechnik, D. V. & Salazar, G., 20 Apr 2014, In : Discrete Applied Mathematics. 167, p. 80-93

Research output: Contribution to journalArticleScientificpeer-review

Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems

de Klerk, E., Nagy, M., Sotirov, R. & Truetsch, U., Mar 2014, In : European Journal of Operational Research. 233, 3, p. 488-499

Research output: Contribution to journalArticleScientificpeer-review

2013

Improved lower bounds on book crossing numbers of complete graphs

de Klerk, E., Pasechnik, D. V. & Salazar, G., 2013, In : SIAM Journal on Discrete Mathematics. 18, 1, p. 87-105

Research output: Contribution to journalArticleScientificpeer-review

2015

A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives

de Klerk, E., Sotirov, R. & Truetsch, U., 4 May 2015, In : INFORMS Journal on Computing. 27, 2, p. 378–391

Research output: Contribution to journalArticleScientificpeer-review

2020

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