Projectively and Weakly Simultaneously Diagonalizable Matrices and their Applications
From MaRDI portal
Publication:6180358
DOI10.1137/22m1507656arXiv2205.13245OpenAlexW4390913763WikidataQ129847229 ScholiaQ129847229MaRDI QIDQ6180358
Wentao Ding, Jian Ze Li, Shu-Zhong Zhang
Publication date: 19 January 2024
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.13245
quadratically constrained quadratic programmingindependent component analysiscanonical formsimultaneous diagonalizationprojective simultaneous diagonalizationweak simultaneous diagonalization
Nonlinear programming (90C30) Quadratic programming (90C20) Matrix pencils (15A22) Diagonalization, Jordan forms (15A20)
Cites Work
- Unnamed Item
- Pencils of complex and real symmetric and skew matrices
- Simultaneous block diagonalization of two real symmetric matrices
- 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
- Independent component analysis, a new concept?
- Quadratic maximization and semidefinite relaxation
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices
- On approximate diagonalization of third order symmetric tensors by orthogonal transformations
- The generalized trust region subproblem: solution complexity and convex hull results
- On the tightness of SDP relaxations of QCQPs
- 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
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- On approximately simultaneously diagonalizable matrices
- Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming
- Globally Convergent Jacobi-Type Algorithms for Simultaneous Orthogonal Symmetric Tensor Diagonalization
- Pairs of Matrices With Property L. II
- Semidefinite optimization
- Potpourri of Conjectures and Open Questions in Nonlinear Analysis and Optimization
- Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
- Quadratic optimization for simultaneous matrix diagonalization
- Jacobi Angles for Simultaneous Diagonalization
- A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program
- Simultaneous Diagonalization via Congruence of Hermitian Matrices: Some Equivalent Conditions and a Numerical Solution
- Approximate Matrix and Tensor Diagonalization by Unitary Transformations: Convergence of Jacobi-Type Algorithms
- Solving the Problem of Simultaneous Diagonalization of Complex Symmetric Matrices via Congruence
- Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
- Canonical Forms for Hermitian Matrix Pairs under Strict Equivalence and Congruence
- Non-orthogonal joint diagonalization in the least-squares sense with application in blind source separation
- Independent Component Analysis and Blind Signal Separation
- 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
