| Aspects of semidefinite programming : interior point algorithms and selected applications E de Klerk Springer, 2002 | 633 | 2002 |
| Approximation of the stability number of a graph via copositive programming E De Klerk, DV Pasechnik SIAM Journal on Optimization 12 (4), 875-892, 2002 | 439 | 2002 |
| Solving standard quadratic optimization problems via linear, semidefinite and copositive programming IM Bomze, E De Klerk Journal of Global Optimization 24 (2), 163-185, 2002 | 302 | 2002 |
| On copositive programming and standard quadratic optimization problems IM Bomze, M Dür, E De Klerk, C Roos, AJ Quist, T Terlaky Journal of Global Optimization 18 (4), 301-320, 2000 | 270 | 2000 |
| Reduction of symmetric semidefinite programs using the regular *-representation E De Klerk, DV Pasechnik, A Schrijver Mathematical programming 109 (2-3), 613-624, 2007 | 167 | 2007 |
| The complexity of optimizing over a simplex, hypercube or sphere: a short survey E De Klerk Central European Journal of Operations Research 16 (2), 111-125, 2008 | 137 | 2008 |
| Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem E De Klerk, R Sotirov Mathematical Programming 122 (2), 225-246, 2010 | 135 | 2010 |
| On the convergence of the central path in semidefinite optimization M Halická, E de Klerk, C Roos SIAM Journal on Optimization 12 (4), 1090-1099, 2002 | 135 | 2002 |
| Initialization in semidefinite programming via a self-dual skew-symmetric embedding E De Klerk, C Roos, T Terlaky Operations Research Letters 20 (5), 213-221, 1997 | 126 | 1997 |
| A PTAS for the minimization of polynomials of fixed degree over the simplex E De Klerk, M Laurent, PA Parrilo Theoretical Computer Science 361 (2-3), 210-225, 2006 | 122 | 2006 |
| On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions E De Klerk, F Glineur, AB Taylor Optimization Letters 11 (7), 1185-1199, 2017 | 116 | 2017 |
| On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function E de Klerk, DV Pasechnik, JP Warners Journal of Combinatorial Optimization 8 (3), 267-294, 2004 | 112 | 2004 |
| Global optimization of rational functions: a semidefinite programming approach D Jibetean, E de Klerk Mathematical Programming 106 (1), 93-109, 2006 | 101 | 2006 |
| Exploiting special structure in semidefinite programming: A survey of theory and applications E De Klerk European Journal of Operational Research 201 (1), 1-10, 2010 | 98 | 2010 |
| Improved bounds for the crossing numbers of Km, n and Kn E De Klerk, J Maharry, DV Pasechnik, RB Richter, G Salazar SIAM Journal on Discrete Mathematics 20 (1), 189-202, 2006 | 95 | 2006 |
| Copositive relaxation for general quadratic programming AJ Quist, E de Klerk, C Roos, T Terlaky Optimization methods and software 9 (1-3), 185-208, 1998 | 80 | 1998 |
| Interior point methods for semidefinite programming E Klerk Open Access PhD thesis from Tilburg University, 1997 | 73 | 1997 |
| Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation E De Klerk, F Glineur, AB Taylor SIAM Journal on Optimization 30 (3), 2053-2082, 2020 | 71 | 2020 |
| Infeasible-start semidefinite programming algorithms via self-dual embeddings E de Klerk, C Roos, T Terlaky Fields Institute Communications 18, 215-236, 1998 | 69 | 1998 |
| On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems E De Klerk, M Laurent SIAM Journal on Optimization 21 (3), 824-832, 2011 | 66 | 2011 |
Dmitrii (Dima) PasechnikComputer Science, Northwestern UniversityVerified email at northwestern.edu
