Approximation by matrices positive semidefinite on a subspace

From MaRDI portal
Publication:1117291

DOI10.1016/0024-3795(88)90202-9zbMath0667.15020OpenAlexW1989148040MaRDI QIDQ1117291

James H. Wells, Thomas L. Hayden

Publication date: 1988

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(88)90202-9



Related Items

An iteration method to solve multiple constrained least squares problems, Connections between the real positive semidefinite and distance matrix completion problems, Unnamed Item, Decomposition Methods for Sparse Matrix Nearness Problems, The cone of distance matrices, Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination, Regularity properties of non-negative sparsity sets, DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS, Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation, Finite metric spaces of strictly negative type, Dykstra's algorithm for constrained least-squares rectangular matrix problems, Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications, Rank reduction of correlation matrices by majorization, Computing the nearest Euclidean distance matrix with low embedding dimensions, The embedding problem for predistance matrices, Conditional quadratic semidefinite programming: examples and methods, Algebra -- 9. Translated from the Russian, Bitopological spaces, Matrix optimization based Euclidean embedding with outliers, Eigenstructure of distance matrices with an equal distance subset, Euclidean distance matrices: new characterization and boundary properties, Investigations in topology. 9. Work collection, Conditionally definite matrices, Bitopologies on products and ratios, Distance geometry for kissing spheres, Distance matrices and regular figures, Replica analysis of overfitting in generalized linear regression models



Cites Work