Positive definite completions of partial Hermitian matrices
From MaRDI portal
Publication:798738
DOI10.1016/0024-3795(84)90207-6zbMath0547.15011OpenAlexW2006704773WikidataQ115802379 ScholiaQ115802379MaRDI QIDQ798738
Eduardo Marques de Sá, Henry Wolkowicz, Charles R. Johnson, Robert D. Grone
Publication date: 1984
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(84)90207-6
Related Items (only showing first 100 items - show all)
SPN completable graphs ⋮ Shift invariant subspaces, factorization, and interpolation for matrices. I. The canonical case ⋮ Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches ⋮ Some exact distance constants ⋮ Invertible completions of partial operator matrices: The nonsymmetric case ⋮ Spanning-tree extensions of the Hadamard-Fischer inequalities ⋮ Completely positive completion of partial matrices whose entries are completely bounded maps ⋮ Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank ⋮ Completing a block diagonal matrix with a partially prescribed inverse ⋮ Connections between the real positive semidefinite and distance matrix completion problems ⋮ Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem ⋮ Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems ⋮ Completion problem with partial correlation vines ⋮ Global completability with applications to self-consistent quantum tomography ⋮ Extremal rays and duals for cones of positive definite matrices with prescribed zeros ⋮ Rank decomposability in incident spaces ⋮ Combinatorial matrix analysis: An overview ⋮ Positive semidefinite matrices with a given sparsity pattern ⋮ Cuts, matrix completions and graph rigidity ⋮ Sparse sums of squares on finite abelian groups and improved semidefinite lifts ⋮ An optimal variant of Kelley's cutting-plane method ⋮ Copositive matrices with circulant zero support set ⋮ On the solvability of derived matrix problems, including completions and duals ⋮ Partial identification in the statistical matching problem ⋮ Large-scale semidefinite programming via a saddle point mirror-prox algorithm ⋮ Schur analysis of some completion problems ⋮ Schur products and matrix completions ⋮ Perfect elimination orderings for symmetric matrices ⋮ Completions of \(M\)-matrix patterns ⋮ A connection between positive semidefinite and Euclidean distance matrix completion problems ⋮ Structural conditions for cycle completable graphs ⋮ A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables ⋮ The completion problem for \(M\)-matrices and inverse \(M\)-matrices ⋮ Extensions of positive definite functions on free groups ⋮ Positive definite Hankel matrix completions and Hamburger moment completions ⋮ Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones ⋮ Critical exponents of graphs ⋮ On the uniqueness of Euclidean distance matrix completions. ⋮ The elliptic matrix completion problem ⋮ Sparse matrix decompositions and graph characterizations ⋮ A parameterization of positive definite matrices in terms of partial correlation vines ⋮ Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization ⋮ Matrix completions and chordal graphs ⋮ Matrix completion problems for pairs of related classes of matrices. ⋮ Bordered matrices ⋮ Geometry of maximum likelihood estimation in Gaussian graphical models ⋮ On linear programs with linear complementarity constraints ⋮ Maximum likelihood threshold and generic completion rank of graphs ⋮ Some extremal problems for positive definite matrices and operators ⋮ Posterior convergence rates for estimating large precision matrices using graphical models ⋮ Inheritance principles for chordal graphs ⋮ Sparse quasi-Newton updates with positive definite matrix completion ⋮ Lifting positive elements in \(C^*\)-algebras ⋮ The positive definite completion problem relative to a subspace ⋮ High, low, and quantitative roads in linear algebra ⋮ The symbiotic relationship of combinatorics and matrix theory ⋮ An inertia formula for Hermitian matrices with sparse inverses ⋮ Completion of operator partial matrices associated with chordal graphs ⋮ Completions of matrices and the commutant lifting theorem ⋮ The real positive semidefinite completion problem for series-parallel graphs ⋮ The positive definite completion problem revisited ⋮ The critical exponent: a novel graph invariant ⋮ One-step completions of Hermitian partial matrices with minimal negative signature ⋮ Positive semidefinite completions of partial Hermitian matrices ⋮ Power transmission network expansion planning: a semidefinite programming branch-and-bound approach ⋮ Max-min problems on the ranks and inertias of the matrix expressions \(A - BXC \pm (BXC)^{\ast}\) with applications ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ A parallel interior point decomposition algorithm for block angular semidefinite programs ⋮ Joint density of correlations in the correlation matrix with chordal sparsity patterns ⋮ A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices ⋮ The doubly negative matrix completion problem ⋮ Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion ⋮ Completion of partial matrices to contractions ⋮ The truncated Hamburger moment problems with gaps in the index set ⋮ Finding positive matrices subject to linear restrictions ⋮ Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming ⋮ Flexible covariance estimation in graphical Gaussian models ⋮ Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion ⋮ Faster, but weaker, relaxations for quadratically constrained quadratic programs ⋮ Completions of inverse \(M\)-matrix patterns ⋮ Extremal bipartite matrices ⋮ Determinantal formulae for matrix completions associated with chordal graphs ⋮ The inertia sets of symmetric tridiagonal sign-patterns ⋮ Bregman primal-dual first-order method and application to sparse semidefinite programming ⋮ Decomposed structured subsets for semidefinite and sum-of-squares optimization ⋮ Exploiting sparsity in complex polynomial optimization ⋮ \(P\)-matrix completions under weak symmetry assumptions ⋮ Exploiting special structure in semidefinite programming: a survey of theory and applications ⋮ The cycle completable graphs for the completely positive and doubly nonnegative completion problems ⋮ Inverse \(M\)-matrix completions of patterns omitting some diagonal positions ⋮ Some results on the Gaussian Markov random field construction problem based on the use of invariant subgraphs ⋮ Numerical ranges and matrix completions ⋮ Positive definite completions and determinant maximization ⋮ Sub-direct sums and positivity classes of matrices ⋮ The symmetric inverse \(M\)-matrix completion problem ⋮ AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization ⋮ Matrix sandwich problems ⋮ The real positive definite completion problem for a simple cycle ⋮ Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem ⋮ The completion of covariance kernels
Cites Work
This page was built for publication: Positive definite completions of partial Hermitian matrices
