24 results on '"Klerk, Etienne"'
Search Results
2. The exact worst-case convergence rate of the alternating direction method of multipliers
3. On the Rate of Convergence of the Difference-of-Convex Algorithm (DCA)
4. Conditions for linear convergence of the gradient method for non-convex optimization
5. Simulated Annealing for Convex Optimization: Rigorous Complexity Analysis and Practical Perspectives
6. Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere
7. The exact worst-case convergence rate of the gradient method with fixed step lengths for L-smooth functions
8. Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
9. Distributionally robust optimization with polynomial densities: theory, models and algorithms
10. A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem
11. On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
12. Convergence analysis for Lasserre’s measure-based hierarchy of upper bounds for polynomial optimization
13. On the convergence rate of grid search for polynomial optimization over the simplex
14. An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
15. On semidefinite programming relaxations of maximum $$k$$ -section
16. On the complexity of computing the handicap of a sufficient matrix
17. Numerical block diagonalization of matrix *-algebras with application to semidefinite programming
18. Preface
19. Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
20. Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
21. Exploiting group symmetry in truss topology optimization
22. The complexity of optimizing over a simplex, hypercube or sphere: a short survey
23. Foreword: Special issue on large-scale nonlinear and semidefinite programming
24. Reduction of symmetric semidefinite programs using the regular $$\ast$$ -representation
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.