Projectively and Weakly Simultaneously Diagonalizable Matrices and their Applications
From MaRDI portal
Publication:6180358
Abstract: Characterizing simultaneously diagonalizable (SD) matrices has been receiving considerable attention in the recent decades due to its wide applications and its role in matrix analysis. However, the notion of SD matrices is arguably still restrictive for wider applications. In this paper, we consider two error measures related to the simultaneous diagonalization of matrices, and propose several new variants of SD thereof; in particular, TWSD, TWSD-B, T_{m,n}-SD (SDO), DWSD and D_{m,n}-SD (SDO). Those are all weaker forms of SD. We derive various sufficient and/or necessary conditions of them under different assumptions, and show the relationships between these new notions. Finally, we discuss the applications of these new notions in, e.g., quadratically constrained quadratic programming (QCQP) and independent component analysis (ICA).
Recommendations
- Simultaneous diagonalization of matrices and its applications in quadratically constrained quadratic programming
- Simultaneous diagonalization of rectangular matrices
- scientific article; zbMATH DE number 5260913
- Newton-type methods for simultaneous matrix diagonalization
- scientific article; zbMATH DE number 4033915
Cites work
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- A canonical form for a pair of real symmetric matrices that generate a nonsingular pencil
- A recurring theorem about pairs of quadratic forms and extensions: A survey
- A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints
- A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program
- Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms
- Canonical Forms for Hermitian Matrix Pairs under Strict Equivalence and Congruence
- Convergence of Gradient-Based Block Coordinate Descent Algorithms for Nonorthogonal Joint Approximate Diagonalization of Matrices
- Effective algorithms for optimal portfolio deleveraging problem with cross impact
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Exactness of semidefinite relaxations for nonlinear optimization problems with underlying graph structure
- Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- Independent Component Analysis and Blind Signal Separation
- Independent component analysis, a new concept?
- Jacobi Angles for Simultaneous Diagonalization
- Non-orthogonal joint diagonalization in the least-squares sense with application in blind source separation
- On approximate diagonalization of third order symmetric tensors by orthogonal transformations
- On approximately simultaneously diagonalizable matrices
- On the tightness of SDP relaxations of QCQPs
- Pairs of Matrices With Property L. II
- Pencils of complex and real symmetric and skew matrices
- Potpourri of Conjectures and Open Questions in Nonlinear Analysis and Optimization
- Quadratic maximization and semidefinite relaxation
- Quadratic optimization for simultaneous matrix diagonalization
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices
- Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
- Semidefinite optimization
- Simultaneous block diagonalization of two real symmetric matrices
- Simultaneous diagonalization of matrices and its applications in quadratically constrained quadratic programming
- Simultaneous diagonalization via congruence of Hermitian matrices: some equivalent conditions and a numerical solution
- Solving the problem of simultaneous diagonalization of complex symmetric matrices via congruence
- The generalized trust region subproblem: solution complexity and convex hull results
This page was built for publication: Projectively and Weakly Simultaneously Diagonalizable Matrices and their Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180358)
