Sparse-BSOS
From MaRDI portal
Software:43483
No author found.
Related Items (15)
Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints ⋮ Sparse noncommutative polynomial optimization ⋮ A new approximation hierarchy for polynomial conic optimization ⋮ Misspecified nonconvex statistical optimization for sparse phase retrieval ⋮ A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems ⋮ Convergent upper bounds of peak response of LTI and polytopic LTV systems through LMIs ⋮ Sum-of-Squares Optimization without Semidefinite Programming ⋮ A multilevel analysis of the Lasserre hierarchy ⋮ TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity ⋮ Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables ⋮ A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs ⋮ Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy ⋮ A sublevel moment-SOS hierarchy for polynomial optimization ⋮ Finding unstable periodic orbits: a hybrid approach with polynomial optimization ⋮ A unified framework of SAGE and SONC polynomials and its duality theory
This page was built for software: Sparse-BSOS
