Pages that link to "Item:Q3352373"

The following pages link to An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix (Q3352373):

Displaying 32 items.

• Structure method for solving the nearest Euclidean distance matrix problem (Q261791) (← links)
• Hyperbolic smoothing and penalty techniques applied to molecular structure determination (Q408445) (← links)
• Solving a generalized distance geometry problem for protein structure determination (Q417280) (← links)
• A constrained matrix least-squares problem in structural dynamics model updating (Q484888) (← links)
• Conditional quadratic semidefinite programming: examples and methods (Q489109) (← links)
• Least-squares approximations in geometric buildup for solving distance geometry problems (Q637550) (← links)
• The discretizable molecular distance geometry problem (Q694593) (← links)
• Regularized multidimensional scaling with radial basis functions (Q747026) (← links)
• A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation (Q1048270) (← links)
• Dykstra's algorithm for constrained least-squares rectangular matrix problems (Q1130433) (← links)
• The embedding problem for predistance matrices (Q1176717) (← links)
• An optimization problem on subsets of the symmetric positive-semidefinite matrices (Q1321430) (← links)
• A molecular structure matching problem (Q1361391) (← links)
• Structured low rank approximation (Q1874666) (← links)
• Discriminant analysis of regularized multidimensional scaling (Q2061339) (← links)
• Model-based distance embedding with applications to chromosomal conformation biology (Q2170380) (← links)
• Robust Euclidean embedding via EDM optimization (Q2220896) (← links)
• Complementarity problems with respect to Loewnerian cones (Q2349522) (← links)
• An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data (Q2385507) (← links)
• Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation (Q2397097) (← links)
• The cone of distance matrices (Q2639130) (← links)
• Dykstras algorithm with bregman projections: A convergence proof (Q2709445) (← links)
• (Q2713568) (← links)
• Euclidean Distance Matrices and Applications (Q2802549) (← links)
• DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS (Q2925693) (← links)
• Molecular distance geometry methods: from continuous to discrete (Q3087839) (← links)
• Decomposition Methods for Sparse Matrix Nearness Problems (Q3456880) (← links)
• Rank reduction of correlation matrices by majorization (Q4610275) (← links)
• Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach (Q5252588) (← links)
• Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ? (Q5710542) (← links)
• An acceleration scheme for Dykstra's algorithm (Q5963308) (← links)
• Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications (Q6147811) (← links)