Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Lasserre, Jean Bernard
679  Ergebnisse:
Personensuche X
?
1

Stokes, Gibbs, and Volume Computation of Semi-Algebraic Set:

Tacchi, Matteo ; Lasserre, Jean Bernard ; Henrion, Didier
Discrete & Computational Geometry.  69 (2022)  1 - p. 260-283 , 2022
Link: https://doi.org/10.1007/..
 
?
2

Graph Recovery from Incomplete Moment Information:

Henrion, Didier ; Lasserre, Jean Bernard
Constructive Approximation.  56 (2022)  1 - p. 165-187 , 2022
Link: https://doi.org/10.1007/..
 
?
3

Exploiting Sparsity for Semi-Algebraic Set Volume Computati..:

Tacchi, Matteo ; Weisser, Tillmann ; Lasserre, Jean Bernard.
Foundations of Computational Mathematics.  22 (2021)  1 - p. 161-209 , 2021
Link: https://doi.org/10.1007/..
 
?
4

Dual optimal design and the Christoffel–Darboux polynomial:

De Castro, Yohann ; Gamboa, Fabrice ; Henrion, Didier.
Optimization Letters.  15 (2021)  1 - p. 3-8 , 2021
Link: https://doi.org/10.1007/..
 
?
5

Semi-algebraic Approximation Using Christoffel–Darboux Kern..:

Marx, Swann ; Pauwels, Edouard ; Weisser, Tillmann..
Constructive Approximation.  54 (2021)  3 - p. 391-429 , 2021
Link: https://doi.org/10.1007/..
 
?
6

Minimizing Rational Functions: A Hierarchy of Approximation..:

Lasserre, Jean Bernard ; Magron, Victor ; Marx, Swann.
SIAM Journal on Optimization.  31 (2021)  3 - p. 2285-2306 , 2021
Link: https://doi.org/10.1137/..
 
?
7

Nonnegative forms with sublevel sets of minimal volume:

Kozhasov, Khazhgali ; Lasserre, Jean Bernard
Mathematical Programming.  193 (2020)  1 - p. 485-498 , 2020
Link: https://doi.org/10.1007/..
 
?
8

Computation of Chebyshev Polynomials for Union of Intervals:

Foucart, Simon ; Lasserre, Jean Bernard
Computational Methods and Function Theory.  19 (2019)  4 - p. 625-641 , 2019
Link: https://doi.org/10.1007/..
 
?
9

Sparse polynomial interpolation: sparse recovery, super-res..:

Josz, Cédric ; Lasserre, Jean Bernard ; Mourrain, Bernard
Advances in Computational Mathematics.  45 (2019)  3 - p. 1401-1437 , 2019
Link: https://doi.org/10.1007/..
 
?
10

Minimizing the sum of many rational functions:

Bugarin, Florian ; Henrion, Didier ; Lasserre, Jean Bernard
Mathematical Programming Computation.  8 (2015)  1 - p. 83-111 , 2015
Link: https://doi.org/10.1007/..
 
?
11

Optimization as motion selection principle in robot action:

Laumond, Jean-Paul ; Mansard, Nicolas ; Lasserre, Jean Bernard
Communications of the ACM.  58 (2015)  5 - p. 64-74 , 2015
Link: https://dl.acm.org/doi/1..
 
?
12

Algebraic–exponential Data Recovery from Moments:

Lasserre, Jean Bernard ; Putinar, Mihai
Discrete & Computational Geometry.  54 (2015)  4 - p. 993-1012 , 2015
Link: https://doi.org/10.1007/..
 
?
13

Optimization as motion selection principle in robot action:

Laumond, Jean-Paul ; Mansard, Nicolas ; Lasserre, Jean Bernard
Communications of the ACM.  58 (2015)  5 - p. 64-74 , 2015
Link: https://doi.org/10.1145/..
 
?
14

Structured Function Systems and Applications:

Charina, Maria ; Lasserre, Jean Bernard ; Putinar, Mihai.
Oberwolfach Reports.  10 (2013)  1 - p. 579-655 , 2013
Link: https://doi.org/10.4171/..
 
?
15

On representations of the feasible set in convex optimizati..:

Lasserre, Jean Bernard
Optimization Letters.  4 (2009)  1 - p. 1-5 , 2009
Link: https://doi.org/10.1007/..
 
1-15