scientific article

From MaRDI portal
Publication:3395491

zbMath1211.90007MaRDI QIDQ3395491

Jean-Bernard Lasserre

Publication date: 2 September 2009

Full work available at URL: http://ebooks.worldscinet.com/ISBN/9781848164468/toc.shtml

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Learning Dynamical Systems with Side Information, Maximum entropy and integer partitions, Generalized maximum entropy estimation, Separability of Hermitian tensors and PSD decompositions, Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel, High Order Moment Model for Polydisperse Evaporating Sprays towards Interfacial Geometry Description, Linear Conic Optimization for Inverse Optimal Control, On some relaxations commonly used in the study of linear systems, Hyperbolic Quadrature Method of Moments for the One-Dimensional Kinetic Equation, Constrained overdamped Langevin dynamics for symmetric multimarginal optimal transportation, Qualification Conditions in Semialgebraic Programming, Do Sums of Squares Dream of Free Resolutions?, Tangencies and polynomial optimization, On the effective Putinar's Positivstellensatz and moment approximation, A hierarchy of spectral relaxations for polynomial optimization, A unified framework for the identification of a general class of multivariable nonlinear block‐structured systems, AROUND SYLVESTER'S QUESTION IN THE PLANE, Distance to a constitutive tensor isotropy stratum by the Lasserre polynomial optimization method, A Sum of Squares Characterization of Perfect Graphs, A new scheme for approximating the weakly efficient solution set of vector rational optimization problems, Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, Nonlinear algebra and applications, Hausdorff distance between convex semialgebraic sets, A utopia point method-based robust vector polynomial optimization scheme, Regularization method for the generalized moment problem in a functional reproducing kernel Hilbert space, Learning-based sensitivity analysis and feedback design for drug delivery of mixed therapy of cancer in the presence of high model uncertainties, Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials, Computation of Sum of Squares Polynomials from Data Points, Tighter bounds on transient moments of stochastic chemical systems, On Optimal Cell Average Decomposition for High-Order Bound-Preserving Schemes of Hyperbolic Conservation Laws, Semidefinite Representation for Convex Hulls of Real Algebraic Curves, Spectrahedral Shadows, Harmonic Hierarchies for Polynomial Optimization, Second Order Conditions to Decompose Smooth Functions as Sums of Squares, Real Radicals and Finite Convergence of Polynomial Optimization Problems, Unnamed Item, A Positivstellensatz for Sums of Nonnegative Circuit Polynomials, Technical Note—Options Portfolio Selection, Certifying Unstability of Switched Systems Using Sum of Squares Programming, Computing the Hausdorff Boundary Measure of Semialgebraic Sets, Unnamed Item, Algorithms For Positive Polynomial Approximation, DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization, Computable Primal and Dual Bounds for Stochastic Control, Infinite dimensional moment problem: open questions and applications, Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables, Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures, Hankel vector moment sequences and the non-tangential regularity at infinity of two variable Pick functions, Semidefinite Optimization Estimating Bounds on Linear Functionals Defined on Solutions of Linear ODEs, A note on polynomial maps having fibers of maximal dimension, Distribution‐constrained optimal stopping, Unnamed Item, Matrix convex hulls of free semialgebraic sets, Semidefinite relaxations for partitioning, assignment and ordering problems, Sums of squares and varieties of minimal degree, A convex optimization model for finding non-negative polynomials, Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems, Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes, Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming, Algorithm 996, The sliding Frank–Wolfe algorithm and its application to super-resolution microscopy, Semidefinite relaxations for partitioning, assignment and ordering problems, Semidefinite Approximations of the Polynomial Abscissa, The quintic complex moment problem, Bounding the support of a measure from its marginal moments, Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems, A Regularized Entropy-Based Moment Method for Kinetic Equations, Volume of Sublevel Sets of Homogeneous Polynomials, Book Review: The basic George B. Dantzig, Positive Gorenstein ideals, Semidefinite Programming For Chance Constrained Optimization Over Semialgebraic Sets, A unified framework of SAGE and SONC polynomials and its duality theory, M$^2$ Spectral Estimation: A Flexible Approach Ensuring Rational Solutions, Convergence of Lasserre's hierarchy: the general case, Minimizing the sum of many rational functions, Amoebas, nonnegative polynomials and sums of squares supported on circuits, Local saddle points for unconstrained polynomial optimization, Book review of: M. Aschenbrenner et al., Asymptotic differential algebra and model theory of transseries, Synthesizing invariant barrier certificates via difference-of-convex programming, Nonnegative Morse polynomial functions and polynomial optimization, Sparse moments of univariate step functions and allele frequency spectra, A convex relaxation approach to set-membership identification of LPV systems, Moment problem in infinitely many variables, Moment-sequence transforms, Moment closure approximations of the Boltzmann equation based on \(\varphi \)-divergences, Set-membership errors-in-variables identification of MIMO linear systems, Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization, Operator Positivstellensätze for noncommutative polynomials positive on matrix convex sets, On a solution of the multidimensional truncated matrix-valued moment problem, Computing generalized Nash equilibria by polynomial programming, Tensor eigenvalue complementarity problems, Graph recovery from incomplete moment information, The truncated moment problem on \(\mathbb{N}_0\), Constructive proofs of some positivstellensätze for compact semialgebraic subsets of \(\mathbb R^{d }\), Real root finding for low rank linear matrices, Probabilistic reachable and invariant sets for linear systems with correlated disturbance, Sum-of-squares methods for controlled invariant sets with applications to model-predictive control, Borel measures with a density on a compact semi-algebraic set, Moment approximations for set-semidefinite polynomials, Polynomials with bounds and numerical approximation, The operator approach to the truncated multidimensional moment problem, One-shot set-membership identification of generalized Hammerstein-Wiener systems, A new approximation hierarchy for polynomial conic optimization, Optimization based methods for partially observed chaotic systems, Exact safety verification of hybrid systems using sums-of-squares representation, Stokes, Gibbs, and volume computation of semi-algebraic sets, Discussion on: ``A decomposition algorithm for KYP-SDPs, The geometry of SDP-exactness in quadratic optimization, The role of non-negative polynomials for rank-one convexity and quasi convexity, Realizable second-order finite-volume schemes for the advection of moment sets of the particle size distribution, Real root finding for determinants of linear matrices, Sublinear circuits and the constrained signomial nonnegativity problem, Sum-of-squares chordal decomposition of polynomial matrix inequalities, Quadratic tensor eigenvalue complementarity problems, Algebraic-exponential data recovery from moments, On the truncated two-dimensional moment problem, The convex Positivstellensatz in a free algebra, Exploiting sparsity for semi-algebraic set volume computation, Optimal bounds and extremal trajectories for time averages in nonlinear dynamical systems, Optimal estimation of Gaussian mixtures via denoised method of moments, Distributionally robust polynomial chance-constraints under mixture ambiguity sets, Free semidefinite representation of matrix power functions, Design of Marx generators as a structured eigenvalue assignment, Implementable tensor methods in unconstrained convex optimization, Approximate optimal designs for multivariate polynomial regression, The cubic complex moment problem, Exact algorithms for semidefinite programs with degenerate feasible set, A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials, Solving fractional multicriteria optimization problems with sum of squares convex polynomial data, Lebesgue decomposition in action via semidefinite relaxations, The core variety of a multisequence in the truncated moment problem, Convergence rates of moment-sum-of-squares hierarchies for optimal control problems, On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint, Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets, An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming, Dual optimal design and the Christoffel-Darboux polynomial, Compactness criteria for real algebraic sets and Newton polyhedra, The full infinite dimensional moment problem on semi-algebraic sets of generalized functions, On the extreme points of moments sets, Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations, A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs, The \(\mathcal{S}\)-cone and a primal-dual view on second-order representability, Convex computation of extremal invariant measures of nonlinear dynamical systems and Markov processes, Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations, Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials, A MAX-CUT formulation of 0/1 programs, Fast sampling from \(\beta \)-ensembles, A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks, Sums of squares of polynomials with rational coefficients, Complex orthogonal polynomials and numerical quadrature via hyponormality, The dual cone of sums of non-negative circuit polynomials, Noncommutative polynomials nonnegative on a variety intersect a convex set, Multi-objective convex polynomial optimization and semidefinite programming relaxations, The Stieltjes condition and multidimensional \({\mathcal{K}} \)-moment problems, Mean squared error minimization for inverse moment problems, Policy iteration in finite templates domain, Tensor theta norms and low rank recovery, An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem, Modeling and estimation of thermal flows based on transport and balance equations, Safety of stochastic systems: an analytic and computational approach, A semidefinite relaxation algorithm for checking completely positive separable matrices, Semi-algebraic approximation using Christoffel-Darboux kernel, Decomposed structured subsets for semidefinite and sum-of-squares optimization, An overview of semidefinite relaxations for optimal power flow problem, A moment theoretic approach to estimate the cardinality of certain algebraic varieties, Two-sided space-time \(L^1\) polynomial approximation of hypographs within polynomial optimal control, Nonlinear optimal control: a numerical scheme based on occupation measures and interval analysis, Characterization of the moment space corresponding to the Levermore basis, Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming, Optimization hierarchy for fair statistical decision problems, Three-monotone interpolation, Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm, Typical real ranks of binary forms


Uses Software