The following pages link to E. de Klerk (Q172145):
Displaying 43 items.
- Improved lower bounds on book crossing numbers of complete graphs (Q2848524) (← links)
- Improved lower bounds for the 2-page crossing numbers of \(K_{m,n}\) and \(K_n\) via semidefinite programming (Q2910885) (← links)
- Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization (Q2968176) (← links)
- Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube (Q3083323) (← links)
- On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems (Q3105776) (← links)
- A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis (Q3296188) (← links)
- A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives (Q3466781) (← links)
- Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster (Q3562409) (← links)
- Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem (Q3563925) (← links)
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem (Q3648520) (← links)
- (Q3840328) (← links)
- (Q4343737) (← links)
- Method of approximate centers for semi-definite programming (Q4345241) (← links)
- Copositive realxation for genera quadratic programming (Q4391294) (← links)
- (Q4400648) (← links)
- On convex quadratic approximation (Q4469569) (← links)
- (Q4517100) (← links)
- (Q4550772) (← links)
- Polynomial Norms (Q4620456) (← links)
- On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex (Q4681650) (← links)
- On the Convergence of the Central Path in Semidefinite Optimization (Q4785863) (← links)
- Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software (Q5058403) (← links)
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization (Q5076724) (← links)
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix (Q5086010) (← links)
- Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube (Q5108258) (← links)
- Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation (Q5116548) (← links)
- Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing (Q5219701) (← links)
- On semidefinite programming bounds for graph bandwidth (Q5299908) (← links)
- Limiting behavior of the central path in semidefinite optimization (Q5312757) (← links)
- Bound-Constrained Polynomial Optimization Using Only Elementary Calculations (Q5359122) (← links)
- Improved Bounds for the Crossing Numbers of Km,n and Kn (Q5470826) (← links)
- An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution (Q5502241) (← links)
- Worst-case CVaR based portfolio optimization models with applications to scenario planning (Q5891578) (← links)
- On copositive programming and standard quadratic optimization problems (Q5929997) (← links)
- Conditions for linear convergence of the gradient method for non-convex optimization (Q6097482) (← links)
- Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming (Q6155879) (← links)
- Minimum energy configurations on a toric lattice as a quadratic assignment problem (Q6323094) (← links)
- The link between $1$-norm approximation and effective Positivstellensatze for the hypercube (Q6529397) (← links)
- On the rate of convergence of the difference-of-convex algorithm (DCA) (Q6596346) (← links)
- The exact worst-case convergence rate of the alternating direction method of multipliers (Q6634526) (← links)
- Convergence rate analysis of the gradient descent–ascent method for convex–concave saddle-point problems (Q6644990) (← links)
- Optimization-aided construction of multivariate Chebyshev polynomials (Q6651978) (← links)
- Least multivariate Chebyshev polynomials on diagonally determined domains (Q6730624) (← links)
