The following pages link to LMaFit (Q24152):
Displaying 50 items.
- An alternating direction method with continuation for nonconvex low rank minimization (Q257130) (← links)
- Applications of gauge duality in robust principal component analysis and semidefinite programming (Q341322) (← links)
- Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit (Q368099) (← links)
- Approximation of rank function and its application to the nearest low-rank correlation matrix (Q386463) (← links)
- An approximation theory of matrix rank minimization and its application to quadratic equations (Q417562) (← links)
- A fast tri-factorization method for low-rank matrix recovery and completion (Q456030) (← links)
- An efficient matrix factorization based low-rank representation for subspace clustering (Q456036) (← links)
- An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion (Q460667) (← links)
- Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset (Q518124) (← links)
- An alternating direction algorithm for matrix completion with nonnegative factors (Q693195) (← links)
- Low rank matrix completion by alternating steepest descent methods (Q905914) (← links)
- Matrix completion discriminant analysis (Q1663150) (← links)
- A patch-based low-rank tensor approximation model for multiframe image denoising (Q1675367) (← links)
- Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems (Q1691386) (← links)
- Revisiting the redistancing problem using the Hopf-Lax formula (Q1691741) (← links)
- Multi-stage convex relaxation method for low-rank and sparse matrix separation problem (Q1733456) (← links)
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis (Q1734769) (← links)
- Global convergence of ADMM in nonconvex nonsmooth optimization (Q1736880) (← links)
- The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion (Q1740089) (← links)
- Robust bilinear factorization with missing and grossly corrupted observations (Q1749100) (← links)
- ROML: a robust feature correspondence approach for matching objects in a set of images (Q1800046) (← links)
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing (Q1946621) (← links)
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm (Q1946921) (← links)
- Linear embedding by joint robust discriminant analysis and inter-class sparsity (Q1982415) (← links)
- The dual step size of the alternating direction method can be larger than 1.618 when one function is strongly convex (Q1983679) (← links)
- Low-rank and sparse matrices fitting algorithm for low-rank representation (Q2004500) (← links)
- High-dimensional integrative analysis with homogeneity and sparsity recovery (Q2008216) (← links)
- A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming (Q2020565) (← links)
- Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data (Q2054540) (← links)
- Toeplitz matrix completion via a low-rank approximation algorithm (Q2069350) (← links)
- Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization (Q2089885) (← links)
- A fixed-point proximity algorithm for recovering low-rank components from incomplete observation data with application to motion capture data refinement (Q2122054) (← links)
- Guarantees of Riemannian optimization for low rank matrix completion (Q2176515) (← links)
- An alternating minimization method for matrix completion problems (Q2182816) (← links)
- Unsupervised robust discriminative manifold embedding with self-expressiveness (Q2183573) (← links)
- Robust PCA using nonconvex rank approximation and sparse regularizer (Q2193603) (← links)
- Dynamic behavior analysis via structured rank minimization (Q2193906) (← links)
- Robust low-rank kernel multi-view subspace clustering based on the Schatten \(p\)-norm and correntropy (Q2201681) (← links)
- Data-driven attacks and data recovery with noise on state estimation of smart grid (Q2224726) (← links)
- Bregman reweighted alternating minimization and its application to image deblurring (Q2224931) (← links)
- Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property (Q2231349) (← links)
- Local linear convergence of an ADMM-type splitting framework for equality constrained optimization (Q2240104) (← links)
- Matrix recipes for hard thresholding methods (Q2251217) (← links)
- A reweighted nuclear norm minimization algorithm for low rank matrix recovery (Q2252420) (← links)
- Robust PCA and subspace tracking from incomplete observations using \(\ell _0\)-surrogates (Q2259730) (← links)
- Fixed-rank matrix factorizations and Riemannian low-rank optimization (Q2259741) (← links)
- Homotopy method for matrix rank minimization based on the matrix hard thresholding method (Q2273119) (← links)
- A hybrid algorithm for the two-trust-region subproblem (Q2322760) (← links)
- Alternating direction method of multipliers for solving dictionary learning models (Q2343040) (← links)
- Parallel stochastic gradient algorithms for large-scale matrix completion (Q2392935) (← links)
