An introduction to polynomial and semi-algebraic optimization
From MaRDI portal
Publication:2930845
Recommendations
Cited in
(only showing first 100 items - show all)- A semidefinite relaxation method for second-order cone polynomial complementarity problems
- The multidimensional truncated moment problem: the moment cone
- Coloring the Voronoi tessellation of lattices
- Error bounds for monomial convexification in polynomial optimization
- A MAX-CUT formulation of 0/1 programs
- scientific article; zbMATH DE number 7626745 (Why is no real title available?)
- On Hermitian polynomial optimization
- LMI pole regions for a robust discrete-time pole placement controller design
- Symmetric tensor nuclear norms
- Sum-of-squares chordal decomposition of polynomial matrix inequalities
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- Polynomial optimization problems and their relaxations
- Convex hulls of monomial curves, and a sparse positivstellensatz
- Finding extremal periodic orbits with polynomial optimization, with application to a nine-mode model of shear flow
- Pell's equation, sum-of-squares and equilibrium measures on a compact set
- Quadratic tensor eigenvalue complementarity problems
- Convex generalized Nash equilibrium problems and polynomial optimization
- 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
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Loss functions for finite sets
- Modeling and estimation of thermal flows based on transport and balance equations
- Multiple oracle algorithm to solve continuous games
- A matrix Positivstellensatz with lifting polynomials
- On the effective Putinar's Positivstellensatz and moment approximation
- Local minimizers of semi-algebraic functions from the viewpoint of tangencies
- Separable Network Games with Compact Strategy Sets
- The algebro-geometric study of range maps
- 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
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)
