#### Filter Results:

- Full text PDF available (51)

#### Publication Year

1980

2018

- This year (0)
- Last 5 years (35)
- Last 10 years (94)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jean B. Lasserre
- SIAM Journal on Optimization
- 2000

We consider the problem of finding the unconstrained global minimum of a real-valued polynomial p(x): {\mathbb{R}}^n\to {\mathbb{R}}$, as well as the global minimum of p(x), in a compact set K… (More)

1 Introduction and Summary.- 1.1 Introduction.- 1.2 Markov control processes.- 1.3 Preliminary examples.- 1.4 Summary of the following chapters.- 2 Markov Control Processes.- 2.1 Introduction.- 2.2… (More)

- Jean B. Lasserre
- 2009

. From a theoretical viewpoint, the GPM has developments and impact in var-ious area of Mathematics like algebra, Fourier analysis, functional analysis, operator theory, probabilityand statistics, to… (More)

7 Ergodicity and Poisson's Equation.- 7.1 Introduction.- 7.2 Weighted norms and signed kernels.- A. Weighted-norm spaces.- B. Signed kernels.- C. Contraction maps.- 7.3 Recurrence concepts.- A.… (More)

- Jean B. Lasserre
- SIAM Journal on Optimization
- 2002

We consider the general nonlinear optimization problem in 0-1 variables and provide an explicit equivalent positive semidefinite program in 2n-1 variables. The optimal values of both problems are… (More)

- Jean B. Lasserre
- IPCO
- 2001

We consider the general nonlinear optimization problem in 0- 1 variables and provide an explicit equivalent convex positive semidefinite program in 2n - 1 variables. The optimal values of both… (More)

- Didier Henrion, Jean B. Lasserre, Johan Löfberg
- Optimization Methods and Software
- 2007

We describe a major update of our Matlab freeware GloptiPoly for parsing generalized problems of moments and solving them numerically with semidefinite programming.

- Jean B. Lasserre, Didier Henrion, Christophe Prieur, Emmanuel Trélat
- SIAM J. Control and Optimization
- 2007

We consider the class of nonlinear optimal control problems (OCP) with polynomial data, i.e., the differential equation, state and control con- straints and cost are all described by polynomials, and… (More)

- Didier Henrion, Jean B. Lasserre
- IEEE Transactions on Automatic Control
- 2006

Using a moment interpretation of recent results on sum-of-squares decompositions of nonnegative polynomial matrices, we propose a hierarchy of convex linear matrix inequality (LMI) relaxations to… (More)

- Jean B. Lasserre
- SIAM Journal on Optimization
- 2006

We consider a polynomial programming problem $\P$ on a compact basic semialgebraic set $\K\subset\R^n$, described by $m$ polynomial inequalities $g_j(X)\geq0$, and with criterion $f\in\R[X]$. We… (More)