Pages that link to "Item:Q1117291"
From MaRDI portal
The following pages link to Approximation by matrices positive semidefinite on a subspace (Q1117291):
Displaying 38 items.
- Regularity properties of non-negative sparsity sets (Q342902) (← links)
- Approximation problems in the Riemannian matric on positive definite metrices (Q402914) (← links)
- Computing the nearest Euclidean distance matrix with low embedding dimensions (Q463737) (← links)
- Conditional quadratic semidefinite programming: examples and methods (Q489109) (← links)
- Approximation in trace norm by positive semidefinite matrices (Q1066026) (← links)
- Dykstra's algorithm for constrained least-squares rectangular matrix problems (Q1130433) (← links)
- The embedding problem for predistance matrices (Q1176717) (← links)
- Distance matrices and regular figures (Q1316171) (← links)
- Critical points of matrix least squares distance functions (Q1347216) (← links)
- Finite metric spaces of strictly negative type (Q1377510) (← links)
- Investigations in topology. 9. Work collection (Q1575790) (← links)
- Conditionally definite matrices (Q1576008) (← links)
- Bitopologies on products and ratios (Q1576016) (← links)
- A remark on the rank of positive semidefinite matrices subject to affine constraints (Q1592506) (← links)
- Eigenstructure of distance matrices with an equal distance subset (Q1808938) (← links)
- Connections between the real positive semidefinite and distance matrix completion problems (Q1894505) (← links)
- Algebra -- 9. Translated from the Russian (Q1977412) (← links)
- Matrix optimization based Euclidean embedding with outliers (Q2044470) (← links)
- Distance geometry for kissing spheres (Q2348019) (← links)
- Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation (Q2397097) (← links)
- Positive definite matrix approximation with condition number constraint (Q2448171) (← links)
- An iteration method to solve multiple constrained least squares problems (Q2628358) (← links)
- The cone of distance matrices (Q2639130) (← links)
- Maximization of quadratic forms expressed by distance matrices (Q2641682) (← links)
- Computing the nearest diagonally dominant matrix (Q2713568) (← links)
- On the approximation between affine subspaces (Q2721707) (← links)
- Douglas-Rachford feasibility methods for matrix completion problems (Q2925693) (← links)
- Direction-Preserving and Schur-Monotonic Semiseparable Approximations of Symmetric Positive Definite Matrices (Q3079763) (← links)
- Euclidean distance matrices: new characterization and boundary properties (Q3399120) (← links)
- Decomposition Methods for Sparse Matrix Nearness Problems (Q3456880) (← links)
- Approximate Semidefinite Matrices in a Linear Variety (Q4210263) (← links)
- Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination (Q4557875) (← links)
- Rank reduction of correlation matrices by majorization (Q4610275) (← links)
- Preserving Positive Definiteness in Hierarchically Semiseparable Matrix Approximations (Q4643332) (← links)
- Replica analysis of overfitting in generalized linear regression models (Q5870629) (← links)
- Bitopological spaces (Q5915401) (← links)
- Evaluating approximations of the semidefinite cone with trace normalized distance (Q6043109) (← links)
- Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications (Q6147811) (← links)
