Pages that link to "Item:Q2524490"

The following pages link to A generalized solution of the orthogonal Procrustes problem (Q2524490):

Displaying 50 items.

• Estimation of 3D category-specific object structure: symmetry, Manhattan and/or multiple images (Q2193825) (← links)
• Vertex nomination, consistent estimation, and adversarial modification (Q2199707) (← links)
• Defining the pose of any 3D rigid object and an associated distance (Q2200006) (← links)
• A mode tracking method in modal metamodeling for structures with clustered eigenvalues (Q2236132) (← links)
• Hyperbolic node embedding for temporal networks (Q2238334) (← links)
• Link prediction in dynamic networks using random dot product graphs (Q2238354) (← links)
• Factor analysis via components analysis (Q2275429) (← links)
• Uncertainty characterization of the orthogonal Procrustes problem with arbitrary covariance matrices (Q2289599) (← links)
• Benefits from using mixed precision computations in the ELPA-AEO and ESSEX-II eigensolver projects (Q2318531) (← links)
• Direct Schmid-Leiman transformations and rank-deficient loadings matrices (Q2318844) (← links)
• Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods (Q2330648) (← links)
• On the correspondence between Procrustes analysis and bidimensional regression (Q2359573) (← links)
• The local convexity of solving systems of quadratic equations (Q2410810) (← links)
• Orthogonal optimal reverse prediction for semi-supervised learning (Q2417838) (← links)
• The \((M, N)\)-symmetric Procrustes problem (Q2425957) (← links)
• Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem (Q2454077) (← links)
• A closed-form solution to non-rigid shape and motion recovery (Q2508361) (← links)
• Generalized shapes and point sets correspondence and registration (Q2516337) (← links)
• Best linear composites with a specified structure (Q2533832) (← links)
• Properties and applications of Gramian factoring (Q2537639) (← links)
• A theorem on the trace of certain matrix products and some applications (Q2542400) (← links)
• A new solution to the additive constant problem in metric multidimensional scaling (Q2553326) (← links)
• An efficient method for computing factor similarity coefficients: a computational note and an algorithm (Q2563639) (← links)
• Multidimensional rotation and scaling of configurations to optimal agreement (Q2639526) (← links)
• Multidimensional scaling of noisy high dimensional data (Q2659741) (← links)
• Robust principal component analysis: a factorization-based approach with linear complexity (Q2660750) (← links)
• Multiple partitions alignment via spectral rotation (Q2673325) (← links)
• Implicit steepest descent algorithm for optimization with orthogonality constraints (Q2673531) (← links)
• Quantum channels over graph states using generalized measurement-based quantum computation framework (Q2677159) (← links)
• \texttt{Procrustes}: a python library to find transformations that maximize the similarity between matrices (Q2695590) (← links)
• (Q2750809) (← links)
• Euclidean Distance Matrices and Applications (Q2802549) (← links)
• FACTOR UNIQUENESS IN THE S&P 500 UNIVERSE: CAN PROPRIETARY FACTORS EXIST? (Q2842533) (← links)
• DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS (Q2925693) (← links)
• An Improved Majorization Algorithm for Robust Procrustes Analysis (Q3178559) (← links)
• Synchronization of Independently Moving Cameras via Motion Recovery (Q3188210) (← links)
• NATURAL METRIC FOR QUANTUM INFORMATION THEORY (Q3401885) (← links)
• A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints (Q4603042) (← links)
• A non-monotone linear search algorithm with mixed direction on Stiefel manifold (Q4622892) (← links)
• (Q4636989) (← links)
• Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods (Q5003207) (← links)
• (Q5053320) (← links)
• Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming (Q5057261) (← links)
• (Q5108550) (← links)
• Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach (Q5252588) (← links)
• A High Performance QDWH-SVD Solver Using Hardware Accelerators (Q5270768) (← links)
• Least squares, singular values and matrix approximations (Q5569883) (← links)
• Guarantees for Existence of a Best Canonical Polyadic Approximation of a Noisy Low-Rank Tensor (Q5862812) (← links)
• Constructing Common Factors from Continuous and Categorical Data (Q5863576) (← links)
• Orthogonal decomposition of tensor trains (Q5888857) (← links)