The following pages link to (Q3161693):
Displaying 50 items.
- Parallel matrix factorization for low-rank tensor completion (Q256035) (← links)
- An alternating direction method with continuation for nonconvex low rank minimization (Q257130) (← links)
- A new gradient projection method for matrix completion (Q300199) (← links)
- Accelerating large partial EVD/SVD calculations by filtered block Davidson methods (Q341332) (← links)
- Low rank matrix recovery from rank one measurements (Q347516) (← links)
- An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem (Q353167) (← links)
- Linearized alternating direction method with adaptive penalty and warm starts for fast solving transform invariant low-rank textures (Q361272) (← links)
- Fast alternating linearization methods for minimizing the sum of two convex functions (Q378095) (← links)
- Approximation of rank function and its application to the nearest low-rank correlation matrix (Q386463) (← links)
- An implementable proximal point algorithmic framework for nuclear norm minimization (Q431025) (← links)
- A sparsity preserving stochastic gradient methods for sparse regression (Q457215) (← links)
- An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion (Q460667) (← links)
- Modified alternating direction methods for the modified multiple-sets split feasibility problems (Q467474) (← links)
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems (Q495943) (← links)
- A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion (Q503487) (← links)
- Decomposable norm minimization with proximal-gradient homotopy algorithm (Q513723) (← links)
- Convergence of iterative hard-thresholding algorithm with continuation (Q523178) (← links)
- Convergence of fixed-point continuation algorithms for matrix rank minimization (Q535287) (← links)
- A new algorithm for positive semidefinite matrix completion (Q670219) (← links)
- Max-norm optimization for robust matrix recovery (Q681486) (← links)
- Projected Landweber iteration for matrix completion (Q708281) (← links)
- Rank minimization with applications to image noise removal (Q781854) (← links)
- Convex relaxation algorithm for a structured simultaneous low-rank and sparse recovery problem (Q888314) (← links)
- Learning Markov random walks for robust subspace clustering and estimation (Q889299) (← links)
- The augmented Lagrangian method based on the APG strategy for an inverse damped gyroscopic eigenvalue problem (Q902100) (← links)
- A penalty method for rank minimization problems in symmetric matrices (Q1616933) (← links)
- A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis (Q1639712) (← links)
- Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization (Q1650690) (← links)
- Bayesian robust principal component analysis with structured sparse component (Q1658445) (← links)
- Sparse estimation of high-dimensional correlation matrices (Q1660228) (← links)
- A rank-constrained matrix representation for hypergraph-based subspace clustering (Q1666026) (← links)
- Sparse and low-rank matrix regularization for learning time-varying Markov networks (Q1689602) (← links)
- Proximal iteratively reweighted algorithm for low-rank matrix recovery (Q1691320) (← links)
- \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization (Q1694395) (← links)
- Shrinking gradient descent algorithms for total variation regularized image denoising (Q1694398) (← links)
- Affine matrix rank minimization problem via non-convex fraction function penalty (Q1696454) (← links)
- A new nonconvex approach to low-rank matrix completion with application to image inpainting (Q1710943) (← links)
- A generalized robust minimization framework for low-rank matrix recovery (Q1718892) (← links)
- Feature selection and classification for high-dimensional incomplete multimodal data (Q1720434) (← links)
- Enhancing matrix completion using a modified second-order total variation (Q1727032) (← links)
- A decoupled method for image inpainting with patch-based low rank regulariztion (Q1740104) (← links)
- An efficient duality-based approach for PDE-constrained sparse optimization (Q1744892) (← links)
- A mixture of nuclear norm and matrix factorization for tensor completion (Q1747028) (← links)
- Robust bilinear factorization with missing and grossly corrupted observations (Q1749100) (← links)
- DC formulations and algorithms for sparse optimization problems (Q1749449) (← links)
- Tensor completion using total variation and low-rank matrix factorization (Q1750415) (← links)
- Equivalent Lipschitz surrogates for zero-norm and rank optimization problems (Q1756795) (← links)
- Error bounds for rank constrained optimization problems and applications (Q1790190) (← links)
- An efficient method for convex constrained rank minimization problems based on DC programming (Q1793529) (← links)
- Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization (Q1799934) (← links)
