Taming non convexity?

Representation of Chance-Constraints With Strong Asymptotic Guarantees

Autori: Jean B. Lasserre
Pubblicato in: IEEE Control Systems Letters, Numero 1/1, 2017, Pagina/e 50-55, ISSN 2475-1456
Editore: IEEE
DOI: 10.1109/LCSYS.2017.2704295

Determining projection constants of univariate polynomial spaces

Autori: Simon Foucart, Jean B. Lasserre
Pubblicato in: Journal of Approximation Theory, 2018, Pagina/e 74--91, ISSN 0021-9045
Editore: Academic Press
DOI: 10.1016/j.jat.2018.06.002

Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables

Autori: Cédric Josz, Daniel K. Molzahn
Pubblicato in: SIAM Journal on Optimization, Numero 28/2, 2018, Pagina/e 1017-1048, ISSN 1052-6234
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/15M1034386

Positive functionals and Hessenberg matrices

Autori: Jean B. Lasserre, Mihai Putinar
Pubblicato in: Proceedings of the American Mathematical Society, 2018, Pagina/e 1, ISSN 0002-9939
Editore: American Mathematical Society
DOI: 10.1090/proc/14266

Approximate optimal designs for multivariate polynomial regression

Autori: Yohann De Castro, Fabrice Gamboa, Didier Henrion, Roxana Hess, Jean-Bernard Lasserre
Pubblicato in: The Annals of Statistics, Numero 47/1, 2019, Pagina/e 127-155, ISSN 0090-5364
Editore: Institute of Mathematical Statistics
DOI: 10.1214/18-aos1683

Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions

Autori: Yohann De Castro, F. Gamboa, Didier Henrion, J.-B. Lasserre
Pubblicato in: IEEE Transactions on Information Theory, Numero 63/1, 2017, Pagina/e 621-630, ISSN 0018-9448
Editore: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2016.2619368

The empirical Christoffel function with applications in data analysis

Autori: Jean B. Lasserre, Edouard Pauwels
Pubblicato in: Advances in Computational Mathematics, 2019, Pagina/e 1--30, ISSN 1019-7168
Editore: Kluwer Academic Publishers
DOI: 10.1007/s10444-019-09673-1

Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?

Autori: Cédric Josz, Jean Bernard Lasserre, Bernard Mourrain
Pubblicato in: Advances in Computational Mathematics, 2019, ISSN 1019-7168
Editore: Kluwer Academic Publishers
DOI: 10.1007/s10444-019-09672-2

Optimal Data Fitting: A Moment Approach

Autori: Jean-Bernard Lasserre, Victor Magron
Pubblicato in: SIAM Journal on Optimization, Numero 28/4, 2018, Pagina/e 3127-3144, ISSN 1052-6234
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m1170108

A moment approach for entropy solutions to nonlinear hyperbolic PDEs

Autori: Swann Marx, Tillmann Weisser, Didier Henrion, Jean Bernard Lasserre
Pubblicato in: Mathematical Control & Related Fields, Numero 0/0, 2019, Pagina/e 0-0, ISSN 2156-8472
Editore: American Institute of Mathematical Sciences
DOI: 10.3934/mcrf.2019032

Volume of Sublevel Sets of Homogeneous Polynomials

Autori: Jean B. Lasserre
Pubblicato in: SIAM Journal on Applied Algebra and Geometry, Numero 3/2, 2019, Pagina/e 372-389, ISSN 2470-6566
Editore: SIAM
DOI: 10.1137/18m1222478

Computation of Chebyshev Polynomials for Union of Intervals

Autori: Simon Foucart, Jean Bernard Lasserre
Pubblicato in: Computational Methods and Function Theory, 2019, ISSN 1617-9447
Editore: Springer Verlag
DOI: 10.1007/s40315-019-00285-w

In SDP Relaxations, Inaccurate Solvers Do Robust Optimization

Autori: Jean-Bernard Lasserre, Victor Magron
Pubblicato in: SIAM Journal on Optimization, Numero 29/3, 2019, Pagina/e 2128-2145, ISSN 1052-6234
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m1225677

Distributionally robust polynomial chance-constraints under mixture ambiguity sets

Autori: Jean B. Lasserre, Tillmann Weisser
Pubblicato in: Mathematical Programming, 2019, ISSN 0025-5610
Editore: Springer Verlag
DOI: 10.1007/s10107-019-01434-8

Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets

Autori: Jean B. Lasserre, Youssouf Emin
Pubblicato in: Mathematics of Operations Research, 2019, ISSN 0364-765X
Editore: Institute for Operations Research and the Management Sciences
DOI: 10.1287/moor.2018.0980

A MAX-CUT formulation of 0/1 programs

Autori: Jean B. Lasserre
Pubblicato in: Operations Research Letters, Numero 44/2, 2016, Pagina/e 158-164, ISSN 0167-6377
Editore: Elsevier BV
DOI: 10.1016/j.orl.2015.12.014

A bounded degree SOS hierarchy for polynomial optimization

