Projectively and Weakly Simultaneously Diagonalizable Matrices and their Applications
From MaRDI portal
Publication:6180358
DOI10.1137/22M1507656arXiv2205.13245OpenAlexW4390913763WikidataQ129847229 ScholiaQ129847229MaRDI QIDQ6180358FDOQ6180358
Authors: Wentao Ding, Jianze Li, Shuzhong Zhang 
Publication date: 19 January 2024
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
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).
Full work available at URL: https://arxiv.org/abs/2205.13245
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
independent component analysissimultaneous diagonalizationcanonical formquadratically constrained quadratic programmingprojective simultaneous diagonalizationweak simultaneous diagonalization
Quadratic programming (90C20) Nonlinear programming (90C30) Matrix pencils (15A22) Diagonalization, Jordan forms (15A20)
Cites Work
- Independent component analysis, a new concept?
- Jacobi Angles for Simultaneous Diagonalization
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- Semidefinite optimization
- Title not available (Why is that?)
- Pencils of complex and real symmetric and skew matrices
- A recurring theorem about pairs of quadratic forms and extensions: A survey
- Pairs of Matrices With Property L. II
- Potpourri of Conjectures and Open Questions in Nonlinear Analysis and Optimization
- Canonical Forms for Hermitian Matrix Pairs under Strict Equivalence and Congruence
- Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
- Simultaneous block diagonalization of two real symmetric matrices
- Quadratic maximization and semidefinite relaxation
- A canonical form for a pair of real symmetric matrices that generate a nonsingular pencil
- On approximately simultaneously diagonalizable matrices
- Quadratic optimization for simultaneous matrix diagonalization
- Non-orthogonal joint diagonalization in the least-squares sense with application in blind source separation
- Independent Component Analysis and Blind Signal Separation
- Exactness of semidefinite relaxations for nonlinear optimization problems with underlying graph structure
- Simultaneous diagonalization via congruence of Hermitian matrices: some equivalent conditions and a numerical solution
- Simultaneous diagonalization of matrices and its applications in quadratically constrained quadratic programming
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices
- The generalized trust region subproblem: solution complexity and convex hull results
- On approximate diagonalization of third order symmetric tensors by orthogonal transformations
- Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints
- Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms
- On the tightness of SDP relaxations of QCQPs
- Solving the problem of simultaneous diagonalization of complex symmetric matrices via congruence
- A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program
- 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
Cited In (1)
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)
