 | 2012 |
|---|
| 60 |       | Didier Henrion,
Jean B. Lasserre:
Inner Approximations for Polynomial Matrix Inequalities and Robust Stability Regions.
IEEE Trans. Automat. Contr. 57(6): 1456-1467 (2012) |
| 59 | | Jean B. Lasserre:
The existence of Gaussian cubature formulas.
Journal of Approximation Theory 164(5): 572-585 (2012) |
| 58 | | Rida Laraki,
Jean B. Lasserre:
Semidefinite programming for min-max problems and games.
Math. Program. 131(1-2): 305-332 (2012) |
| 2011 |
|---|
| 57 | | Jean B. Lasserre:
Inverse polynomial optimization.
CDC-ECE 2011: 2794-2799 |
| 56 | | Jean B. Lasserre,
Tung Phan Thanh:
Convex underestimators of polynomials.
CDC-ECE 2011: 7194-7199 |
| 55 | | Florian Bugarin,
Didier Henrion,
Jean B. Lasserre:
Minimizing the sum of many rational functions
CoRR abs/1102.4954: (2011) |
| 54 | | Cordian Riener,
Thorsten Theobald,
Lina Jansson Andrén,
Jean B. Lasserre:
Exploiting symmetries in SDP-relaxations for polynomial optimization
CoRR abs/1103.0486: (2011) |
| 53 | | Didier Henrion,
Jean B. Lasserre:
Inner approximations for polynomial matrix inequalities and robust stability regions
CoRR abs/1104.4905: (2011) |
| 52 | | Jean B. Lasserre:
Min-max and robust polynomial optimization.
J. Global Optimization 51(1): 1-10 (2011) |
| 51 | | Jean B. Lasserre:
On convex optimization without convex representation.
Optimization Letters 5(4): 549-556 (2011) |
| 50 | | Jean B. Lasserre:
A New Look at Nonnegativity on Closed Sets and Polynomial Optimization.
SIAM Journal on Optimization 21(3): 864-885 (2011) |
| 2010 |
|---|
| 49 | | Jean B. Lasserre,
Tung Phan Thanh:
A "joint+marginal" algorithm for polynomial optimization.
CDC 2010: 3871-3876 |
| 48 | | Jean B. Lasserre:
Certificates of convexity for basic semi-algebraic sets.
Appl. Math. Lett. 23(8): 912-916 (2010) |
| 47 | | Jean B. Lasserre:
On representations of the feasible set in convex optimization.
Optimization Letters 4(1): 1-5 (2010) |
| 46 | | Jean B. Lasserre:
A ``Joint+Marginal'' Approach to Parametric Polynomial Optimization.
SIAM Journal on Optimization 20(4): 1995-2022 (2010) |
| 45 | | Jean B. Lasserre,
Mihai Putinar:
Positivity and Optimization for Semi-Algebraic Functions.
SIAM Journal on Optimization 20(6): 3364-3383 (2010) |
| 2009 |
|---|
| 44 | | Carlo Savorgnan,
Jean B. Lasserre,
Moritz Diehl:
Discrete-time stochastic optimal control via occupation measures and moment relaxations.
CDC 2009: 519-524 |
| 43 | | Jean B. Lasserre,
Eduardo S. Zeron:
Certificates and relaxations for integer programming and the semi-group membership problem
CoRR abs/0905.1608: (2009) |
| 42 | | Jean B. Lasserre:
Moments and sums of squares for polynomial optimization and related problems.
J. Global Optimization 45(1): 39-61 (2009) |
| 41 | | Jean B. Lasserre:
The K-moment problem with densities.
Math. Program. 116(1-2): 321-341 (2009) |
| 40 | | Jean B. Lasserre:
Convex sets with semidefinite representation.
Math. Program. 120(2): 457-477 (2009) |
| 39 | | Jean B. Lasserre:
Convexity in SemiAlgebraic Geometry and Polynomial Optimization.
SIAM Journal on Optimization 19(4): 1995-2014 (2009) |
| 38 | | Didier Henrion,
Jean B. Lasserre,
Carlo Savorgnan:
Approximate Volume and Integration for Basic Semialgebraic Sets.
SIAM Review 51(4): 722-743 (2009) |
| 37 | | Jean B. Lasserre,
Monique Laurent,
Philipp Rostalski:
A prolongation-projection algorithm for computing the finite real variety of an ideal.
Theor. Comput. Sci. 410(27-29): 2685-2700 (2009) |
| 2008 |
|---|
| 36 | | Didier Henrion,
Jean B. Lasserre,
Carlo Savorgnan:
Nonlinear optimal control synthesis via occupation measures.
CDC 2008: 4749-4754 |
| 35 | | Jean B. Lasserre,
Monique Laurent,
Philipp Rostalski:
Computing the real variety of an ideal: a real algebraic and symbolic-numeric algorithm.
SAC 2008: 1845-1846 |
| 34 | | Rida Laraki,
Jean B. Lasserre:
Semidefinite programming for N-Player Games
CoRR abs/0810.3150: (2008) |
| 33 | | Jean B. Lasserre,
Monique Laurent,
Philipp Rostalski:
Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals.
Foundations of Computational Mathematics 8(5): 607-647 (2008) |
| 32 | | Jean B. Lasserre:
A semidefinite programming approach to the generalized problem of moments.
Math. Program. 112(1): 65-92 (2008) |
| 31 | | Dimitris Bertsimas,
Xuan Vinh Doan,
Jean B. Lasserre:
Approximating integrals of multivariate exponentials: A moment approach.
Oper. Res. Lett. 36(2): 205-210 (2008) |
| 30 | | Jean B. Lasserre,
Didier Henrion,
Christophe Prieur,
Emmanuel Trélat:
Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations.
SIAM J. Control and Optimization 47(4): 1643-1666 (2008) |
| 2007 |
|---|
| 29 | | Jean B. Lasserre,
Eduardo S. Zeron:
Simple Explicit Formula for Counting Lattice Points of Polyhedra.
IPCO 2007: 367-381 |
| 2006 |
|---|
| 28 | | Jean B. Lasserre:
Convergent SDP-Relaxations for Polynomial Optimization with Sparsity.
ICMS 2006: 263-272 |
| 27 | | Jean B. Lasserre:
Robust global optimization with polynomials.
Math. Program. 107(1-2): 275-293 (2006) |
| 26 | | Jean B. Lasserre:
A Sum of Squares Approximation of Nonnegative Polynomials.
SIAM Journal on Optimization 16(3): 751-765 (2006) |
| 25 | | Jean B. Lasserre:
Convergent SDP-Relaxations in Polynomial Optimization with Sparsity.
SIAM Journal on Optimization 17(3): 822-843 (2006) |
| 24 | | Didier Henrion,
Jean B. Lasserre:
LMIs for constrained polynomial interpolation with application in trajectory planning.
Systems & Control Letters 55(6): 473-477 (2006) |
| 2005 |
|---|
| 23 | | Jean B. Lasserre:
Erratum to "Generating functions and duality for integer programs": [Discrete Optimization 1 (2) (2004) 167-187].
Discrete Optimization 2(1): 1 (2005) |
| 22 | | Jean B. Lasserre,
Eduardo S. Zeron:
An Alternative Algorithm for Counting Lattice Points in a Convex Polytope.
Math. Oper. Res. 30(3): 597-614 (2005) |
| 21 | | Jean B. Lasserre:
Polynomial Programming: LP-Relaxations Also Converge.
SIAM Journal on Optimization 15(2): 383-393 (2005) |
| 20 | | Jean B. Lasserre:
Sum of Squares Approximation of Polynomials, Nonnegative on a Real Algebraic Set.
SIAM Journal on Optimization 16(2): 610-628 (2005) |
| 2004 |
|---|
| 19 | | Jean B. Lasserre:
The Integer Hull of a Convex Rational Polytope.
Discrete & Computational Geometry 32(1): 129-139 (2004) |
| 18 | | Jean B. Lasserre:
A discrete Farkas lemma.
Discrete Optimization 1(1): 67-75 (2004) |
| 17 | | Jean B. Lasserre:
Generating functions and duality for integer programs.
Discrete Optimization 1(2): 167-187 (2004) |
| 16 | | Jean B. Lasserre:
Integer programming, Barvinok's counting algorithm and Gomory relaxations.
Oper. Res. Lett. 32(2): 133-137 (2004) |
| 2003 |
|---|
| 15 | | Jean B. Lasserre:
A Discrete Farkas Lemma.
ICCSA (1) 2003: 273-281 |
| 14 | | Jean B. Lasserre:
The Integer Hull of a Convex Rational Polytope.
ICCSA (3) 2003: 866-875 |
| 13 | | Didier Henrion,
Jean B. Lasserre:
GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi.
ACM Trans. Math. Softw. 29(2): 165-194 (2003) |
| 12 | | Jean B. Lasserre,
Eduardo S. Zeron:
On Counting Integral Points in a Convex Rational Polytope.
Math. Oper. Res. 28(4): 853-870 (2003) |
| 2002 |
|---|
| 11 | | Didier Henrion,
Jean B. Lasserre:
Solving Global Optimization Problems over Polynomials with GloptiPoly 2.1.
COCOS 2002: 43-58 |
| 10 | | Jean B. Lasserre:
Semidefinite Programming vs. LP Relaxations for Polynomial Programming.
Math. Oper. Res. 27(2): 347-360 (2002) |
| 9 | | Jean B. Lasserre,
Eduardo S. Zeron:
Solving the knapsack problem via Z-transform.
Oper. Res. Lett. 30(6): 394-400 (2002) |
| 8 | | Jean B. Lasserre:
An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs.
SIAM Journal on Optimization 12(3): 756-769 (2002) |
| 2001 |
|---|
| 7 | | Jean B. Lasserre:
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs.
IPCO 2001: 293-303 |
| 6 | | Jean B. Lasserre,
Eduardo S. Zeron:
A Laplace transform algorithm for the volume of a convex polytope.
J. ACM 48(6): 1126-1140 (2001) |
| 5 | | Jean B. Lasserre:
Global Optimization with Polynomials and the Problem of Moments.
SIAM Journal on Optimization 11(3): 796-817 (2001) |
| 2000 |
|---|
| 4 | | Jean B. Lasserre:
Why the logarithmic barrier function in convex and linear programming?
Oper. Res. Lett. 27(4): 149-152 (2000) |
| 3 | | Onésimo Hernández-Lerma,
Jean B. Lasserre:
Zero-Sum Stochastic Games in Borel Spaces: Average Payoff Criteria.
SIAM J. Control and Optimization 39(5): 1520-1539 (2000) |
| 1993 |
|---|
| 2 | | Jean B. Lasserre:
Reachable, controllable sets and stabilizing control of constrained linear systems.
Automatica 29(2): 531-536 (1993) |
| 1992 |
|---|
| 1 |  | Jean B. Lasserre,
Maurice Queyranne:
Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling.
IPCO 1992: 136-149 |
Data released under the ODC-BY 1.0 license — See also our legal information page