Pages that link to "Item:Q5742692"

The following pages link to Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization (Q5742692):

Displaying 20 items.

• The \(\mathcal{S}\)-cone and a primal-dual view on second-order representability (Q2022366) (← links)
• The dual cone of sums of non-negative circuit polynomials (Q2035029) (← links)
• Fitting tractable convex sets to support function evaluations (Q2046436) (← links)
• Sublinear circuits for polyhedral sets (Q2135087) (← links)
• Hyperbolic secant varieties of \(M\)-curves (Q2671932) (← links)
• SONC optimization and exact nonnegativity certificates via second-order cone programming (Q2674014) (← links)
• Terracini convexity (Q2687050) (← links)
• Sublinear circuits and the constrained signomial nonnegativity problem (Q2687052) (← links)
• Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)
• Symmetry Reduction in AM/GM-Based Optimization (Q5080501) (← links)
• Limitations on the Expressive Power of Convex Cones without Long Chains of Faces (Q5222131) (← links)
• Second-Order Cone Representation for Convex Sets in the Plane (Q5856514) (← links)
• A unified framework of SAGE and SONC polynomials and its duality theory (Q5856744) (← links)
• Linear optimization over homogeneous matrix cones (Q6047504) (← links)
• Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023 (Q6076084) (← links)
• On eigenvalues of symmetric matrices with PSD principal submatrices (Q6108376) (← links)
• Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks (Q6126663) (← links)
• CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization (Q6599983) (← links)
• Symmetric SAGE and SONC forms, exactness and quantitative gaps (Q6615415) (← links)
• Convex hulls of monomial curves, and a sparse positivstellensatz (Q6665381) (← links)