2018
2017
2016
· Lasserre J.B.
(2016)
" Lebesgue
decomposition in action via semidefinite relaxations" Adv. Comput. Math. 42
pp. 1129--1148.
· Pauwels E.,
Henrion D., Lasserre J.B. (2016)
" Linear Conic
Optimization for Inverse Optimal Control" SIAM J. Control & Optim. 54
pp. 1798--1825.
. Lasserre J.B.,
Pauwels E. (2016)
" Sorting out typicality
via the inverse moment matrix SOS polynomial" In Advances in Neural Information Processing
Systems 29 (NIPS 2016, Barcelona), D.D. Lee and M. Sugiyama and U.V. Luxburg
and I. Guyon and R. Garnett, Eds., Curran Associates, Inc. 2016, pp. 190—198.
· Lasserre J.B.
(2016)
"Convex optimization
and parsimony of Lp balls representation" SIAM J. Optim. 26
pp. 247--273.
· Jeyakumar V,
Lasserre J.B., G. Li, Tien Son Pham (2016)
"Convergent
semidefinite relaxations for global bilevel polynomial optimization
problems" SIAM J.
Optim. 26 pp.
753--780.
· Hess R., Henrion
D., Lasserre J.B., Tien Son Pham (2016)
"Semidefinite approximations
of the polynomial abscissa" SIAM J. Control & Optim. 54
pp. 1633--1656.
· Bugarin F.,
Henrion D., Lasserre J.B. (2016)
"Minimizing the sum
of many rational functions" Math. Programming Comput. 8
pp. 83--111.
· Serra R.,
Arzelier D., Joldes M., Lasserre J.B., Rondepierre A., Salvy B. (2016)
"Fast and Accurate
Computation of Orbital Collision Probability for Short-Term
Encounters" J.
Guidance, Control & Dynamics 39 pp. 1--13.
· Lasserre J.B.
(2016)
"A MAX-CUT
formulation of 0/1 programs" Oper. Res. Letters 44 pp. 158--164.
2015
· Magron V.,
Henrion D., Lasserre J.B. (2015)
"Semidefinite
approximations of projections and polynomial images of semi-algebraic
sets" SIAM J.
Optim. 25 pp.
2143--2164.
· Chin E.B., Lasserre J.B., Sukumar N. (2015)
"Numerical
integration of homogeneous functions on convex and nonconvex polygons and
polyhedra" Comput.
Mech. 56 pp.
967--981.
· Lasserre J.B., Putinar M. (2015)
"Algebraic-exponential
Data Recovery from Moments" Discrete & Comput. Geom. 54
pp. 993--1012.
· Lasserre J.B. (2015)
"Volume of slices
and sections of the simplex in closed form" Optim. Letters 9, No 7,
pp. 1263----1269.
. Bugarin F., Bartoli
A., Henrion D., Lasserre J.B., Orteu J.J., Sentenac T. (2015)
"Rank-constrained
fundamental matrix estimation by polynomial global optimization versus the
eight-point algorithm" J. Math. Imaging & Vision 53, No1,
pp. 42--60.
. Laumond J.-P.,
Mansard N., Lasserre J.B. (2015)
"Optimization as
motion selection principle in robot action" Communications of the ACM 58, No 5
pp. 64--74.
. Lasserre
J.B. (2015)
"A generalization of
L_wner-John's ellipsoid theorem" Math. Program. 152, No 1
pp. 559--591.
.
Lasserre J.B. (2015)
"Tractable approximations
of sets defined with quantifiers" Math. Programming 151 pp.
507--527.
.
Lasserre J.B. (2015)
"Level sets and non
Gaussian integrals of positively homogeneous functions" Int. Game Theory Review 17 No 1,
.
Lasserre J.B. (2015)
"Moments and
Legendre-Fourier Series for Measures supported on Curves" SIGMA 11 No 077, 10
pages.
2014
· Claeys M., Arzelier D., Henrion D., Lasserre
J.B. (2014)
"Measures and LMIs
for impulsive nonlinear optimal control" IEEE Trans. Aut. Control 59, pp.
1374--1379.
· Jeyakumar V., Lasserre J.B., Li G. (2014)
"On polynomial
optimization over non-compact semi-algebraic sets" J. Optim. Theor. Appl. 163, pp.
707--718.
· Henrion D., Lasserre J.B., Mevissen M. (2014)
"Mean squared error
minimization for inverse moment problems" Appl. Math. Optim. 70, pp.
83--110.
· Cerone V., Lasserre J.B., Piga D., Regruto, D.
(2014)
"A unified framework
for solving a general class of conditional and robust set-membership estimation
problems" IEEE
Trans Auto. Control 59, pp. 2897--2909.
· Magron V., Henrion D., Lasserre J.B. (2014)
"Approximating
Pareto curves using semidefinite relaxations" Operations Res. Letters 42, pp.
432--4437.
· Lasserre J.B. (2014)
"New approximations
for the cone of copositive matrices and its dual" Math. Program. 144, pp.
265--276.
· Laumond J.-P., N. Mansard, J.B. Lasserre
(2014)
"Optimality in Robot
Morion: Optimal Versus Optimized Motion" Communications of the ACM 57, pp.
82--89.
· Ghasemi, M., Lasserre J.B., Marshall M. (2014)
"Lower bounds on the
global minimum of a polynomial" Comput. Optim. Appl. 57, pp. 387--402.
2013
· Lasserre J.B. (2013)
"The K-moment
problem for continuous functionals" Trans. Amer. Math. Soc. 365, pp.
2489--2504.
· Lasserre J.B. (2013)
"Borel measures with
a density on a compact semi-algebraic set". Archiv. der
Mathematik 101, pp. 361--371.
· Lasserre J.B. (2013)
"Inverse polynomial
optimization". Math. Oper. Res. 38, pp. 418--436
· Lasserre J.B. (2013)
"Recovering an
homogeneous polynomials from moments of its levels set". Discrete & Comput. Geom. 50, pp.
673--678
· Lasserre J.B. (2013)
"A Lagrangian
relaxation view of linear and semidefinite hierarchies". SIAM J. Optim. 23, pp.
1742--1756
· Riener C., Theobald T., Jansson A.L., Lasserre
J.B. (2013)
"Exploiting symmetries
in SDP-relaxations for polynomial optimization". Math. Oper. Res. 38, pp.
122--141
· Avrachenkov K. and Lasserre J.B. (2013)
"Analytic perturbation
of generalized inverses". Linear Algebra & Applications 438, pp.
1793--1813
· Lasserre J.B. and Tung Phan Thanh (2013)
"Convex
underestimators of polynomials". J. Global Optim. 56, pp. 1--25.
· Lasserre J.B., Laurent M., Mourrain B.,
Rostalski P. and P. Trebuchet (2013)
"Moment matrices,
border bases and real radical computation". J. Symbolic Computation 51, pp.
63--85.
2012
· Blekherman G. and Lasserre J.B. (2012)
"The truncated K-moment
problem for closure of open sets". J. Functional Anal. 263, pp.
3604--3616
· Laraki R. and J.B. Lasserre (2012)
"Semidefinite
programming for min-max problems and games". Math. Program. S_r. A 131, pp.
305--332
· Gravin N., Lasserre J.B., Pasechnik D. and
Robins S. (2012)
"The Inverse Moment
Problem for Convex Polytopes" Discrete & Comp. Geom. 48, pp.
596--621
· Henrion D. and J.B. Lasserre (2012)
"Inner
approximations for polynomial matrix inequalities and robust stability
regions". IEEE
Transactions Aut. Control 57, pp. 1456--1467.
· Lasserre J.B. (2012)
"The existence of
Gaussian cubature forrmulas". J. Approximation Theory 164, pp.
572--585.
· Lasserre J.B. (2012)
"An algorithm for
semi-infinite polynomial optimization". TOP 20, pp. 119--129
· Lasserre J.B. and Tung Phan Thanh (2012)
"A
``joint+marginal" heuristic for 0/1 programs". J. Global Optim. 54, pp.
729--744
2011
· Lasserre J.B. (2011)
"A new look at nonnegativity
on closed sets and polynomial optimization". SIAM J. Optim. 21, pp.
864--885.
· Lasserre J.B. (2011)
"On convex
optimization without convex representation". Optimization Letters 5, pp.
549--556..
· Lasserre J.B. (2011)
"Bounding the
support a measure from its marginal moments". Proc. Amer. Math. Soc. 139, pp.
3375--3382.
· Lasserre J.B. (2011)
"Min-max and robust
polynomial optimization". J. Global Optim. 51, pp. 1--10.
2010
· Lasserre J.B. and E.S. Zeron (2010)
"Lp-norms, log-barriers
and Cramer transform in optimization". Set-Valued and Var. Anal. 18, pp.
513--530.
· Lasserre J.B. and M. Putinar (2010)
"Positivity and
optimization for semi-algebraic functions". Siam J. Optim. 20, pp.
3364--3383.
· Lasserre J.B. (2010)
"On representations
of the feasible set in convex optimization". Optim. Letters 4, pp.
1--7.
· Lasserre J.B. (2010)
"Certificates of
convexity for basic semi-algebraic sets". Applied Math. Letters 23, pp.
912--916.
· Lasserre J.B. (2010)
"A
"joint+marginal" approach to parametric polynomial
optimization". SIAM J. Optim. 20, pp. 1995--2022.
2009
· Lasserre J.B. (2009)
"Convex sets with
semidefinite representation". Math. Prog. 120,
pp.
457--477.
doi:10.1007/s10107-008-0222-0
· Henrion D., Lasserre J.B., Savorgnan C. (2009)
"Approximate volume and
integration for basic semialgebraic sets". SIAM Review 51, pp.
722--743.
· Henrion D., Lasserre J.B., Lofberg J. (2009)
"Gloptipoly 3:
moments, optimization and semidefinite programming". Optim. Methods and Softwares 24, pp.
761--779.
· Lasserre J.B. (2009)
"The K-moment problem
with densities". Math. Prog. 116, pp. 321--341.
doi:10.1007/s10107-007-0118-4
· Lasserre J.B. (2009)
"Moments and sums of
squares for polynomial optimization and related problems". J. Global Optim. 45, pp.
39--61.
doi:10.1007/s10898-008-9394-7
· Lasserre J.B. (2009)
"Convexity in
semialgebraic geometry and polynomial optimization". SIAM J. Optim. 19, pp.
1995--2014.
doi:10.1137/080728214
· Lasserre J.B., Laurent M, Rostalski P. (2009)
"A
prolongation-projection algorithm for computing the finite real variety of an
ideal". Theor.
Comp. Sci. 410, pp. 2685--2700.
2008
· Laraki R., Lasserre J.B. (2008)
"Computing uniform
convex approximations for convex envelopes and convex hulls". J. Convex Analysis 15, pp.
635--654.
http://www.heldermann.de/JCA/JCA15/JCA153/jca15044.htm
· Bertsimas D., Xuan Vinh Doan, Lasserre J.B. (2008)
"Approximating
integrals of multivariate exponentials: A moment approach". Oper. Res. Letters 36, pp.
205--210.
· Lasserre J.B., M. Laurent, P. Rostalski (2008)
"Semidefinite
characterization and computation of zero-dimensional real radical
ideals". Found.
Comput. Math. 8, pp. 607--647.
· Helton, J.W., Lasserre J.B., Putinar M. (2008)
"Measures with zeros
in the inverse of their moment matrix". Annals Prob. 36, pp.
1453--1471.
· Lasserre J.B (2008)
"Representation of
nonnegative convex polynomials". Arch. der Mathematik 91, pp. 126--130.
· Lasserre J.B., Henrion D., Prieur C., Trelat E. (2008)
"Nonlinear optimal
control via occupation measures and LMI-relaxations". SIAM J. Contr. Optim. 47, pp.
1649--1666.
· Lasserre J.B. (2008)
"A Semidefinite
programming approach to the generalized problem of moments". Math. Prog. 112, pp.
65--92. doi:10.1007/s10107-006-0085-1
2007
· Lasserre J.B., E.S. Zeron (2007)
"Simple explicit
formula for counting lattice points of polyhedra". Lecture Notes in Computer Science 4513,
Springer Verlag pp. 367--381.
· Lasserre J.B. (2007)
"A sum of squares
approximation of nonnegative polynomials". SIAM Review 49, pp.
651--669. (SIGEST section of SIAM Review) doi: 10.1137/070693709
· Lasserre J.B. (2007)
"A new hierarchy of
SDP-relaxations for polynomial programming". Pacific J. Optim. 3, pp.
273--299.
· Lasserre J.B. (2007)
"Sufficient
conditions for a polynomial to be a sum of squares". Arch. Math. 89, pp.
390--398. doi: 10.1007/s00013-007-2251-y
2006
· Lasserre J.B. (2006)
"Convergent
SDP-relaxations in polynomial optimization with sparsity". SIAM J. Optim. 17, pp.
822--843. doi:10.1137/05064504X
· Lasserre J.B., Prieto-Rumeau T., Zervos M. (2006)
"Pricing a class of
exotic options via moments and SDP relaxations". Mathematical Finance 16, pp.
469--494. doi:10.1111/j.1467-9965.2006.00279.x
· Lasserre J.B., Netzer T. (2006)
"SOS approximations
of nonnegative polynomials via simple high degree perturbations". Math. Zeitschrift 256, pp.
99--112. doi:10.1007/s00209-006-0061-8
· Henrion D., Lasserre J.B. (2006)
"Convergent
relaxations of polynomial matrix inequalities and static output
feedback". IEEE
Trans. Auto. Control 51, pp. 192--202. doi:10.1016/j.sysconle.2005.09.011
· Henrion D., Lasserre J.B. (2006)
"LMIs for
constrained polynomial interpolation with application in trajectory
planning". Systems
Contr. Letters 55, pp. 473--477.
· Lasserre J.B. (2006)
"A moment approach
to analyze zeros of triangular polynomials sets". Trans. Amer. Math. Soc. 358, pp.
1403--1420.
· Lasserre J.B. (2006)
"Robust global
optimization with polynomials". Math. Programming Ser. B 107, pp.
275--293.
· Lasserre J.B. (2006)
"A sum of squares
approximation of nonnegative polynomials". SIAM J. Optim. 16, pp.
751--765.
2005
· Lasserre J.B. (2005)
"SOS approximations
of polynomials nonnegative on a real algebraic set". SIAM J. Optim. 16, pp.
610--628.
· Lasserre J.B. (2005)
"Integer programming
duality and superadditive functions". Contemporary Mathematics 374, pp.
139--150.
· Lasserre J.B., Zeron E.S. (2005)
"An alternative
algorithm for counting lattice points in a convex polytope". Math. Oper. Res. 30, pp.
597--614.
· Fontan G., Merce C., Hennet J-C., and Lasserre J.B. (2005)
" Hierarchical
scheduling for decision support". J. Intelligent Manufacturing 16, pp.
235--244.
2004
· Lasserre J.B. (2004)
"The integer hull of
a convex rational polytope". Discr. Comp. Geom 32, pp. 129--139.
DOI:10.1007/s00454-003-0834-3
· Lasserre J.B. (2004)
"Integer Programming
Duality". in: Trends in Optimization. Proc. Symp. Appl. Math. 61, pp.
67--83.
· Lasserre J.B. (2004)
"Polynomial
programming: LP-relaxations also converge". SIAM J. Optim. 15, pp.
383--393.
DOI:10.1137/040603942
· Lasserre J.B. and Prieto-Rumeau T. (2004)
"SDP vs. LP
Relaxations for the Moment Approach in Some Performance Evaluation
Problems". Stoch.
Models 20, pp. 439--456.
DOI:10.1081/STM-200033112
· Lasserre J.B. (2004)
"Generating functions
and duality for integer programs". Discrete Optim. 1, pp.
167--187.
· D. Henrion and Lasserre J.B. (2004)
"Solving nonconvex
optimization problems". IEEE Control Systems Magazine 24, pp.
72--83.
DOI:10.1109/MCS.2004.1299534
· Lasserre J.B. (2004)
"Characterizing
polynomials with roots in a semialgebraic set". IEEE Trans. Aut. Contr. 49, pp.
727--730.
· Lasserre J.B. (2004)
"A discrete Farkas
lemma". Discrete
Optimization 1, pp. 67-75.
2003
· Lasserre J.B. and E.S. Zeron (2003)
"On counting
integral points in a convex rational polytope". Math. Oper. Res. 28, pp.
853--870.
· Henrion D. and J.B. Lasserre (2003)
"GloptiPoly : Global
Optimization over Polynomials with Matlab and SeDuMi". ACM Trans. Math. Soft. 29, pp. 165--194.
· Lasserre J.B. (2003)
"Integer
programming, Barvinok's counting algorithm and Gomory
relaxations". Oper. Res. Letters . 32 , pp. 133--137.
2002
· Lasserre J.B. (2002) "La valeur optimale des programmes entiers". C.R. Acad. Sci. Paris,
Ser. I 335 , pp. 863--866.
· Lasserre J.B. (2002) "Polynomials with all zeros real and in a prescribed
interval". J. Algebraic Combinatorics 16 , pp. 231--237.
DOI:10.1023/A:1021848304877
· Lasserre J.B. and
E.S. Zeron (2002) "Solving the knapsack problem via
Z-transform". Oper.
Res. Letters 30, pp. 394--400.
· Lasserre J.B. (2002) "Semidefinite programming vs. LP relaxations for polynomial
programming". Math.
Oper. Res. 27, pp. 347--360.
doi:10.1287/moor.27.2.347.322
· Lasserre J.B. (2002) "Bounds on measures satisfying moment conditions". Annals Appl. Prob. 12, pp. 1114-1137.
DOI:10.1214/aoap/1031863183
· Lasserre J.B. (2002) "An explicit equivalent positive semidefinite program
for nonliner 0-1 programs". SIAM J. Optim. 12, pp. 756--769.
DOI: 10.1137/S1052623400380079
· Lasserre J.B. (2002) "Polynomials nonnegative on a grid and discrete
optimization". Trans. Amer. Math. Soc. 354, pp. 631--649.
· Lasserre J.B. and
J-B. Hiriart-Urruty (2002). "Mathematical properties of
optimization problems defined by positively homogeneous functions".
J. Optim. Theor. Appl. 112, pp. 31--52.
· Dauzere-Peres S. and Lasserre J.B. (2002)
"On the importance
of sequencing decisions in production planning and scheduling". Int.
Trans. Oper. Res. 9 , pp.
779--793.
· Avrachenkov K.E. and J.B. Lasserre (2002). "Analytic perturbation of Sylvester matrix
equations", IEEE
Trans. Aut. Contr. 47, pp. 1116--1119.
2001
· Lasserre J.B. (2001) "A quick proof for the volume of n-balls". Amer. Math. Monthly 108, 768--769.
· Lasserre J.B. and
E.S. Zeron(2001) "Solving a class of multivariable integration problems via
Laplace Lechniques". Appl. Math. (Warsaw) 28, pp. 391--405.
· Lasserre J.B. and
E.S. Zeron(2001) "A Laplace transform algorithm for the volume of a convex
polytope". Journal
of the ACM 48, pp.
1126--1140.
DOI:10.1145/504794.504796.
· Hernandez-Lerma and J.B. Lasserre (2001) "On the probabilistic multichain Poisson
equation". Appl.
Math. (Warsaw) 28, pp.
225--243.
· Lasserre J.B.
and K.E. Avrachenkov (2001) "The multi-dimensional version of
$\int_a^b x^p dx$. " Amer. Math. Monthly 108, pp. 151--154.
· Hernandez-Lerma and J.B. Lasserre (2001) "Zero-sum stochastic games
in Borel spaces: average payoff criteria". SIAM J. Contr. Optim. 39, pp. 1520--1539.
· Quadrat
J-P., Lasserre J.B. and J.-B. Hiriart-Urruty (2001). "Pythagoras' theorem for areas". Amer. Math. Monthly 108, pp. 549--551.
· Lasserre J.B.
(2001) "Duality and
randomization in nonlinear programming ". ANZIAM J. 42 (E), pp. E27--E68. (formerly
J. Aust. Math. Soc.
Series B)
· Hernandez-Lerma and J.B. Lasserre (2001) "Further criteria for positive Harris
recurrence of Markov chains" Proc. Amer. Math. Soc. 129, pp. 1521--1524.
· Lasserre J.B.
and C.E.M. Pearce (2001) "On the existence of
quasistationary measure for a Markov chain" Annals of Probability 29, pp. 437--446.
· Lasserre J.B.
(2001) "Global optimization
with polynomials and the problem of moments" SIAM J. Optimization 11, pp
796--817.
DOI:10.1137/S1052623400366802
2000
· Lasserre J.B. (2000)
"Why the Logarithmic Barrier Function in convex and linear
programming?" Oper.
Res. Letters. 27, pp.
149--152.
· Filar J. and Lasserre J.B. (2000)
"A non-standard branch and bound method for the Hamiltonian cycle
problem" ANZIAM
J. 42 (E), pp.
C586--C607 (formerly J. Aust. Math. Soc., Series B).
· Lasserre J.B. (2000)
"Optimisation globale et theorie des moments" C. R. Acad. Sci. Paris, 331,
Serie 1, pp.
929--934.
· Hernandez-Lerma O. and Lasserre J.B. (2000)
"Fatou's and Lebesgue's convergence
theorems for measures". J. Appl. Math. Stoch. Anal 13, pp. 137--146.
· Hernandez-Lerma O. and Lasserre J.B. (2000)
"On the classification of Markov chains
via occupation measures". Appl. Math. (Warsaw) 27, pp. 489--498.
· Lasserre J.B. (2000)
"Quasi-Feller Markov chains ".
J. Appl.
Math. Stoch. Anal 13, pp. 15--24.
1999
· Lasserre
J.B. (1999)
"Sample-path
average optimality for Markov control processes".IEEE Trans. Auto. Contr. 44, pp. 1966--1971.
· Avrachenkov
K. and Lasserre J.B. Lasserre (1999)
"The fundamental matrix of singularly perturbed Markov chains". Adv. Appl. Prob. 31, pp.
679--697.
· Roux
W., Dauzère-Péres S. and J.B. Lasserre (1999)
"Planning and scheduling in a multi-site environment", Prod. Planning & Control 10, pp. 19--28.
· Lasserre
J.B. (1999)
"Integration and homogeneous functions", Proc. Amer. Math. Soc. 127, pp. 813--818.
1998
· Lasserre
J.B. (1998)
"Homogeneous functions and conjugacy", J. Conv. Anal 5, pp.
397--403.
· Lasserre
J.B. (1998)
"Weak convergences of probability measures: A uniform principle", Proc. Amer. Math. Soc. 126, pp. 3089--3096.
· Hernández-Lerma
O. and J.B. Lasserre (1998)
"Ergodic theorems and ergodic decomposition for Markov chains", Acta Appl. Math. 54,pp. 99--119.
· Hernández-Lerma
O. and J.B. Lasserre (1998)
"Approximation schemes for infinite linear programs", SIAM J. Optim. 8, pp. 973--988.
· Dauzère-Péres
S, W. Roux. and J.B. Lasserre (1998)
"Multi-resource shop scheduling with resource flexibility",, Europ. J. Oper. Res. 107, pp.
289--305.
· Lasserre
J.B. (1998)
"A Lyapunov criterion for invariant probabilities with geometric
tail", Prob. Eng. Info. Sci. 12, pp. 387--391.
· Hernández-Lerma
O. and J.B. Lasserre (1998)
"Existence and uniqueness of fixed points for Markov operators and Markov
processes", Proc. London Math. Soc.
(3) 76, pp. 711--736.
DOI:10.1112/S0024611598000380
· Hernández-Lerma
O. and J.B. Lasserre (1998)
"Linear programming approximations for Markov control processes in metric
spaces", Acta Appl. Math. 51, pp 123--139.
· Lasserre
J.B. (1998)
"Integration on a convex polytope", Proc. Amer. Math. Soc. 126, pp. 2433--2441.
· Lasserre
J.B. (1998)</font
"A theorem of the Alternative in Banach
Lattices", Proc. Amer. Math. Soc.
126, pp. 189--194.
1997
· Dauzère-Péres S. and J.B. Lasserre (1997)
"Lot-Streaming in Job-Shop
Scheduling", Oper. Res. 45, pp. 584--595.
· J.B. (1997)
"Invariant probabilities for Markov
chains on a metric space", Stat. Prob. Letters 34, pp. 259--265.
DOI:
10.1016/S0167-7152(96)00189-7
· Hernández-Lerma O. and J.B. Lasserre
(1997)
"Policy Iteration for average cost Markov
control processes on Borel spaces", Acta Appl. Math. 47, pp. 125--154.
· Lasserre J.B. (1997)
"Tight bounds for the trace of a matrix
product", IEEE Trans. Auto.
Contr. 42, pp. 578--581.
· Lasserre J.B. (1997)
"A Farkas Lemma without a standard
closure condition", SIAM J.
Contr. Optim. 35, pp. 265--272.
· Hernández-Lerma O. and J.B. Lasserre
(1997)
"Cone-constrained linear equations in
Banach spaces", J. Conv. Anal. 4, pp 149--164.
· Lasserre J.B. (1997)
"On the setwise convergence of sequences
of measures", J. Appl. Math. Stoch.
Anal. 10, pp. 131--136.
1996
· Lasserre J.B. and H.C. Tijms (1996)
"Invariant probabilities with geometric
tail", Prob. Eng. Inf. Sci. 10, pp. 213--221.
· Hernández-Lerma O. and J.B. Lasserre
(1996)
"Average optimality in Markov control
processes via discounted cost problems and Linear Programming", SIAM J. Control and Optim. 34, pp. 295--310.
· Hernández-Lerma O. and J.B. Lasserre
(1996)
"Existence of bounded invariant
probability densities for Markov chains", Stat. Prob. Letters 28, pp. 359--366.
· Lasserre J.B. (1996)
"Existence and uniqueness of an invariant
probability for a class of Feller Markov chains", J. Theor. Prob. 9, pp.
595--612.
· Lasserre J.B. (1996)
"Linear Programming with positive
semi-definite matrices", Math.
Probl. in Eng. 2, pp. 499--522.
· Hernández-Lerma O. and J.B. Lasserre
(1996)
"An extension of the Vitali-Hahn-Saks
Theorem", Proc. Amer. Math. Soc.
124, pp. 3673--3676, and 126, pp. 949, 1998.
1995
· Lasserre J.B. (1995)
"A new Farkas Lemma for positive
semi-definite matrices", IEEE Trans. Auto. Contr. 40,pp.
1131--1133.
· Lasserre J.B. (1995)
"A trace inequality for matrix
product", IEEE Trans. Auto. Contr.
40, pp. 1500--1501.
· Hernández-Lerma O. and J.B. Lasserre (1995)
"Invariant probability measures for
Feller Markov chains", J.
Appl. Math. Stoch. Anal. 8,pp.
341--345.
1994
· Lasserre J.B. (1994)
"Average Optimal Stationary Policies and
Linear Programming in Countable Space Markov Decision Processes", J. Math. Anal. Appl. 183, pp. 233--249.
· Hernández-Lerma O. and J.B. Lasserre
(1994)
"Linear Programming and average
optimality of Markov control processes on Borel spaces-unbounded costs", .SIAM J. Control and
Optim. 32, pp. 480--500.
· Lasserre J.B. (1994)
"A New Policy Iteration Scheme for MDPs
using Schweitzer's Formula", J. Appl. Prob. 31,pp. 268--273.
· Hernández-Lerma O. and J.B. Lasserre
(1994)
"Weak Conditions for Average Optimality
in Markov Control Processes", Syst.
Contr. Lett. 22, pp. 287--291.
· Dauzère-Péres S. and J.B. Lasserre (1994)
"Integration of Planning and Scheduling
Decisions in a Job-Shop", Europ. J. Oper. Res. 75,pp.
413--426.
· Hordijk A. and J.B. Lasserre (1994)
"Linear Programming formulation of MDPs
in countable sate space: the multichain case", Zeitschrift fur Oper. Res. 40, pp. 91--108.
· Lasserre J.B. (1994)
"A formula for singular perturbations of
Markov chains", J. Appl. Prob. 31, pp. 829--833.
· Lasserre J.B. (1994)
"Detecting optimal and non-optimal
actions in average-cost Markov decision processes", J. Appl. Prob. 31, pp. 979--990.
1993
· Lasserre J.B. (1993)
"Reachable, controllable sets and
stabilizing. control of constrained linear systems",
Automatica 29, pp. 531--536.
· Dauzère-Péres S. and J.B. Lasserre (1993)
"A Modified Shifting Bottleneck Procedure
for Job-Shop Scheduling", Int. J.
Prod. Res. 31, pp. 923--946.
· Hernández-Lerma O. and J.B. Lasserre
(1993)
"Value Iteration and Rolling Plans for
Markov control processes with unbounded rewards", J. Math. Anal. Appl. 177, pp.
38--55.
1992
· Lasserre J.B (1992)
"An integrated model for job-shop
planning and scheduling", Management
Science 38, pp. 1201--1211.
· Lasserre J.B. (1992)
"New capacity sets for the Hedging Point
strategy", MIT-LMP report $n^0$
89-044, Int. J. Prod. Res. 30, pp. 2941--2950.
1991
· Hernández-Lerma O., Hennet J.C. and J.B.
Lasserre (1991)
"Average cost Markov decision processes:
optimality conditions", J.
Math. Anal. Appl. 158, pp. 396--406.
· Lasserre J.B. (1991)
"The reachable set and controllable set
for two-dimensional discrete-time linear systems", J. Optim. Theor. Appl. 70, pp.
583--595.
· Lasserre J.B. (1991)
"Exact formula for sensitivity analysis
of Markov chains", J. Optim. Theor. Appl.
71, pp. 407--413.
1990
· Lasserre J.B. and C. Mercé(1990)
"Robust hierarchical production planning
under uncertainty", Ann. Oper. Res. 26, pp. 73--87.
· Bean J., Lasserre J.B. and R.L. Smith
(1990)
"Denumerable nonhomogeneous Markov
decision processes", J. Math. Anal. Appl. 153,
pp. 64--77.
· Hernández-Lerma O. and J.B. Lasserre
(1990)
"Error bounds for rolling horizon
policies in general Markov control processes", IEEE Trans. Auto. Contr. 35, pp
1118--1124.
· Hernández-Lerma O. and J.B. Lasserre (1990)
"Average cost optimal policies for Markov
control processes with Borel state space and unbounded costs", Syst. Contr. Lett. 15, pp.
349--356.
1988
· Lasserre J.B. (1988)
"Existence of closed-loop policies for
constrained discrete-time linear systems with bounded disturbances", J. Optim. Theor. Appl. 58, pp.
351--358
· Hernández-Lerma O. and J.B. Lasserre
(1988)
"A forecast horizon and a stopping rule
for general Markov decision processes", J.
Math. Anal. Appl. 132, pp
388--400.
· Lasserre J.B. (1988)
"Conditions for existence of average and
Blackwell optimal stationary policies in denumerable Markov decision
proccesses", .J. Math. Anal. Appl. 136, pp.
479--489.
· Cavazos Cadena R. and J.B. Lasserre (1988)
"Strong 1-optimal stationary policies in
denumerable Markov decision processes", Syst.
Contr. Lett. 11, pp. 65--71.
· Lasserre J.B. (1988)
"Decision Horizon, Overtaking and
1-optimality criteria in optimal control", Advances in Optimization and Control, Lecture Notes in Economics
and Mathematical Systems, Springer-Verlag, pp.
247--261.
1987
· Lasserre J.B. (1987)
"Detecting planning horizons in
deterministic infinite horizon optimal control", IEEE Trans. Auto. Contr. 31, no 1.
· Lasserre J.B., Varaiya P. and J. Walrand
(1987)
"Simulated annealing, random search,
multistart or SAD?", Syst. Contr. Lett. 8, pp. 297--301.
· Lasserre J.B. (1987)
"A complete characterization of reachable
sets for constrained linear time varying systems", IEEE Trans. Auto. Contr. 32, no 9.
1986
· Lasserre J.B. (1986)
"Consistency of a linear system of
inequalities", J. Optim. Theor. Appl.
49, no 1.
· Bès C. and J.B. Lasserre (1986)
"An on-line procedure in discounted
infinite horizon stochastic optimal control", J. Optim. Theor. Appl. 50, pp.
61--67.
1985
· Lasserre J.B. and F. Roubellat (1985)
"Measuring decision flexibility in
production planning", IEEE Trans. Auto. Contr. 30, pp. 447--452.
· Lasserre J.B. (1985)
"A mixed forward-backward dynamic
programming method using parallel computation", J. Optim. Theor. Appl. 45, no 1.
· Lasserre J.B. and C. Bès (1985)
"Stochastic discrete dynamic lot size
problem: an open-loop solution", Oper. Res. 33, pp.
684--689.
1984
· Lasserre J.B., Bès C. and F. Roubellat
(1984)
"On the open-loop solution of linear
stochastic optimal control problems", IEEE
Trans. Auto. Contr. 29, no 4.
· Lasserre J.B. and C. Bès (1984)
"Infinite horizon nonstationary optimal
control problems: a planning horizon result", IEEE Trans. Auto. Contr. 29, no 9.
· Lasserre J.B. (1983)
"An analytical expression and an
algorithm for the volume of a Convex Polyhedron in Rn", J. Optim. Theor. Appl. 39, pp. 363--377.
DOI:10.1007/BF00934543