This article provides a new method for computing the probability of collision between two
spherical space objects involved in a short-term encounter under Gaussian-distributed …

Signomials are obtained by generalizing polynomials to allow for arbitrary real exponents.
This generalization offers great expressive power but has historically sacrificed the …

Following a polynomial approach, many robust fixed-order controller design problems can
be formulated as optimization problems whose set of feasible solutions is modeled by …

We show that integrating a polynomial f of degree t on an arbitrary simplex (with respect to
Lebesgue measure) reduces to evaluating t homogeneous related Bombieri polynomials of …

In distributionally robust optimization the probability distribution of the uncertain problem
parameters is itself uncertain, and a fictitious adversary, eg, nature, chooses the worst …

We consider the problem of minimizing a continuous function f over a compact set K K. We
analyze a hierarchy of upper bounds proposed by Lasserre (SIAM J Optim 21 (3): 864–885 …

Neural Radiance Fields and Gaussian Splatting have transformed the field of computer
vision by enabling photo-realistic representation of complex scenes. Despite this success …

Page 1 Jean Bernard Lasserre SPRINGER SERIES IN OPERATIONS RESEARCH AND
FINANCIAL ENGINEERING Linear and Integer Programming vs Linear Integration and Counting …

This paper deals with collision avoidance between two space objects involved in a long-
term encounter, assuming Keplerian linearized dynamics. The primary object is an active …

We investigate various properties of the sublevel set G={x: g (x)≤ 1} and the integration of h
on this sublevel set when g and h are positively homogeneous functions (and in particular …