Autori: Jean B. Lasserre, Kim-Chuan Toh, Shouguang Yang
Pubblicato in: EURO Journal on Computational Optimization, Numero 5/1-2, 2017, Pagina/e 87-117, ISSN 2192-4414
Editore: Springer
DOI: 10.1007/s13675-015-0050-y

SPECTRA – a Maple library for solving linear matrix inequalities in exact arithmetic

Autori: Didier Henrion, Simone Naldi, Mohab Safey El Din
Pubblicato in: Optimization Methods and Software, 2017, Pagina/e 1-17, ISSN 1055-6788
Editore: Taylor & Francis
DOI: 10.1080/10556788.2017.1341505

Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems

Autori: V. Jeyakumar, J. B. Lasserre, G. Li, T. S. Phạm
Pubblicato in: SIAM Journal on Optimization, Numero 26/1, 2016, Pagina/e 753-780, ISSN 1052-6234
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/15M1017922

Moments and Legendre-Fourier Series for Measures Supported on Curves

Autori: Jean B. Lasserre
Pubblicato in: Symmetry, Integrability and Geometry: Methods and Applications, Numero 11, 2015, ISSN 1815-0659
Editore: Department of Applied Research, Institute of Mathematics of National Academy of Science of Ukraine
DOI: 10.3842/SIGMA.2015.077

Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity

Autori: Tillmann Weisser, Jean B. Lasserre, Kim-Chuan Toh
Pubblicato in: Mathematical Programming Computation, 2017, Pagina/e 1-32, ISSN 1867-2949
Editore: Springer Verlag
DOI: 10.1007/s12532-017-0121-6

Bound-Constrained Polynomial Optimization Using Only Elementary Calculations

Autori: Etienne de Klerk, Jean B. Lasserre, Monique Laurent, Zhao Sun
Pubblicato in: Mathematics of Operations Research, Numero 42/3, 2017, Pagina/e 834-853, ISSN 0364-765X
Editore: Institute for Operations Research and the Management Sciences
DOI: 10.1287/moor.2016.0829

Convergence rates of moment-sum-of-squares hierarchies for optimal control problems

Autori: Milan Korda, Didier Henrion, Colin N. Jones
Pubblicato in: Systems & Control Letters, Numero 100, 2017, Pagina/e 1-5, ISSN 0167-6911
Editore: Elsevier BV
DOI: 10.1016/j.sysconle.2016.11.010

Computing Gaussian & exponential measures of semi-algebraic sets

Autori: Jean B. Lasserre
Pubblicato in: Advances in Applied Mathematics, Numero 91, 2017, Pagina/e 137-163, ISSN 0196-8858
Editore: Academic Press
DOI: 10.1016/j.aam.2017.06.006

Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets

Autori: Milan Korda, Didier Henrion
Pubblicato in: Optimization Letters, 2017, ISSN 1862-4472
Editore: Springer Verlag
DOI: 10.1007/s11590-017-1186-x

Linear Conic Optimization for Inverse Optimal Control

Autori: Edouard Pauwels, Didier Henrion, Jean-Bernard Lasserre
Pubblicato in: SIAM Journal on Control and Optimization, Numero 54/3, 2016, Pagina/e 1798-1825, ISSN 0363-0129
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/14099454X

On inverse optimal control via polynomial optimization

Autori: Jeremy Rouot, Jean-Bernard Lasserre
Pubblicato in: 2017 IEEE 56th Annual Conference on Decision and Control (CDC), 2017, Pagina/e 721-726, ISBN 978-1-5090-2873-3
Editore: IEEE
DOI: 10.1109/CDC.2017.8263745

On Moment Problems with Holonomic Functions

Autori: Florent Bréhard, Mioara Joldes, Jean-Bernard Lasserre
Pubblicato in: Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation - ISSAC '19, 2019, Pagina/e 66-73, ISBN 9781-450360845
Editore: ACM Press
DOI: 10.1145/3326229.3326258

Volume of sub-level sets of polynomials

Autori: Jean B. Lasserre
Pubblicato in: 2019 18th European Control Conference (ECC), 2019, Pagina/e 1975-1980, ISBN 978-3-907144-00-8
Editore: IEEE
DOI: 10.23919/ecc.2019.8795995

Sorting out typicality with the inverse moment matrix SOS polynomial

Autori: Jean-Bernard Bernard Lasserre, Edouard Pauwels
Pubblicato in: Neural Information Processing Systems, Numero 29, 2016, Pagina/e 190--198, ISBN 9781-510838819
Editore: Curran Associates, Inc.

Positivity certificates in optimal control

Autori: Edouard Pauwels, Didier Henrion, Jean-Bernard Lasserre
Pubblicato in: Springer Tracts in Advanced Robotics - Geometric and Numerical Foundations of Movements, 2017, Pagina/e 113--132
Editore: Springer

Geometric and Numerical Foundations of Movements

Autori: Jean-Paul Laumond, Nicolas Mansard, Jean-Bernard Lasserre
Pubblicato in: Springer Tracts in Advanced Robotics, 2017, ISBN 978-3-319-51547-2
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-51547-2

Pubblicazioni

Condividi questa pagina

Scarica