Introductory exposition (textbooks, tutorial papers, etc.) pertaining to algebraic geometry (14-01) Semialgebraic sets and related spaces (14P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Polynomial optimization (90C23)
Recommendations
Cited in
(35)- Exploiting term sparsity in noncommutative polynomial optimization
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
- Synthesis for Polynomial Lasso Programs
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations
- Sparse polynomial prediction
- Moment and Polynomial Optimization
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks
- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization
- Complexity of sparse polynomial solving 2: renormalization
- Sparse Polynomial Optimization: Theory and Practice
- Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- The moment-SOS hierarchy: applications and related topics
- State polynomials: positivity, optimization and nonlinear Bell inequalities
- Symmetry reduction and recovery of trajectories of optimal control problems via measure relaxations
- Book review of: T. Theobald, Real algebraic geometry and optimization
- Convergence rates for sums-of-squares hierarchies with correlative sparsity
- A characterization for tightness of the sparse moment-SOS hierarchy
- Rank-one matrix completion via high-rank matrices in sum-of-squares relaxations
- Relative entropy methods in constrained polynomial and signomial optimization
- Polynomial optimization, certificates of positivity, and Christoffel function
- Sparse polynomial optimization with unbounded sets
- Granularity for mixed-integer polynomial optimization problems
- SPLD polynomial optimization and bounded degree SOS hierarchies
- Sparse polynomial matrix optimization
- A Christoffel-like function for high-dimensional support inference in graphical models
- Complete upper bound hierarchies for spectral minimum in noncommutative polynomial optimization
- Sums of squares certificates for polynomial moment inequalities
- An ideal-sparse generalized moment problem reformulation for completely positive tensor decomposition exploiting maximal cliques of multi-hypergraphs
- Term-sparse polynomial optimization for the design of frame structures
- Unifying view on sparse convex relaxations in polynomial optimization
- Approximating the order 2 quantum Wasserstein distance using the moment-SOS hierarchy
- A hierarchy of eigencomputations for polynomial optimization on the sphere
- Convergence rates for polynomial optimization on set products
- LMI hierarchies for stability analysis of ReLU feedback systems
This page was built for publication: Sparse Polynomial Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088205)
