default search action
Etienne de Klerk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j77]Mareike Dressler, Simon Foucart
, Mioara Joldes, Etienne de Klerk, Jean B. Lasserre, Yuan Xu:
Optimization-aided construction of multivariate Chebyshev polynomials. J. Approx. Theory 305: 106116 (2025) - 2024
- [j76]Tibor Illés, Florian Jarre, Etienne de Klerk, Goran Lesaja
Conic Optimization and Interior Point Methods: Theory, Computations, and Applications. J. Optim. Theory Appl. 202(1): 1-10 (2024) - [j75]Hadi Abbaszadehpeivasti
On the Rate of Convergence of the Difference-of-Convex Algorithm (DCA). J. Optim. Theory Appl. 202(1): 475-496 (2024) - [j74]Moslem Zamani
The exact worst-case convergence rate of the alternating direction method of multipliers. Math. Program. 208(1): 243-276 (2024) - [j73]Moslem Zamani
Convergence rate analysis of the gradient descent-ascent method for convex-concave saddle-point problems. Optim. Methods Softw. 39(5): 967-989 (2024) - [i3]Mareike Dressler, Simon Foucart, Etienne de Klerk, Mioara Joldes, Jean-Bernard Lasserre, Yuan Xu:
Optimization-Aided Construction of Multivariate Chebyshev Polynomials. CoRR abs/2405.10438 (2024) - 2023
- [j72]Didier Henrion
Revisiting Semidefinite Programming Approaches to Options Pricing: Complexity and Computational Perspectives. INFORMS J. Comput. 35(2): 335-349 (2023) - [j71]Hadi Abbaszadehpeivasti
Conditions for linear convergence of the gradient method for non-convex optimization. Optim. Lett. 17(5): 1105-1125 (2023) - [j70]Felix Kirschner
Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming. SIAM J. Optim. 33(2): 513-537 (2023) - 2022
- [j69]Daniel Brosch
Minimum energy configurations on a toric lattice as a quadratic assignment problem. Discret. Optim. 44(Part): 100612 (2022) - [j68]Riley Badenbroek
An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix. INFORMS J. Comput. 34(2): 1115-1125 (2022) - [j67]Riley Badenbroek, Etienne de Klerk
Simulated Annealing for Convex Optimization: Rigorous Complexity Analysis and Practical Perspectives. J. Optim. Theory Appl. 194(2): 465-491 (2022) - [j66]Riley Badenbroek
Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization. Math. Oper. Res. 47(1): 779-811 (2022) - [j65]Etienne de Klerk
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere. Math. Program. 193(2): 665-685 (2022) - [j64]Hadi Abbaszadehpeivasti
The exact worst-case convergence rate of the gradient method with fixed step lengths for L-smooth functions. Optim. Lett. 16(6): 1649-1661 (2022) - [j63]Felix Kirschner
Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere. Optim. Lett. 16(8): 2191-2208 (2022) - [j62]Daniel Brosch
Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software. Optim. Methods Softw. 37(6): 2001-2020 (2022) - 2020
- [j61]Ahmadreza Marandi
Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy. Discret. Appl. Math. 275: 95-110 (2020) - [j60]Etienne de Klerk
Worst-Case Examples for Lasserre's Measure-Based Hierarchy for Polynomial Optimization on the Hypercube. Math. Oper. Res. 45(1): 86-98 (2020) - [j59]Etienne de Klerk
Distributionally robust optimization with polynomial densities: theory, models and algorithms. Math. Program. 181(2): 265-296 (2020) - [j58]Etienne de Klerk
Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation. SIAM J. Optim. 30(3): 2053-2082 (2020)
2010 – 2019
- 2019
- [j57]Amir Ali Ahmadi
Polynomial Norms. SIAM J. Optim. 29(1): 399-422 (2019) - 2018
- [j56]Ahmadreza Marandi
A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem. Ann. Oper. Res. 265(1): 67-92 (2018) - [j55]Etienne de Klerk
Comparison of Lasserre's Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing. Math. Oper. Res. 43(4): 1317-1325 (2018) - 2017
- [j54]Etienne de Klerk
Bound-Constrained Polynomial Optimization Using Only Elementary Calculations. Math. Oper. Res. 42(3): 834-853 (2017) - [j53]Etienne de Klerk
Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization. Math. Program. 162(1-2): 363-392 (2017) - [j52]Etienne de Klerk
On the convergence rate of grid search for polynomial optimization over the simplex. Optim. Lett. 11(3): 597-608 (2017) - [j51]Etienne de Klerk
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions. Optim. Lett. 11(7): 1185-1199 (2017) - [j50]Etienne de Klerk
Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization. SIAM J. Optim. 27(1): 347-367 (2017) - [i2]Amir Ali Ahmadi, Etienne de Klerk, Georgina Hall:
Polynomial Norms. CoRR abs/1704.07462 (2017) - 2016
- [j49]Etienne de Klerk
Book Review by Etienne de Klerk "An Introduction to Polynomial and Semi-Algebraic Optimization" by Jean-Bernard Lasserre, Cambridge University Press, 2015. Eur. J. Oper. Res. 249(2): 789-790 (2016) - [j48]Etienne de Klerk
On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming. SIAM J. Optim. 26(3): 1944-1961 (2016) - 2015
- [j47]Etienne de Klerk
A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives. INFORMS J. Comput. 27(2): 378-391 (2015) - [j46]Etienne de Klerk
An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex. Math. Program. 151(2): 433-457 (2015) - [j45]Etienne de Klerk
An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution. SIAM J. Optim. 25(3): 1498-1514 (2015) - [i1]Etienne de Klerk, Frank Vallentin:
On the Turing model complexity of interior point methods for semidefinite programming. CoRR abs/1507.03549 (2015) - 2014
- [j44]Etienne de Klerk
Book drawings of complete bipartite graphs. Discret. Appl. Math. 167: 80-93 (2014) - [j43]Etienne de Klerk
Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems. Eur. J. Oper. Res. 233(3): 488-499 (2014) - 2013
- [j42]Tamás Terlaky, Etienne de Klerk, Goran Lesaja, Dick den Hertog:
Special issue in honour of Professor Kees Roos' 70th Birthday. Optim. Methods Softw. 28(3): 393-395 (2013) - [j41]Etienne de Klerk, Marianna E.-Nagy
On semidefinite programming bounds for graph bandwidth. Optim. Methods Softw. 28(3): 485-500 (2013) - [j40]Etienne de Klerk, Dmitrii V. Pasechnik
Improved Lower Bounds on Book Crossing Numbers of Complete Graphs. SIAM J. Discret. Math. 27(2): 619-633 (2013) - 2012
- [j39]Etienne de Klerk
Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry. Math. Program. 133(1-2): 75-91 (2012) - [j38]Etienne de Klerk, Dmitrii V. Pasechnik
On semidefinite programming relaxations of maximum $$k$$ -section. Math. Program. 136(2): 253-278 (2012) - [j37]Etienne de Klerk, Dmitrii V. Pasechnik
Improved Lower Bounds for the 2-Page Crossing Numbers of Km, n and Kn via Semidefinite Programming. SIAM J. Optim. 22(2): 581-595 (2012) - 2011
- [j36]Etienne de Klerk
A comparison of lower bounds for the symmetric circulant traveling salesman problem. Discret. Appl. Math. 159(16): 1815-1826 (2011) - [j35]Miguel F. Anjos
Preface. Math. Program. 129(1): 1-3 (2011) - [j34]Etienne de Klerk, Cristian Dobre, Dmitrii V. Pasechnik
Numerical block diagonalization of matrix *-algebras with application to semidefinite programming. Math. Program. 129(1): 91-111 (2011) - [j33]Etienne de Klerk, Marianna E.-Nagy
On the complexity of computing the handicap of a sufficient matrix. Math. Program. 129(2): 383-402 (2011) - [j32]Etienne de Klerk, Monique Laurent:
On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems. SIAM J. Optim. 21(3): 824-832 (2011) - 2010
- [j31]Etienne de Klerk:
Exploiting special structure in semidefinite programming: A survey of theory and applications. Eur. J. Oper. Res. 201(1): 1-10 (2010) - [j30]Etienne de Klerk, Renata Sotirov:
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem. Math. Program. 122(2): 225-246 (2010) - [j29]Ivan D. Ivanov, Etienne de Klerk:
Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster. Optim. Methods Softw. 25(3): 405-420 (2010) - [j28]Etienne de Klerk, Monique Laurent:
Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube. SIAM J. Optim. 20(6): 3104-3120 (2010)
2000 – 2009
- 2009
- [j27]Etienne de Klerk, Michael W. Newman, Dmitrii V. Pasechnik
On the Lovász theta-number of almost regular graphs with application to Erdos-Rényi graphs. Eur. J. Comb. 30(4): 879-888 (2009) - [j26]Etienne de Klerk, Renata Sotirov:
A new library of structured semidefinite programming instances. Optim. Methods Softw. 24(6): 959-971 (2009) - [j25]Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov:
Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem. SIAM J. Optim. 20(2): 1132 (2009) - 2008
- [j24]Etienne de Klerk:
The complexity of optimizing over a simplex, hypercube or sphere: a short survey. Central Eur. J. Oper. Res. 16(2): 111-125 (2008) - [j23]Etienne de Klerk, Dick den Hertog, G. Elabwabi:
On the complexity of optimization over the standard simplex. Eur. J. Oper. Res. 191(3): 773-785 (2008) - [j22]Etienne de Klerk, Dmitrii V. Pasechnik
On Semidefinite Programming Relaxations of the Traveling Salesman Problem. SIAM J. Optim. 19(4): 1559-1573 (2008) - 2007
- [j21]Etienne de Klerk, Dmitrii V. Pasechnik
A note on the stability number of an orthogonality graph. Eur. J. Comb. 28(7): 1971-1979 (2007) - [j20]Etienne de Klerk, Dmitrii V. Pasechnik
A linear programming reformulation of the standard quadratic optimization problem. J. Glob. Optim. 37(1): 75-84 (2007) - [j19]Erling S. Andersen, Etienne de Klerk, Levent Tunçel
Foreword: Special issue on large-scale nonlinear and semidefinite programming. Math. Program. 109(2-3): 207-209 (2007) - [j18]Etienne de Klerk, Dmitrii V. Pasechnik
Reduction of symmetric semidefinite programs using the regular *-representation. Math. Program. 109(2-3): 613-624 (2007) - 2006
- [j17]Dorina Jibetean, Etienne de Klerk:
Global optimization of rational functions: a semidefinite programming approach. Math. Program. 106(1): 93-109 (2006) - [j16]Etienne de Klerk, John Maharry, Dmitrii V. Pasechnik
Improved Bounds for the Crossing Numbers of Km, n and Kn. SIAM J. Discret. Math. 20(1): 189-202 (2006) - [j15]Etienne de Klerk, Monique Laurent, Pablo A. Parrilo
A PTAS for the minimization of polynomials of fixed degree over the simplex. Theor. Comput. Sci. 361(2-3): 210-225 (2006) - 2005
- [j14]Margaréta Halická
Limiting behavior of the central path in semidefinite optimization. Optim. Methods Softw. 20(1): 99-113 (2005) - 2004
- [j13]Etienne de Klerk, Dmitrii V. Pasechnik
Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms. Eur. J. Oper. Res. 157(1): 39-45 (2004) - [j12]Etienne de Klerk, Dmitrii V. Pasechnik
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function. J. Comb. Optim. 8(3): 267-294 (2004) - 2003
- [j11]Etienne de Klerk, Hans van Maaren:
On Semidefinite Programming Relaxations of (2+p)-SAT. Ann. Math. Artif. Intell. 37(3): 285-305 (2003) - 2002
- [j10]Immanuel M. Bomze, Etienne de Klerk:
Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming. J. Glob. Optim. 24(2): 163-185 (2002) - [j9]Etienne de Klerk, Dmitrii V. Pasechnik
Approximation of the Stability Number of a Graph via Copositive Programming. SIAM J. Optim. 12(4): 875-892 (2002) - [j8]Margaréta Halická
On the Convergence of the Central Path in Semidefinite Optimization. SIAM J. Optim. 12(4): 1090-1099 (2002) - 2001
- [j7]Etienne de Klerk, Jiming Peng, Cees Roos, Tamás Terlaky
A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization. SIAM J. Optim. 11(4): 870-888 (2001) - 2000
- [j6]Etienne de Klerk, Hans van Maaren, Joost P. Warners:
Relaxations of the Satisfiability Problem Using Semidefinite Programming. J. Autom. Reason. 24(1/2): 37-65 (2000) - [j5]Immanuel M. Bomze
On Copositive Programming and Standard Quadratic Optimization Problems. J. Glob. Optim. 18(4): 301-320 (2000)
1990 – 1999
- 1998
- [j4]Etienne de Klerk, Cornelis Roos, Tamás Terlaky:
A nonconvex weighted potential function forpolynomial target following methods. Ann. Oper. Res. 81: 3-14 (1998) - [j3]Etienne de Klerk, Cornelis Roos, Tamás Terlaky:
Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming. J. Comb. Optim. 2(1): 51-69 (1998) - 1997
- [j2]Etienne de Klerk, Cornelis Roos, Tamás Terlaky, Tibor Illés, A. J. de Jong, J. Valkó, J. E. Hoogenboom:
Optimization of nuclear reactor reloading patterns. Ann. Oper. Res. 69: 65-84 (1997) - [j1]Etienne de Klerk, Cornelis Roos, Tamás Terlaky:
Initialization in semidefinite programming via a self-dual skew-symmetric embedding. Oper. Res. Lett. 20(5): 213-221 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: