Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
From MaRDI portal
Publication:5169658
DOI10.1287/moor.1120.0558zbMath1291.90167arXiv1103.0486OpenAlexW3100496417MaRDI QIDQ5169658
Cordian Riener, Lina J. Andrén, Jean-Bernard Lasserre, Thorsten Theobald
Publication date: 11 July 2014
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.0486
semidefinite programmingconstrained optimizationsymmetric grouppolynomial optimizationsemidefinite relaxation symmetry
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Combinatorial aspects of representation theory (05E10) Real algebraic sets (14P05)
Related Items
Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets, Symmetry in Turán sums of squares polynomials from flag algebras, Sparse noncommutative polynomial optimization, Continuous multifacility ordered median location problems, Duality of sum of nonnegative circuit polynomials and optimal SONC bounds, Finding largest small polygons with gloptipoly, Symmetry Reduction in AM/GM-Based Optimization, Symmetric non-negative forms and sums of squares, Algorithms for fundamental invariants and equivariants of finite groups, Symmetry in multivariate ideal interpolation, Semidefinite Relaxation Methods for Tensor Absolute Value Equations, Faster real root decision algorithm for symmetric polynomials, Reflection groups and cones of sums of squares, A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming, The poset of Specht ideals for hyperoctahedral groups, Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks, Border basis relaxation for polynomial optimization, Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022, Invariants of SDP exactness in quadratic programming, Sum-of-squares chordal decomposition of polynomial matrix inequalities, Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting), Symmetric sums of squares over \(k\)-subset hypercubes, Binary cumulant varieties, Computing the Hausdorff Boundary Measure of Semialgebraic Sets, Polynomial Norms, DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization, TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity, Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables, Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling, Symmetry in semidefinite programs, A polynomial optimization approach to constant rebalanced portfolio selection, A survey on conic relaxations of optimal power flow problem, Discriminants of cyclic homogeneous inequalities of three variables, Multivariate interpolation: preserving and exploiting symmetry, Symmetric ideals, Specht polynomials and solutions to symmetric systems of equations, Invariant Semidefinite Programs, Moment methods in energy minimization: New bounds for Riesz minimal energy problems, Optimization over trace polynomials, A unified framework of SAGE and SONC polynomials and its duality theory, Sparse interpolation in terms of multivariate Chebyshev polynomials, Dimension-free entanglement detection in multipartite Werner states, Computing critical points for invariant algebraic systems, Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory, Exploiting symmetry in copositive programs via semidefinite hierarchies, Symmetric semi-algebraic sets and non-negativity of symmetric polynomials
Uses Software
