Research output per year
Research output per year
- 1 - 50 out of 122 results
Search results
-
2024
A predictor-corrector algorithm for semidefinite programming that uses the factor width cone
Kirschner, F. & de Klerk, E., Apr 2024, (E-pub ahead of print) In: Vietnam Journal of Mathematics.Research output: Contribution to journal › Article › Scientific › peer-review
Open AccessFile48 Downloads (Pure) -
Convergence rate analysis of the gradient descent-ascent method for convex-concave saddle-point problems
Zamani, M., Abbaszadehpeivasti, H. & de Klerk, E., Jun 2024, (E-pub ahead of print) In: Optimization Methods & Software. 23 p.Research output: Contribution to journal › Article › Scientific › peer-review
Open Access -
2023
Conditions for linear convergence of the gradient method for non-convex optimization
Abbaszadehpeivasti, H., de Klerk, E. & Zamani, M., 2023, In: Optimization Letters. 17, p. 1105–1125Research output: Contribution to journal › Article › Scientific › peer-review
Open Access -
Construction of multivariate polynomial approximation kernels via semidefinite programming
Kirschner, F. & de Klerk, E., Jun 2023, In: SIAM Journal on Optimization. 33, 2, p. 513 - 537Research output: Contribution to journal › Article › Scientific › peer-review
Open AccessFile1 Citation (Scopus)78 Downloads (Pure) -
Convergence rate analysis of randomized and cyclic coordinate descent for convex optimization through semidefinite programming
Abbaszadehpeivasti, H., de Klerk, E. & Zamani, M., Aug 2023, In: Applied Set-Valued Analysis and Optimization. 5, 2, p. 141-153 13 p.Research output: Contribution to journal › Article › Scientific › peer-review
Open AccessFile104 Downloads (Pure) -
On the rate of convergence of the difference-of-convex algorithm (DCA)
Abbaszadehpeivasti, H., de Klerk, E. & Zamani, M., Mar 2023, (E-pub ahead of print) In: Journal of Optimization Theory and Applications.Research output: Contribution to journal › Article › Scientific › peer-review
Open Access4 Citations (Scopus) -
Revisiting semidefinite programming approaches to options pricing: Complexity and computational perspectives
Henrion, D., Kirschner, F., de Klerk, E., Korda, M., Lasserre, J. B. & Magron, V., Mar 2023, In: INFORMS Journal on Computing. 35, 2, p. 335-349Research output: Contribution to journal › Article › Scientific › peer-review
Open Access -
The exact worst-case convergence rate of the alternating direction method of multipliers
Zamani, M., Abbaszadehpeivasti, H. & de Klerk, E., Dec 2023, (E-pub ahead of print) In: Mathematical Programming.Research output: Contribution to journal › Article › Scientific › peer-review
Open AccessFile41 Downloads (Pure) -
2022
An analytic center cutting plane method to determine complete positivity of a matrix
Badenbroek, R. & de Klerk, E., Mar 2022, In: INFORMS Journal on Computing. 34, 2, p. 1115-1125Research output: Contribution to journal › Article › Scientific › peer-review
Open AccessFile5 Citations (Scopus)140 Downloads (Pure) -
Complexity analysis of a sampling-based interior point method for convex optimization
Badenbroek, R. & de Klerk, E., Feb 2022, In: Mathematics of Operations Research. 47, 1, p. 779-811Research output: Contribution to journal › Article › Scientific › peer-review
Open AccessFile134 Downloads (Pure) -
Conic linear optimization for computer-assisted proofs
de Klerk, E., Henrion, D., Vallentin, F. & Wiegele, A., Apr 2022, In: Oberwolfach Reports (OWL). 19, 2, p. 1039–1089Research output: Contribution to journal › Article › Scientific
Open Access -
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
de Klerk, E. & Laurent, M., Jun 2022, In: Mathematical Programming. 193, 2, p. 665-685 21 p.Research output: Contribution to journal › Article › Scientific › peer-review
Open Access19 Citations (Scopus) -
Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere
Kirschner, F. & de Klerk, E., Nov 2022, In: Optimization Letters. 16, 8, p. 2191–2208Research output: Contribution to journal › Article › Scientific › peer-review
Open AccessFile1 Citation (Scopus)63 Downloads (Pure) -
Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: Theory and software
Brosch, D. & de Klerk, E., 2022, In: Optimization Methods & Software. 37, 6, p. 2001-2020Research output: Contribution to journal › Article › Scientific › peer-review
Open AccessFile3 Citations (Scopus)99 Downloads (Pure) -
Minimum energy configurations on a toric lattice as a quadratic assignment problem
Brosch, D. & de Klerk, E., May 2022, In: Discrete Optimization. 44, Part 2, 100612.Research output: Contribution to journal › Article › Scientific › peer-review
Open Access3 Citations (Scopus) -
Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives
de Klerk, E. & Badenbroek, R., Aug 2022, In: Journal of Optimization Theory and Applications. 194, 2, p. 465–491Research output: Contribution to journal › Article › Scientific › peer-review
Open Access22 Downloads (Pure) -
The exact worst-case convergence rate of the gradient method with fixed step lengths for L-smooth functions
Abbaszadehpeivasti, H., de Klerk, E. & Zamani, M., Jul 2022, In: Optimization Letters. 16, 6, p. 1649–1661Research output: Contribution to journal › Article › Scientific › peer-review
Open AccessFile5 Citations (Scopus)116 Downloads (Pure) -
2020
An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
Badenbroek, R. & de Klerk, E., 2020, (Submitted) Ithaca: Cornell University Library, 16 p. (arXiv; vol. 2006.05319).Research output: Working paper › Other research output
File173 Downloads (Pure) -
Distributionally robust optimization with polynomial densities: Theory, models and algorithms
de Klerk, E., Kuhn, D. & Postek, K. S., Jun 2020, In: Mathematical Programming. 181, 2, p. 265–296Research output: Contribution to journal › Article › Scientific › peer-review
12 Citations (Scopus)16 Downloads (Pure) -
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-110Research output: Contribution to journal › Article › Scientific › peer-review
3 Citations (Scopus) -
Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation
de Klerk, E., Glineur, F. & Taylor, A., Jul 2020, In: SIAM Journal on Optimization. 30, 3, p. 2053–2082Research output: Contribution to journal › Article › Scientific › peer-review
Open AccessFile242 Downloads (Pure) -
Worst-case examples for Lasserre's measure-based hierarchy for polynomial optimization on the hypercube
de Klerk, E. & Laurent, M., Feb 2020, In: Mathematics of Operations Research. 45, 1, p. 86-98Research output: Contribution to journal › Article › Scientific › peer-review
Open AccessFile146 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 proceeding › Chapter › Scientific › peer-review
Open AccessFile159 Downloads (Pure) -
Polynomial norms
Ahmadi, A., de Klerk, E. & Hall, G., 2019, In: SIAM Journal on Optimization. 29, 1, p. 399–422Research output: Contribution to journal › Article › Scientific › peer-review
Open AccessFile3 Citations (Scopus)223 Downloads (Pure) -
Simulated Annealing with Hit-and-Run for Convex Optimization: Rigorous Complexity Analysis and Practical Perspectives for Copositive Programming
Badenbroek, R. & de Klerk, E., 2019, (Submitted) Ithaca: Cornell University Library, 21 p. (arXiv; vol. 1907.02368).Research output: Working paper › Other research output
-
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-92Research output: Contribution to journal › Article › Scientific › peer-review
Open AccessFile7 Citations (Scopus)247 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-1325Research output: Contribution to journal › Article › Scientific › peer-review
File14 Citations (Scopus)191 Downloads (Pure) -
Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization
Badenbroek, R. & de Klerk, E., 2018, (Submitted) Ithaca: Cornell University Library, 38 p. (arXiv; vol. 1811.07677).Research output: Working paper › Other research output
-
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-853Research output: Contribution to journal › Article › Scientific › peer-review
15 Citations (Scopus) -
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 paper › Other research output
Open AccessFile110 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-392Research output: Contribution to journal › Article › Scientific › peer-review
18 Citations (Scopus) -
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-367Research output: Contribution to journal › Article › Scientific › peer-review
Open AccessFile16 Citations (Scopus)151 Downloads (Pure) -
On the convergence rate of grid search for polynomial optimization over the simplex
de Klerk, E., Laurent, M., Sun, Z. & Vera, J. C., Mar 2017, In: Optimization Letters. 11, 3, p. 597-608Research output: Contribution to journal › Article › Scientific › peer-review
5 Citations (Scopus) -
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 journal › Article › Scientific › peer-review
Open AccessFile275 Downloads (Pure) -
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 paper › Discussion paper › Other 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 journal › Book/Film/Article review › Other research output
-
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 journal › Book/Film/Article review › Other research output
-
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 paper › Other research output
Open Access -
On the Turing model complexity of interior point methods for semidefinite programming
de Klerk, E. & Vallentin, F., Sept 2016, In: SIAM Journal on Optimization. 26, 3, p. 1944-1961Research output: Contribution to journal › Article › Scientific › peer-review
20 Citations (Scopus) -
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 paper › Other research output
41 Citations (Scopus) -
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 journal › Article › Scientific › peer-review
13 Citations (Scopus) -
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 journal › Article › Scientific › peer-review
10 Citations (Scopus) -
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–391Research output: Contribution to journal › Article › Scientific › peer-review
8 Citations (Scopus) -
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 paper › Other research output
Open Access -
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 proceeding › Conference contribution › Scientific
Open Access -
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 paper › Other research output
-
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/Report › Report
-
Book drawings of complete bipartite graphs
de Klerk, E., Pasechnik, D. V. & Salazar, G., 20 Apr 2014, In: Discrete Applied Mathematics. 167, p. 80-93Research output: Contribution to journal › Article › Scientific › peer-review
5 Citations (Scopus) -
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/Report › Report
-
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-499Research output: Contribution to journal › Article › Scientific › peer-review
5 Citations (Scopus)