Pages that link to "Item:Q1878418"
From MaRDI portal
The following pages link to Symmetry groups, semidefinite programs, and sums of squares (Q1878418):
Displaying 50 items.
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry (Q431008) (← links)
- Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
- Semidefinite relaxations of dynamical programs under discrete constraints (Q601981) (← 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)
- A convex polynomial that is not sos-convex (Q715094) (← links)
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming (Q717133) (← links)
- Equilibrium problems involving the Lorentz cone (Q742123) (← links)
- Lower bounds on nonnegative rank via nonnegative nuclear norms (Q745679) (← links)
- Sum of squares method for sensor network localization (Q839485) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- Strengthened semidefinite programming bounds for codes (Q868466) (← links)
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation (Q868475) (← links)
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- Symmetry in semidefinite programs (Q958029) (← links)
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming (Q984697) (← links)
- Exactness of sums of squares relaxations involving \(3\times 3\) matrices and Lorentz cones (Q996334) (← links)
- On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs (Q1024280) (← links)
- Numerical approaches for collaborative data processing (Q1027146) (← links)
- Noncoercive sums of squares in \(\mathbb R[x_1,\ldots ,x_n]\) (Q1040597) (← links)
- Exploiting group symmetry in truss topology optimization (Q1041375) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- Symmetry in Turán sums of squares polynomials from flag algebras (Q1637376) (← links)
- Symmetric sums of squares over \(k\)-subset hypercubes (Q1702778) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- A computational comparison of symmetry handling methods for mixed integer programs (Q1741126) (← links)
- Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system (Q1744121) (← links)
- Orbital shrinking: theory and applications (Q1786877) (← links)
- On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
- Controlled invariant hypersurfaces of polynomial control systems (Q1936483) (← links)
- Algorithms for highly symmetric linear and integer programs (Q1942261) (← links)
- Group symmetry and covariance regularization (Q1950873) (← links)
- An SOS counterexample to an inequality of symmetric functions (Q2022461) (← links)
- Multivariate interpolation: preserving and exploiting symmetry (Q2029002) (← links)
- Sparse interpolation in terms of multivariate Chebyshev polynomials (Q2098236) (← links)
- Heat transport bounds for a truncated model of Rayleigh-Bénard convection via polynomial optimization (Q2116300) (← links)
- On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
- Bounding the separable rank via polynomial optimization (Q2144234) (← links)
- Quantum entanglement, symmetric nonnegative quadratic polynomials and moment problems (Q2144545) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- Dimension reduction for semidefinite programs via Jordan algebras (Q2188241) (← links)
- Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
- Perturbation analysis for matrix joint block diagonalization (Q2273874) (← links)
- Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
- New bounds for truthful scheduling on two unrelated selfish machines (Q2300622) (← links)
- Modified orbital branching for structured symmetry with an application to unit commitment (Q2340280) (← links)
