Pages that link to "Item:Q5148403"
From MaRDI portal
The following pages link to TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity (Q5148403):
Displaying 25 items.
- A sublevel moment-SOS hierarchy for polynomial optimization (Q2070330) (← links)
- Decomposed structured subsets for semidefinite and sum-of-squares optimization (Q2071977) (← links)
- Exploiting sparsity in complex polynomial optimization (Q2073057) (← links)
- Finding unstable periodic orbits: a hybrid approach with polynomial optimization (Q2077605) (← links)
- Sparse noncommutative polynomial optimization (Q2144551) (← links)
- Duality of sum of nonnegative circuit polynomials and optimal SONC bounds (Q2156369) (← links)
- Exploiting term sparsity in noncommutative polynomial optimization (Q2231045) (← links)
- SONC optimization and exact nonnegativity certificates via second-order cone programming (Q2674014) (← links)
- Sum-of-squares chordal decomposition of polynomial matrix inequalities (Q2689814) (← links)
- Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets (Q5043282) (← links)
- Nonnegative Polynomials and Circuit Polynomials (Q5073707) (← links)
- Symmetry Reduction in AM/GM-Based Optimization (Q5080501) (← links)
- Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension (Q5148406) (← links)
- Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures (Q5152480) (← links)
- A unified framework of SAGE and SONC polynomials and its duality theory (Q5856744) (← links)
- Algebraic Perspectives on Signomial Optimization (Q5886830) (← links)
- Partial Lasserre relaxation for sparse Max-Cut (Q6050383) (← links)
- A hierarchy of spectral relaxations for polynomial optimization (Q6062883) (← links)
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations (Q6066099) (← links)
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks (Q6126663) (← links)
- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization (Q6136658) (← links)
- Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming (Q6155879) (← links)
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)
- Invariants of SDP exactness in quadratic programming (Q6184179) (← links)
