Narrow search
Showing 71 - 80 of 81
Cover Image
On convex quadratic approximation
Hertog, Dirk den; Klerk, Etienne de; Roos, Kees - 2000
Persistent link: https://www.econbiz.de/10001473524
Cover Image
A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
Klerk, Etienne de; Sotirov, R.; Truetsch, U. - In: INFORMS journal on computing : JOC 27 (2015) 2, pp. 378-391
Persistent link: https://www.econbiz.de/10011291292
Cover Image
A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem
Marandi, Ahmadreza; Dahl, Joachim; Klerk, Etienne de - In: Paths, pivots, and practice : the power of optimization, (pp. 67-92). 2018
Persistent link: https://www.econbiz.de/10011846424
Cover Image
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
Klerk, Etienne de; Glineur, François; Taylor, Adrien B. - 2016
Persistent link: https://www.econbiz.de/10011893983
Cover Image
Worst-case examples for Lasserre's measure-based hierarchy for polynomial optimization on the hypercube
Klerk, Etienne de; Laurent, Monique - In: Mathematics of operations research 45 (2020) 1, pp. 86-98
Persistent link: https://www.econbiz.de/10012183021
Cover Image
Bound-constrained polynomial optimization using only elementary calculations
Klerk, Etienne de; Lasserre, Jean B.; Laurent, Monique; … - In: Mathematics of operations research 42 (2017) 3, pp. 834-853
Persistent link: https://www.econbiz.de/10011742535
Cover Image
Comparison of Lasserre's measure-based bounds for polynomial optimization to bounds obtained by simulated annealing
Klerk, Etienne de; Laurent, Monique - In: Mathematics of operations research 43 (2018) 4, pp. 1317-1325
Persistent link: https://www.econbiz.de/10011957064
Cover Image
Complexity analysis of a sampling-based interior point method for convex optimization
Badenbroek, Riley; Klerk, Etienne de - In: Mathematics of operations research 47 (2022) 1, pp. 779-811
Persistent link: https://www.econbiz.de/10013364947
Cover Image
Revisiting semidefinite programming approaches to options pricing : complexity and computational perspectives
Henrion, Didier; Kirschner, Felix; Klerk, Etienne de; … - In: INFORMS journal on computing : JOC ; charting new … 35 (2023) 2, pp. 335-349
Persistent link: https://www.econbiz.de/10014327623
Cover Image
An analytic center cutting plane method to determine complete positivity of a matrix
Badenbroek, Riley; Klerk, Etienne de - In: INFORMS journal on computing : JOC ; charting new … 34 (2022) 2, pp. 1115-1125
Persistent link: https://www.econbiz.de/10013361458