Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Jean B. Lasserre" ( http://dblp.L3S.de/Authors/Jean_B._Lasserre )

  Author page on DBLP  Author page in RDF  Community of Jean B. Lasserre in ASPL-2

Publication years (Num. hits)
1992-2003 (15) 2004-2008 (21) 2009-2011 (21) 2012 (2)
Publication types (Num. hits)
article(46) inproceedings(13)
Venues (Conferences, Journals, ...)
SIAM Journal on Optimization(10) CoRR(5) Math. Program.(5) Oper. Res. Lett.(4) CDC(3) Discrete Optimization(3) IPCO(3) Math. Oper. Res.(3) CDC-ECE(2) ICCSA(2) J. Global Optimization(2) Optimization Letters(2) SIAM J. Control and Optimizati...(2) ACM Trans. Math. Softw.(1) Appl. Math. Lett.(1) Automatica(1) More (+10 of total 26)
Authors
Jean B. Lasserre(59) Didier Henrion(8) Eduardo S. Zeron(6) Carlo Savorgnan(3) Monique Laurent(3) Philipp Rostalski(3) Rida Laraki(2) Tung Phan Thanh(2) Christophe Prieur(1) Cordian Riener(1) Dimitris Bertsimas(1) Emmanuel Trélat(1) Florian Bugarin(1) Lina Jansson Andrén(1) Maurice Queyranne(1) Mihai Putinar(1) More (+10 of total 20)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 18 occurrences of 13 keywords
Results
Found 59 publication records. Showing 59 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Jean B. Lasserre The existence of Gaussian cubature formulas. Search on Bibsonomy Journal of Approximation Theory The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Rida Laraki, Jean B. Lasserre Semidefinite programming for min-max problems and games. Search on Bibsonomy Math. Program. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre A New Look at Nonnegativity on Closed Sets and Polynomial Optimization. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre On convex optimization without convex representation. Search on Bibsonomy Optimization Letters The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre Min-max and robust polynomial optimization. Search on Bibsonomy J. Global Optimization The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Didier Henrion, Jean B. Lasserre Inner approximations for polynomial matrix inequalities and robust stability regions Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Cordian Riener, Thorsten Theobald, Lina Jansson Andrén, Jean B. Lasserre Exploiting symmetries in SDP-relaxations for polynomial optimization Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Florian Bugarin, Didier Henrion, Jean B. Lasserre Minimizing the sum of many rational functions Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Jean B. Lasserre Inverse polynomial optimization. Search on Bibsonomy CDC-ECE The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre, Tung Phan Thanh Convex underestimators of polynomials. Search on Bibsonomy CDC-ECE The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre A ``Joint+Marginal'' Approach to Parametric Polynomial Optimization. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre, Mihai Putinar Positivity and Optimization for Semi-Algebraic Functions. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre On representations of the feasible set in convex optimization. Search on Bibsonomy Optimization Letters The full citation details ... 2010 DBLP  DOI  BibTeX  RDF Karush-Kuhn-Tucker optimality conditions, Convex optimization, Convex programming
1Jean B. Lasserre Certificates of convexity for basic semi-algebraic sets. Search on Bibsonomy Appl. Math. Lett. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre, Tung Phan Thanh A "joint+marginal" algorithm for polynomial optimization. Search on Bibsonomy CDC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Didier Henrion, Jean B. Lasserre, Carlo Savorgnan Approximate Volume and Integration for Basic Semialgebraic Sets. Search on Bibsonomy SIAM Review The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre Convexity in SemiAlgebraic Geometry and Polynomial Optimization. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre, Monique Laurent, Philipp Rostalski A prolongation-projection algorithm for computing the finite real variety of an ideal. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre Moments and sums of squares for polynomial optimization and related problems. Search on Bibsonomy J. Global Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre, Eduardo S. Zeron Certificates and relaxations for integer programming and the semi-group membership problem Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Jean B. Lasserre The K-moment problem with densities. Search on Bibsonomy Math. Program. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 90C22, 78M05, 90C25
1Jean B. Lasserre Convex sets with semidefinite representation. Search on Bibsonomy Math. Program. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 52A20, 52A27, 52A41, 13B25, 12D15, 90C25, 90C22
1Carlo Savorgnan, Jean B. Lasserre, Moritz Diehl Discrete-time stochastic optimal control via occupation measures and moment relaxations. Search on Bibsonomy CDC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Dimitris Bertsimas, Xuan Vinh Doan, Jean B. Lasserre Approximating integrals of multivariate exponentials: A moment approach. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre, Monique Laurent, Philipp Rostalski Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals. Search on Bibsonomy Foundations of Computational Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 14P05, 12E12, 12D10, 90C22, 13P10
1Jean B. Lasserre, Didier Henrion, Christophe Prieur, Emmanuel Trélat Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations. Search on Bibsonomy SIAM J. Control and Optimization The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Rida Laraki, Jean B. Lasserre Semidefinite programming for N-Player Games Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Jean B. Lasserre A semidefinite programming approach to the generalized problem of moments. Search on Bibsonomy Math. Program. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 44A60, 78M05, 90C25, 90C22
1Jean B. Lasserre, Monique Laurent, Philipp Rostalski Computing the real variety of an ideal: a real algebraic and symbolic-numeric algorithm. Search on Bibsonomy SAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Didier Henrion, Jean B. Lasserre, Carlo Savorgnan Nonlinear optimal control synthesis via occupation measures. Search on Bibsonomy CDC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre, Eduardo S. Zeron Simple Explicit Formula for Counting Lattice Points of Polyhedra. Search on Bibsonomy IPCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre Convergent SDP-Relaxations in Polynomial Optimization with Sparsity. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre A Sum of Squares Approximation of Nonnegative Polynomials. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Didier Henrion, Jean B. Lasserre LMIs for constrained polynomial interpolation with application in trajectory planning. Search on Bibsonomy Systems & Control Letters The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre Robust global optimization with polynomials. Search on Bibsonomy Math. Program. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject classification (2000) 90C26, 90C30, 90C22
1Jean B. Lasserre Convergent SDP-Relaxations for Polynomial Optimization with Sparsity. Search on Bibsonomy ICMS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre Erratum to "Generating functions and duality for integer programs": [Discrete Optimization 1 (2) (2004) 167-187]. Search on Bibsonomy Discrete Optimization The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre Polynomial Programming: LP-Relaxations Also Converge. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre Sum of Squares Approximation of Polynomials, Nonnegative on a Real Algebraic Set. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre, Eduardo S. Zeron An Alternative Algorithm for Counting Lattice Points in a Convex Polytope. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre Integer programming, Barvinok's counting algorithm and Gomory relaxations. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre Generating functions and duality for integer programs. Search on Bibsonomy Discrete Optimization The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre A discrete Farkas lemma. Search on Bibsonomy Discrete Optimization The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre The Integer Hull of a Convex Rational Polytope. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre, Eduardo S. Zeron On Counting Integral Points in a Convex Rational Polytope. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Didier Henrion, Jean B. Lasserre GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi. Search on Bibsonomy ACM Trans. Math. Softw. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF SeDuMi, semidefinite programming, Matlab, linear matrix inequality, Polynomial programming
1Jean B. Lasserre A Discrete Farkas Lemma. Search on Bibsonomy ICCSA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre The Integer Hull of a Convex Rational Polytope. Search on Bibsonomy ICCSA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre, Eduardo S. Zeron Solving the knapsack problem via Z-transform. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre Semidefinite Programming vs. LP Relaxations for Polynomial Programming. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Didier Henrion, Jean B. Lasserre Solving Global Optimization Problems over Polynomials with GloptiPoly 2.1. Search on Bibsonomy COCOS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre Global Optimization with Polynomials and the Problem of Moments. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre, Eduardo S. Zeron A Laplace transform algorithm for the volume of a convex polytope. Search on Bibsonomy J. ACM The full citation details ... 2001 DBLP  DOI  BibTeX  RDF volume of a convex polytope, Computational geometry, Laplace transform, convex polytopes
1Jean B. Lasserre An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs. Search on Bibsonomy IPCO The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre Why the logarithmic barrier function in convex and linear programming? Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Onésimo Hernández-Lerma, Jean B. Lasserre Zero-Sum Stochastic Games in Borel Spaces: Average Payoff Criteria. Search on Bibsonomy SIAM J. Control and Optimization The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre Reachable, controllable sets and stabilizing control of constrained linear systems. Search on Bibsonomy Automatica The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Jean B. Lasserre, Maurice Queyranne Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling. Search on Bibsonomy IPCO The full citation details ... 1992 DBLP  BibTeX  RDF
Displaying result #1 - #59 of 59 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.