Pages that link to "Item:Q5502244"

The following pages link to An Efficient Gauss--Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations (Q5502244):

Displaying 15 items.

• Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset (Q518124) (← links)
• Orbital minimization method with \(\ell^{1}\) regularization (Q1685597) (← links)
• Fast algorithms for robust principal component analysis with an upper bound on the rank (Q2028928) (← links)
• Trace minimization method via penalty for linear response eigenvalue problems (Q2083411) (← links)
• Triangularized orthogonalization-free method for solving extreme eigenvalue problems (Q2103436) (← links)
• An alternating minimization method for matrix completion problems (Q2182816) (← links)
• A brief introduction to manifold optimization (Q2218094) (← links)
• An efficient damped Newton-type algorithm with globalization strategy on Riemannian manifolds (Q2667131) (← links)
• A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints (Q4603042) (← links)
• A class of smooth exact penalty function methods for optimization problems with orthogonality constraints (Q5058369) (← links)
• Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints (Q5230625) (← links)
• CoordinateWise Descent Methods for Leading Eigenvalue Problem (Q5230665) (← links)
• An alternating minimization method for robust principal component analysis (Q5238069) (← links)
• Stochastic Gauss-Newton algorithms for online PCA (Q6111665) (← links)
• Weighted Trace-Penalty Minimization for Full Configuration Interaction (Q6189167) (← links)