Sparse polynomial matrix optimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1489799 (Why is no real title available?)
- A moment-sum-of-squares hierarchy for robust polynomial matrix inequality optimization with sum-of-squares convexity
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- A note on the representation of positive polynomials with structured sparsity
- A second order cone characterization for sums of nonnegative circuits
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- Analysis of input-affine dynamical systems using parameterized robust counterparts
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Closures of quadratic modules
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Exploiting Algebraic Structure in Sum of Squares Programs
- Exploiting sparsity in complex polynomial optimization
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Exploiting term sparsity in noncommutative polynomial optimization
- Extremal psd forms with few terms
- Finite convergence of the moment-SOS hierarchy for polynomial matrix optimization
- Harmonic Hierarchies for Polynomial Optimization
- Inner Approximations for Polynomial Matrix Inequalities and Robust Stability Regions
- Linear matrix inequality representation of sets
- Matrix sum-of-squares relaxations for robust semi-definite programs
- Minimum-weight triangulation is NP-hard
- Moments, positive polynomials and their applications
- On Matrix-Valued Monge–Kantorovich Optimal Mass Transport
- On the complexity of Putinar's Positivstellensatz
- On the effective Putinar's Positivstellensatz and moment approximation
- Polynomial matrix inequality and semidefinite representation
- Positive definite completions of partial Hermitian matrices
- Positive semidefinite matrices with a given sparsity pattern
- Pre- and Post-Processing Sum-of-Squares Programs in Practice
- Relative entropy relaxations for signomial optimization
- SONC optimization and exact nonnegativity certificates via second-order cone programming
- Some NP-complete problems in quadratic and nonlinear programming
- Sparse Polynomial Optimization
- Sum-of-squares chordal decomposition of polynomial matrix inequalities
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Symmetry groups, semidefinite programs, and sums of squares
- Symmetry in Turán sums of squares polynomials from flag algebras
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- There are significantly more nonnegative polynomials than sums of squares
- Treewidth computations. I: Upper bounds
- ``Positive noncommutative polynomials are sums of squares.
- dReal: an SMT solver for nonlinear theories over the reals
This page was built for publication: Sparse polynomial matrix optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230408)
