| 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), 1-32, 2018 | 73 | 2018 |
| A moment approach for entropy solutions to nonlinear hyperbolic PDEs S Marx, T Weisser, D Henrion, J Lasserre arXiv preprint arXiv:1807.02306, 2018 | 22 | 2018 |
| Exploiting sparsity for semi-algebraic set volume computation M Tacchi, T Weisser, JB Lasserre, D Henrion Foundations of Computational Mathematics 22 (1), 161-209, 2022 | 19 | 2022 |
| Polynomial and moment optimization in Julia and JuMP T Weisser, B Legat, C Coey, L Kapelevich, JP Vielma JuliaCon. URL https://pretalx. com/juliacon2019/talk/QZBKAU, 2019 | 13 | 2019 |
| 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 | 11 | 2020 |
| Tractable semi-algebraic approximation using Christoffel-Darboux kernel S Marx, E Pauwels, T Weisser, D Henrion, J Lasserre arXiv preprint arXiv:1904.01833 2, 2019 | 11 | 2019 |
| Distributionally robust polynomial chance-constraints under mixture ambiguity sets JB Lasserre, T Weisser Mathematical Programming 185 (1), 409-453, 2021 | 9 | 2021 |
| Optimal control problems with oscillations, concentrations and discontinuities D Henrion, M Kružík, T Weisser Automatica 103, 159-165, 2019 | 9 | 2019 |
| Semi-algebraic approximation using Christoffel–Darboux kernel S Marx, E Pauwels, T Weisser, D Henrion, JB Lasserre Constructive Approximation 54 (3), 391-429, 2021 | 8 | 2021 |
| A bounded degree sos hierarchy for large scale polynomial optimization with sparsity T Weisser, JB Lasserre, KC Toh | 7 | 2016 |
| Deciding positivity of multisymmetric polynomials P Görlach, C Riener, T Weißer Journal of Symbolic Computation 74, 603-616, 2016 | 7 | 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 |
| Sumofsquares: A julia package for polynomial optimization B Legat, T Weisser INFORMS Annual Meeting, 2020 | 1 | 2020 |
| 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 | 1 | 2019 |
| Representation of distributionally robust chance-constraints J 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 | | |
