A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
From MaRDI portal
Publication:623727
DOI10.1007/s13160-010-0006-9zbMath1204.65068OpenAlexW2085991972MaRDI QIDQ623727
Yoshihiro Kanno, Kazuo Murota, Sadayoshi Kojima, Kojima, Masakazu
Publication date: 8 February 2011
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-010-0006-9
Related Items
Sparse noncommutative polynomial optimization, Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software, Quantum compression relative to a set of measurements, Deciding Polyhedrality of Spectrahedra, On the number of matrices to generate a matrix \(\ast\)-algebra over the real field, Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs, A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with general irreducible components, An Algebraic Approach to Nonorthogonal General Joint Block Diagonalization, Recognizable series on graphs and hypergraphs, The tracial moment problem and trace-optimization of polynomials, Primal-dual interior-point algorithm for symmetric model predictive control, Characterizing the universal rigidity of generic tensegrities, Simultaneous singular value decomposition, The matricial relaxation of a linear matrix inequality, Symmetry-Independent Stability Analysis of Synchronization Patterns, Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming, Invariant Semidefinite Programs, Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction, On the unitary block-decomposability of 1-parameter matrix flows and static matrices, Optimization over trace polynomials, Schur's Lemma for Coupled Reducibility and Coupled Normality, Exploiting special structure in semidefinite programming: a survey of theory and applications, \(\Aut(\mathbb{F}_5)\) has property \((T)\), Fundamental Domains for Symmetric Optimization: Construction and Search, RepLAB: A Computational/Numerical Approach to Representation Theory, Exploiting symmetry in copositive programs via semidefinite hierarchies
Uses Software
Cites Work
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with general irreducible components
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
- Symmetry in semidefinite programs
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- Exploiting group symmetry in truss topology optimization
- A non-commutative spectral theorem
- Efficient decomposition of separable algebras.
- Group symmetry in interior-point methods for semidefinite program
- Symmetry groups, semidefinite programs, and sums of squares
- Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints
- Global Optimization with Polynomials and the Problem of Moments
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- CSDP 2.3 user's guide
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
