The following pages link to (Q3487569):
Displaying 50 items.
- On the solvability of derived matrix problems, including completions and duals (Q347496) (← links)
- Recent results on Douglas-Rachford methods for combinatorial optimization problems (Q467464) (← links)
- Inverse \(M\)-matrices. II (Q551242) (← links)
- The elliptic matrix completion problem (Q630533) (← links)
- Min-rank conjecture for log-depth circuits (Q657911) (← links)
- The real positive semidefinite completion problem for series-parallel graphs (Q676039) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- The extremal ranks of \(A_1-B_1XC_1\) subject to a pair of matrix equations (Q879768) (← links)
- Extensions of positive definite functions on free groups (Q883507) (← links)
- The positive definite completion problem revisited (Q947605) (← links)
- Subdirect sums of \(P(P_0)\)-matrices and totally nonnegative matrices (Q947639) (← links)
- The inverse of any two-by-two nonsingular partitioned matrix and three matrix inverse completion problems (Q971632) (← links)
- A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices (Q979016) (← links)
- Positive polynomials on projective limits of real algebraic varieties (Q998968) (← links)
- Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming (Q999796) (← links)
- High, low, and quantitative roads in linear algebra (Q1183181) (← links)
- The symbiotic relationship of combinatorics and matrix theory (Q1183182) (← links)
- Positive definite completions and determinant maximization (Q1300861) (← links)
- Sub-direct sums and positivity classes of matrices (Q1300873) (← links)
- Matrix sandwich problems (Q1307537) (← links)
- Minimizing the condition number of a positive definite matrix by completion (Q1347061) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- On the uniqueness of Euclidean distance matrix completions. (Q1405021) (← links)
- \(P\)-matrix completions under weak symmetry assumptions (Q1573659) (← links)
- Completing symplectic matrices (Q1573660) (← links)
- Completing triangular block matrices with maximal and minimal ranks (Q1595160) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- Measures of generalized magnitude-squared coherence: differences and similarities (Q1661780) (← links)
- On the uniqueness of Euclidean distance matrix completions: the case of points in general position (Q1774976) (← links)
- On Fiedler's characterization of tridiagonal matrices over arbitrary fields (Q1779413) (← links)
- Uniqueness of the solutions of some completion problems (Q1887497) (← links)
- Positive definite constrained least-squares estimation of matrices (Q1902117) (← links)
- The completion problem for \(M\)-matrices and inverse \(M\)-matrices (Q1923169) (← links)
- Asymmetric TP and TN completion problems (Q1938672) (← links)
- Distance geometry for kissing spheres (Q2348019) (← links)
- An efficient algorithm for maximum entropy extension of block-circulant covariance matrices (Q2435387) (← links)
- Rectangular submatrices of inverse \(\mathcal M\)-matrices and the decomposition of a positive matrix as a sum (Q2568986) (← links)
- On inverse-positivity of sub-direct sums of matrices (Q2637151) (← links)
- The complexity of binary matrix completion under diameter constraints (Q2678254) (← links)
- Maximum entropy models for general lag patterns (Q2930906) (← links)
- Maximum entropy for periodically correlated processes from nonconsecutive autocovariance coefficients (Q3077658) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- On the equivalence between low-rank matrix completion and tensor rank (Q4640079) (← links)
- 2n-by-2n symplectic completions of matrices of order 2n − 1 (Q4985505) (← links)
- Complex symmetric completions of partial operator matrices (Q4992652) (← links)
- On the complexity of solving feasibility problems with regularized models (Q5038424) (← links)
- Geometric mean of partial positive definite matrices with missing entries (Q5145076) (← links)
- Topological Aspects of Matrix Abduction 2 (Q5350344) (← links)
- Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization (Q5737726) (← links)
- Graph theoretic methods for matrix completion problems (Q5935567) (← links)
