scientific article; zbMATH DE number 4158856

MaRDI QIDQ3487569zbMATH OpenFDO

Authors Charles R. Johnson

Publication date 1990

zbMATH Keywords

completions of partial matricescompletions of prescribed rankcontractions completionsdeterminantal inequalitiesmaximal determinant completionspartial matrixpositive completions

Mathematics Subject Classification ID

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

Recommendations

• Survey on matrix completion models and algorithms
• Matrix completion problems
• On a Class of Matrix Completion Problems
• Some matrix completion problems
• Recent progress on matrix completion problems
• A note on matrix completion problems
• The nonsingular matrix completion problem
• The \(N_{0}^{1}\)-matrix completion problem
• Some empirical advances in matrix completion
• Matrix completion under complex survey sampling

Cited in

(76)

• Matrix completion problems
• High, low, and quantitative roads in linear algebra
• The symbiotic relationship of combinatorics and matrix theory
• Positive definite completions and determinant maximization
• Sub-direct sums and positivity classes of matrices
• Matrix sandwich problems
• Minimizing the condition number of a positive definite matrix by completion
• Cuts, matrix completions and graph rigidity
• On the uniqueness of Euclidean distance matrix completions.
• \(P\)-matrix completions under weak symmetry assumptions
• Completing symplectic matrices
• Completing triangular block matrices with maximal and minimal ranks
• Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
• Measures of generalized magnitude-squared coherence: differences and similarities
• 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
• Uniqueness of the solutions of some completion problems
• Positive definite constrained least-squares estimation of matrices
• The completion problem for M-matrices and inverse M-matrices
• Asymmetric TP and TN completion problems
• Distance geometry for kissing spheres
• An efficient algorithm for maximum entropy extension of block-circulant covariance matrices
• On completions of symmetric and antisymmetric block diagonal partial matrices
• Rectangular submatrices of inverse \(\mathcal M\)-matrices and the decomposition of a positive matrix as a sum
• On inverse-positivity of sub-direct sums of matrices
• The complexity of binary matrix completion under diameter constraints
• scientific article; zbMATH DE number 1665566 (Why is no real title available?)
• Completions of triangular matrices: A survey of results and open problems
• Maximum entropy models for general lag patterns
• Completion of Hankel partial contractions of non-extremal type
• Matrix completions, moments, and sums of Hermitian squares
• Maximum entropy for periodically correlated processes from nonconsecutive autocovariance coefficients
• Matrix completion for the independence model
• The nonsingular matrix completion problem
• On the solvability of derived matrix problems, including completions and duals
• An Answer to a Question of M. Newman on Matrix Completion
• scientific article; zbMATH DE number 4107004 (Why is no real title available?)
• scientific article; zbMATH DE number 1336312 (Why is no real title available?)
• A guide to conic optimisation and its applications
• On the equivalence between low-rank matrix completion and tensor rank
• Recent results on Douglas-Rachford methods for combinatorial optimization problems
• 2n-by-2n symplectic completions of matrices of order 2n-1
• Complex symmetric completions of partial operator matrices
• On the complexity of solving feasibility problems with regularized models
• Direct approach to rank-1 completions of partial matrices
• Leave-One-Out Approach for Matrix Completion: Primal and Dual Analysis
• Geometric mean of partial positive definite matrices with missing entries
• Rank-one completions of partial matrices and completely rank-nonincreasing linear functionals
• Topological aspects of matrix abduction. II
• Inverse \(M\)-matrices. II
• Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
• Completion of partial matrices to contractions
• Graph theoretic methods for matrix completion problems
• Matrix completion problems of block type
• The real positive definite completion problem for a 4-cycle
• Contractive symmetric matrix completion problems related to graphs
• Interpolation in multivariable de Branges-Rovnyak spaces
• The elliptic matrix completion problem
• Min-rank conjecture for log-depth circuits
• Matrix completion from a computational statistics perspective
• Triangular ranks do not bound minimum ranks in matrix completion
• The real positive semidefinite completion problem for series-parallel graphs
• The Birational Geometry of Ceva’s Theorem
• Semidefinite programming for discrete optimization and matrix completion problems
• A survey of totally positive matrix completion problems
• Completion problems and sparsity for Kemeny's constant
• Binary matrix completion under diameter constraints
• The extremal ranks of \(A_1-B_1XC_1\) subject to a pair of matrix equations
• Extensions of positive definite functions on free groups
• The positive definite completion problem revisited
• Subdirect sums of \(P(P_0)\)-matrices and totally nonnegative matrices
• On singular values of partially prescribed matrices
• The inverse of any two-by-two nonsingular partitioned matrix and three matrix inverse completion problems
• A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices
• Positive polynomials on projective limits of real algebraic varieties
• Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3487569)