Pages that link to "Item:Q5169658"
From MaRDI portal
The following pages link to Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization (Q5169658):
Displaying 46 items.
- Symmetric semi-algebraic sets and non-negativity of symmetric polynomials (Q258134) (← links)
- Continuous multifacility ordered median location problems (Q322399) (← links)
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming (Q623727) (← links)
- A polynomial optimization approach to constant rebalanced portfolio selection (Q694522) (← links)
- Border basis relaxation for polynomial optimization (Q898268) (← links)
- Symmetry in semidefinite programs (Q958029) (← links)
- Symmetry in Turán sums of squares polynomials from flag algebras (Q1637376) (← links)
- Symmetric sums of squares over \(k\)-subset hypercubes (Q1702778) (← links)
- Discriminants of cyclic homogeneous inequalities of three variables (Q1783404) (← links)
- Binary cumulant varieties (Q1950419) (← links)
- A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
- Multivariate interpolation: preserving and exploiting symmetry (Q2029002) (← links)
- Symmetric ideals, Specht polynomials and solutions to symmetric systems of equations (Q2029007) (← links)
- Optimization over trace polynomials (Q2068367) (← links)
- Sparse interpolation in terms of multivariate Chebyshev polynomials (Q2098236) (← links)
- Dimension-free entanglement detection in multipartite Werner states (Q2099794) (← links)
- Computing critical points for invariant algebraic systems (Q2100065) (← links)
- Sparse noncommutative polynomial optimization (Q2144551) (← links)
- Duality of sum of nonnegative circuit polynomials and optimal SONC bounds (Q2156369) (← links)
- Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← links)
- Finding largest small polygons with gloptipoly (Q2392118) (← links)
- Symmetric non-negative forms and sums of squares (Q2664111) (← links)
- Symmetry in multivariate ideal interpolation (Q2674003) (← links)
- Sum-of-squares chordal decomposition of polynomial matrix inequalities (Q2689814) (← links)
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) (Q2693046) (← links)
- Invariant Semidefinite Programs (Q2802527) (← links)
- Polynomial Norms (Q4620456) (← links)
- Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables (Q4637505) (← links)
- Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets (Q5043282) (← links)
- Symmetry Reduction in AM/GM-Based Optimization (Q5080501) (← links)
- Algorithms for fundamental invariants and equivariants of finite groups (Q5097383) (← links)
- Computing the Hausdorff Boundary Measure of Semialgebraic Sets (Q5130991) (← links)
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity (Q5148403) (← links)
- Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling (Q5152478) (← links)
- Moment methods in energy minimization: New bounds for Riesz minimal energy problems (Q5217870) (← links)
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization (Q5382573) (← links)
- A unified framework of SAGE and SONC polynomials and its duality theory (Q5856744) (← links)
- Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory (Q5864695) (← links)
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations (Q6066099) (← links)
- Reflection groups and cones of sums of squares (Q6108379) (← links)
- The poset of Specht ideals for hyperoctahedral groups (Q6119516) (← links)
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks (Q6126663) (← links)
- Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming (Q6155879) (← 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)
- Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization (Q6490315) (← links)
