Matrix completion and decomposition in phase-bounded cones
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 549886 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 635657 (Why is no real title available?)
- scientific article; zbMATH DE number 1182568 (Why is no real title available?)
- scientific article; zbMATH DE number 953386 (Why is no real title available?)
- A phase theory of multi-input multi-output linear time-invariant systems
- A regularization algorithm for matrices of bilinear and sesquilinear forms
- A simple proof of the elliptical range theorem
- Canonical forms for complex matrix congruence and \(^{*}\)-congruence
- Connections between the real positive semidefinite and distance matrix completion problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Decomposition in conic optimization with partially separable structure
- Decomposition methods for sparse matrix nearness problems
- Determinantal formulae for matrix completions associated with chordal graphs
- Domain of attraction. Analysis and control via SOS programming.
- Eigenvalues of the unitary part of a matrix
- Extensions of band matrices with band inverses
- Matrix completions, moments, and sums of Hermitian squares
- Numerical ranges and matrix completions
- On the cartesian decomposition of a matrix
- On the phases of a complex matrix
- On the phases of a semi-sectorial matrix and the essential phase of a Laplacian
- Perturbation theory for linear operators.
- Phase preservation of N-port networks under general connections
- Phases of discrete-time LTI multivariable systems
- Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems
- Positive Semidefinite Pattern Decompositions
- Positive definite completions of partial Hermitian matrices
- Positive semidefinite matrices with a given sparsity pattern
- Schur products and matrix completions
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Spectral variation under congruence
- Spectral variation under congruence for a nonsingular matrix with 0 on the boundary of its field of values
- Sum-of-squares chordal decomposition of polynomial matrix inequalities
- The Euclidian Distance Matrix Completion Problem
- The real positive definite completion problem for a simple cycle
- The real positive semidefinite completion problem for series-parallel graphs
- Theory of semidefinite programming for sensor network localization
- Unitary dilation approach to contractive matrix completion.
This page was built for publication: Matrix completion and decomposition in phase-bounded cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6993638)
