An introduction to polynomial and semi-algebraic optimization
From MaRDI portal
Publication:2930845
DOI10.1017/CBO9781107447226zbMATH Open1320.90003OpenAlexW404764422MaRDI QIDQ2930845FDOQ2930845
Authors: Jean B. Lasserre 
Publication date: 20 November 2014
Full work available at URL: https://doi.org/10.1017/cbo9781107447226
Recommendations
linear programmingconvex optimizationglobal optimizationnonlinear programmingpolynomial optimizationinteger programming
Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cited In (only showing first 100 items - show all)
- GloptiPoly
- Signomial and polynomial optimization via relative entropy and partial dualization
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
- Semidefinite program duals for separable polynomial programs involving box constraints
- Transformations of moment functionals
- Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization
- The saddle point problem of polynomials
- The maximum tensor complementarity eigenvalues
- Stochastic polynomial optimization
- Higher-degree tensor eigenvalue complementarity problems
- The multidimensional truncated moment problem: Gaussian and log-normal mixtures, their Carathéodory numbers, and set of atoms
- Algorithm 998: The robust LMI parser -- a toolbox to construct LMI conditions for uncertain systems
- Algebraic degree in semidefinite and polynomial optimization
- Positive polynomials and semidefinite programming
- A multigrid approach to SDP relaxations of sparse polynomial optimization problems
- Optimization over polynomials: selected topics
- Positivity and optimization: beyond polynomials
- New bounds for nonconvex quadratically constrained quadratic programming
- An SDP method for copositivity of partially symmetric tensors
- The bottleneck degree of algebraic varieties
- Computation of sum of squares polynomials from data points
- Saddle points of rational functions
- Hermitian tensor decompositions
- On duality gap with polynomial multipliers for polynomial optimization problems
- Genericity in polynomial optimization
- A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems
- Multi-objective convex polynomial optimization and semidefinite programming relaxations
- Exploiting algebraic structure in global optimization and the Belgian chocolate problem
- Sums of squares, moment matrices and optimization over polynomials
- Moments, positive polynomials and their applications
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
- Optimisation globale et théorie des moments
- On the central path of semidefinite optimization: degree and worst-case convergence rate
- Quasi-quadratic modules in valuation rings and valued fields
- Optimality conditions for minimizers at infinity in polynomial programming
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets
- Positivity and optimization for semi-algebraic functions
- Properties of the cone of non-negative polynomials and duality
- A new algorithm for concave quadratic programming
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
- Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization
- A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers
- Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization
- A hierarchy of spectral relaxations for polynomial optimization
- The moment-SOS hierarchy and the Christoffel-Darboux kernel
- The method of moments in global optimization
- Book review of: J. B. Lasserre, An introduction to polynomial and semi-algebraic optimization
- Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint
- Optimization on the Euclidean unit sphere
- A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging
- Strict complementarity in semidefinite optimization with elliptopes including the maxcut SDP
- The approach of moments for polynomial equations
- A sublevel moment-SOS hierarchy for polynomial optimization
- The multidimensional truncated moment problem: the moment cone
- Error bounds for monomial convexification in polynomial optimization
- On Hermitian polynomial optimization
- A MAX-CUT formulation of 0/1 programs
- LMI pole regions for a robust discrete-time pole placement controller design
- Symmetric tensor nuclear norms
- Polynomial optimization problems and their relaxations
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- Finding extremal periodic orbits with polynomial optimization, with application to a nine-mode model of shear flow
- Finding unstable periodic orbits: a hybrid approach with polynomial optimization
- A disintegration of the Christoffel function
- The multidimensional truncated moment problem: Carathéodory numbers from Hilbert functions
- Sparse linear regression from perturbed data
- A matrix Positivstellensatz with lifting polynomials
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- An algorithm for semi-infinite polynomial optimization
- The algebro-geometric study of range maps
- Minimum wave speeds in monostable reaction-diffusion equations: sharp bounds by polynomial optimization
- Optimal Transport to a Variety
- Separability of Hermitian tensors and PSD decompositions
- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- Dehomogenization for completely positive tensors
- Bounding extrema over global attractors using polynomial optimisation
- Sum-of-squares relaxations in robust DC optimization and feature selection
- Global minimization of polynomial integral functionals
- Computing Gaussian \& exponential measures of semi-algebraic sets
- Rational Generalized Nash Equilibrium Problems
- Tangencies and polynomial optimization
- Optimal data fitting: a moment approach
- A utopia point method-based robust vector polynomial optimization scheme
- Convex Relaxations of Integral Variational Problems: Pointwise Dual Relaxation and Sum-of-Squares Optimization
- Generalized truncated moment problems with unbounded sets
- Homogenization for polynomial optimization with unbounded sets
- Quantile-constrained Wasserstein projections for robust interpretability of numerical and machine learning models
- The 2013 Newton Institute Programme on polynomial optimization
- The moment-SOS hierarchy: applications and related topics
- The distance to cubic symmetry class as a polynomial optimization problem
- A faster interior-point method for sum-of-squares optimization
- Sum-of-squares optimization without semidefinite programming
- Auxiliary functions as Koopman observables: data-driven analysis of dynamical systems via polynomial optimization
- Data loci in algebraic optimization
Uses Software
This page was built for publication: An introduction to polynomial and semi-algebraic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930845)
