Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity T Weisser, JB Lasserre, KC Toh Mathematical Programming Computation 10, 1-32, 2018 | 96 | 2018 |
Semi-algebraic approximation using Christoffel–Darboux kernel S Marx, E Pauwels, T Weisser, D Henrion, JB Lasserre Constructive Approximation, 1-39, 2021 | 52 | 2021 |
A moment approach for entropy solutions to nonlinear hyperbolic PDEs S Marx, T Weisser, D Henrion, J Lasserre arXiv preprint arXiv:1807.02306, 2018 | 42 | 2018 |
Polynomial and moment optimization in Julia and JuMP T Weisser, B Legat, C Coey, L Kapelevich, JP Vielma JuliaCon, 2019 | 40 | 2019 |
Exploiting sparsity for semi-algebraic set volume computation M Tacchi, T Weisser, JB Lasserre, D Henrion Foundations of Computational Mathematics, 1-49, 2022 | 32 | 2022 |
Proving global optimality of ACOPF solutions S Gopinath, HL Hijazi, T Weisser, H Nagarajan, M Yetkin, K Sundar, ... Electric Power Systems Research 189, 106688, 2020 | 31 | 2020 |
Distributionally robust polynomial chance-constraints under mixture ambiguity sets JB Lasserre, T Weisser Mathematical Programming 185, 409-453, 2021 | 15 | 2021 |
Optimal control problems with oscillations, concentrations and discontinuities D Henrion, M Kružík, T Weisser Automatica 103, 159-165, 2019 | 15 | 2019 |
Deciding positivity of multisymmetric polynomials P Görlach, C Riener, T Weißer Journal of Symbolic Computation 74, 603-616, 2016 | 8 | 2016 |
Exploiting sparsity for semi-algebraic set volume computation. preprint M Tacchi, T Weisser, JB Lasserre, D Henrion arXiv preprint arXiv:1902.02976 2, 2019 | 4 | 2019 |
Computing approximations and generalized solutions using moments and positive polynomials T Weisser Université Paul Sabatier-Toulouse III, 2018 | 3 | 2018 |
Chance-constrained optimization for non-linear network flow problems T Weisser, L Roald, S Misra arXiv preprint arXiv:1803.02696, 2018 | 3 | 2018 |
Towards closing the acopf chapter S Gopinath, H Hijazi, T Weisser, H Nagarajan, M Yetkin, K Sundar, R Bent arXiv preprint arXiv:1910.03716, 2019 | 2 | 2019 |
SumOfSquares: A Julia package for Polynomial Optimization B Legat, T Weisser INFORMS Annual Meeting, 2020 | 1 | 2020 |
Representation of distributionally robust chanceconstraints JB Lasserre, T Weisser arXiv preprint arXiv:1803.11500, 2018 | 1 | 2018 |
Solving nearly sparse polynomial optimization problems T Weisser, JB Lasserre | 1 | 2017 |
Polynomial Inequalities arising from Triangles and Tetrahedra T Weißer Univesity of Konstanz, 2014 | | 2014 |
CALCUL PARCIMONIEUX POUR LES VOLUMES M TACCHI, T WEISSER, D HENRION, JB LASSERRE | | |