The following pages link to Etienne de Klerk (Q172145):
Displaying 50 items.
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization (Q321039) (← links)
- Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions (Q373942) (← links)
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry (Q431008) (← links)
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization (Q517310) (← links)
- On the convergence rate of grid search for polynomial optimization over the simplex (Q519777) (← links)
- A comparison of lower bounds for the symmetric circulant traveling salesman problem (Q643021) (← links)
- On the complexity of computing the handicap of a sufficient matrix (Q644911) (← links)
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming (Q717133) (← links)
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation (Q868475) (← links)
- A linear programming reformulation of the standard quadratic optimization problem (Q868634) (← links)
- (Q932195) (redirect page) (← links)
- On the complexity of optimization over the standard simplex (Q932197) (← links)
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826) (← links)
- On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs (Q1024280) (← links)
- Exploiting group symmetry in truss topology optimization (Q1041375) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- A nonconvex weighted potential function for polynomial target following methods (Q1265911) (← links)
- Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions (Q1294553) (← links)
- Optimization of nuclear reactor reloading patterns (Q1357771) (← links)
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding (Q1362529) (← links)
- Polynomial primal-dual affine scaling algorithms in semidefinite programming (Q1386485) (← links)
- (Q1597977) (redirect page) (← links)
- Aspects of semidefinite programming. Interior point algorithms and selected applications (Q1597978) (← links)
- A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem (Q1657401) (← links)
- On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions (Q1679617) (← links)
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming (Q1812072) (← links)
- On semidefinite programming relaxations of \((2+p)\)-SAT (Q1861907) (← links)
- Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms (Q1877018) (← links)
- On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function (Q1888168) (← links)
- On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
- Relaxations of the satisfiability problem using semidefinite programming (Q1977751) (← links)
- Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere (Q2080815) (← links)
- Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere (Q2144547) (← links)
- Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives (Q2156386) (← links)
- Distributionally robust optimization with polynomial densities: theory, models and algorithms (Q2189441) (← links)
- Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy (Q2297658) (← links)
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex (Q2349131) (← links)
- Book drawings of complete bipartite graphs (Q2440102) (← links)
- Global optimization of rational functions: a semidefinite programming approach (Q2490324) (← links)
- A PTAS for the minimization of polynomials of fixed degree over the simplex (Q2503350) (← links)
- A note on the stability number of an orthogonality graph (Q2643845) (← links)
- Minimum energy configurations on a toric lattice as a quadratic assignment problem (Q2673239) (← links)
- The exact worst-case convergence rate of the gradient method with fixed step lengths for \(L\)-smooth functions (Q2673524) (← links)
- A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization (Q2706359) (← links)
- (Q2749859) (← links)
- Approximation of the Stability Number of a Graph via Copositive Programming (Q2784442) (← links)
- Relaxations of Combinatorial Problems Via Association Schemes (Q2802525) (← links)
- On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming (Q2821802) (← links)
