scientific article

Publication date: 1990

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

partial matrix determinantal inequalities completions of partial matrices completions of prescribed rank contractions completions maximal determinant completions positive completions

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Positive matrices and their generalizations; cones of matrices (15B48) Hermitian, skew-Hermitian, and related matrices (15B57) Miscellaneous inequalities involving matrices (15A45) Vector spaces, linear dependence, rank, lineability (15A03) Research exposition (monographs, survey articles) pertaining to linear algebra (15-02)

Related Items

On the complexity of solving feasibility problems with regularized models, Uniqueness of the solutions of some completion problems, On inverse-positivity of sub-direct sums of matrices, Positive definite constrained least-squares estimation of matrices, Cuts, matrix completions and graph rigidity, On the solvability of derived matrix problems, including completions and duals, Measures of generalized magnitude-squared coherence: differences and similarities, Maximum entropy models for general lag patterns, The extremal ranks of \(A_1-B_1XC_1\) subject to a pair of matrix equations, The completion problem for \(M\)-matrices and inverse \(M\)-matrices, Extensions of positive definite functions on free groups, Topological Aspects of Matrix Abduction 2, The complexity of binary matrix completion under diameter constraints, Asymmetric TP and TN completion problems, Interpolation in multivariable de Branges-Rovnyak spaces, On the uniqueness of Euclidean distance matrix completions., The elliptic matrix completion problem, An efficient algorithm for maximum entropy extension of block-circulant covariance matrices, Recent results on Douglas-Rachford methods for combinatorial optimization problems, Min-rank conjecture for log-depth circuits, Geometric mean of partial positive definite matrices with missing entries, A guide to conic optimisation and its applications, High, low, and quantitative roads in linear algebra, The symbiotic relationship of combinatorics and matrix theory, On the equivalence between low-rank matrix completion and tensor rank, The real positive semidefinite completion problem for series-parallel graphs, The positive definite completion problem revisited, Subdirect sums of \(P(P_0)\)-matrices and totally nonnegative matrices, Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization, Semidefinite programming for discrete optimization and matrix completion problems, Graph theoretic methods for matrix completion problems, The inverse of any two-by-two nonsingular partitioned matrix and three matrix inverse completion problems, Inverse \(M\)-matrices. II, A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices, On the uniqueness of Euclidean distance matrix completions: the case of points in general position, On Fiedler's characterization of tridiagonal matrices over arbitrary fields, The real positive definite completion problem for a 4-cycle, Positive polynomials on projective limits of real algebraic varieties, Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming, Maximum entropy for periodically correlated processes from nonconsecutive autocovariance coefficients, 2n-by-2n symplectic completions of matrices of order 2n − 1, \(P\)-matrix completions under weak symmetry assumptions, Completing symplectic matrices, Complex symmetric completions of partial operator matrices, Rectangular submatrices of inverse \(\mathcal M\)-matrices and the decomposition of a positive matrix as a sum, Positive definite completions and determinant maximization, Sub-direct sums and positivity classes of matrices, Matrix sandwich problems, Completing triangular block matrices with maximal and minimal ranks, Distance geometry for kissing spheres, Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem