The following pages link to Sparse-BSOS (Q43483):
Displaying 16 items.
- (Q47477) (redirect page) (← links)
- A multilevel analysis of the Lasserre hierarchy (Q1735163) (← links)
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
- A sublevel moment-SOS hierarchy for polynomial optimization (Q2070330) (← links)
- Finding unstable periodic orbits: a hybrid approach with polynomial optimization (Q2077605) (← links)
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550) (← links)
- Sparse noncommutative polynomial optimization (Q2144551) (← links)
- Convergent upper bounds of peak response of LTI and polytopic LTV systems through LMIs (Q2208581) (← links)
- Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy (Q2297658) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
- Misspecified nonconvex statistical optimization for sparse phase retrieval (Q2425184) (← links)
- A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems (Q4600837) (← links)
- Sum-of-Squares Optimization without Semidefinite Programming (Q4629344) (← links)
- Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables (Q4637505) (← links)
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity (Q5148403) (← links)
- A unified framework of SAGE and SONC polynomials and its duality theory (Q5856744) (← links)
