An introduction to polynomial and semi-algebraic optimization
From MaRDI portal
Publication:2930845
Recommendations
Cited in
(only showing first 100 items - show all)- An algorithm for semi-infinite polynomial optimization
- 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
- Minimum wave speeds in monostable reaction-diffusion equations: sharp bounds by polynomial optimization
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks
- Transformations of moment functionals
- GloptiPoly
- The saddle point problem of polynomials
- Optimal Transport to a Variety
- Separability of Hermitian tensors and PSD decompositions
- T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method
- The maximum tensor complementarity eigenvalues
- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization
- Stochastic polynomial optimization
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- Higher-degree tensor eigenvalue complementarity problems
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- Dehomogenization for completely positive tensors
- Bounding extrema over global attractors using polynomial optimisation
- 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
- Sum-of-squares relaxations in robust DC optimization and feature selection
- Algebraic degree in semidefinite and polynomial optimization
- Global minimization of polynomial integral functionals
- Positive polynomials and semidefinite programming
- Computing Gaussian \& exponential measures of semi-algebraic sets
- A multigrid approach to SDP relaxations of sparse polynomial optimization problems
- Positivity and optimization: beyond polynomials
- Optimization over polynomials: selected topics
- New bounds for nonconvex quadratically constrained quadratic programming
- An SDP method for copositivity of partially symmetric tensors
- Rational Generalized Nash Equilibrium Problems
- Optimal data fitting: a moment approach
- Tangencies and polynomial optimization
- A utopia point method-based robust vector polynomial optimization scheme
- Convex Relaxations of Integral Variational Problems: Pointwise Dual Relaxation and Sum-of-Squares Optimization
- The bottleneck degree of algebraic varieties
- Generalized truncated moment problems with unbounded sets
- Computation of sum of squares polynomials from data points
- Saddle points of rational functions
- Homogenization for polynomial optimization with unbounded sets
- The 2013 Newton Institute Programme on polynomial optimization
- Hermitian tensor decompositions
- Quantile-constrained Wasserstein projections for robust interpretability of numerical and machine learning models
- 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
- The moment-SOS hierarchy: applications and related topics
- Exploiting algebraic structure in global optimization and the Belgian chocolate problem
- Multi-objective convex polynomial optimization and semidefinite programming relaxations
- The distance to cubic symmetry class as a polynomial optimization problem
- Optimal size of linear matrix inequalities in semidefinite approaches to polynomial optimization
- Sums of squares, moment matrices and optimization over polynomials
- Moments, positive polynomials and their applications
- A faster interior-point method for sum-of-squares optimization
- 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
- Sum-of-squares optimization without semidefinite programming
- 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
- A new algorithm for concave quadratic programming
- Auxiliary functions as Koopman observables: data-driven analysis of dynamical systems via polynomial optimization
- Properties of the cone of non-negative polynomials and duality
- Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization
- Data loci in algebraic optimization
- A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite 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
- Moment and Polynomial Optimization
- Finite convergence of moment-SOS relaxations with nonreal radical ideals
- On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials
- Counting isolated points outside the image of a polynomial map
- Control analysis and design via randomised coordinate polynomial minimisation
- The method of moments in global optimization
- The moment-SOS hierarchy and the Christoffel-Darboux kernel
- A hierarchy of spectral relaxations for polynomial optimization
- On Optimal Cell Average Decomposition for High-Order Bound-Preserving Schemes of Hyperbolic Conservation Laws
- Convergences for robust bilevel polynomial programmes with applications
- Distance to a constitutive tensor isotropy stratum by the Lasserre polynomial optimization method
- Graph recovery from incomplete moment information
- Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint
- Book review of: J. B. Lasserre, An introduction to polynomial and semi-algebraic optimization
- Optimization on the Euclidean unit sphere
- Harmonic Hierarchies for Polynomial Optimization
- Gaussian mixtures closest to a given measure via optimal transport
- On Łojasiewicz inequalities and the effective Putinar's Positivstellensatz
- Bounding extreme events in nonlinear dynamics using convex optimization
- A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging
- kNN Classification with an Outlier Informative Distance Measure
- The multidimensional truncated moment problem: Gaussian mixture reconstruction from derivatives of moments
- Strict complementarity in semidefinite optimization with elliptopes including the maxcut SDP
- Book review of: T. Theobald, Real algebraic geometry and optimization
- A sublevel moment-SOS hierarchy for polynomial optimization
- The approach of moments for polynomial equations
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)
