Pages that link to "Item:Q2655288"
From MaRDI portal
The following pages link to Exact matrix completion via convex optimization (Q2655288):
Displayed 50 items.
- Transposable regularized covariance models with an application to missing data imputation (Q993250) (← links)
- Multivariate GARCH estimation via a Bregman-proximal trust-region method (Q1623522) (← links)
- Local block operators and TV regularization based image inpainting (Q1631541) (← links)
- A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm (Q1631800) (← links)
- 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation (Q1640399) (← links)
- Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization (Q1650690) (← links)
- Matrix completion via a low rank factorization model and an augmented Lagrangean succesive overrelaxation algorithm (Q1653941) (← links)
- Stable analysis of compressive principal component pursuit (Q1662624) (← links)
- Model-based co-clustering for ordinal data (Q1662824) (← links)
- Matrix completion discriminant analysis (Q1663150) (← links)
- Multi-view low-rank dictionary learning for image classification (Q1669712) (← links)
- A patch-based low-rank tensor approximation model for multiframe image denoising (Q1675367) (← links)
- Double instrumental variable estimation of interaction models with big data (Q1676366) (← links)
- Low Tucker rank tensor recovery via ADMM based on exact and inexact iteratively reweighted algorithms (Q1678114) (← links)
- Low-rank decomposition meets kernel learning: a generalized Nyström method (Q1680675) (← links)
- Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization (Q1688516) (← links)
- Random perturbation of low rank matrices: improving classical bounds (Q1688904) (← links)
- The minimal measurement number for low-rank matrix recovery (Q1690711) (← links)
- Proximal iteratively reweighted algorithm for low-rank matrix recovery (Q1691320) (← links)
- Exact recovery of sparse multiple measurement vectors by \(l_{2,p}\)-minimization (Q1691327) (← links)
- \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization (Q1694395) (← links)
- Affine matrix rank minimization problem via non-convex fraction function penalty (Q1696454) (← links)
- Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization (Q1706414) (← links)
- Adaptive confidence sets for matrix completion (Q1708972) (← links)
- Painless breakups -- efficient demixing of low rank matrices (Q1710648) (← links)
- Matrix completion with \(\varepsilon\)-algorithm. In memory of Peter Wynn (1931--2017) (Q1710721) (← links)
- A new nonconvex approach to low-rank matrix completion with application to image inpainting (Q1710943) (← links)
- An improved method of training overcomplete dictionary pair (Q1718244) (← links)
- Matrix factorization for evolution data (Q1718602) (← links)
- Robust missing traffic flow imputation considering nonnegativity and road capacity (Q1719096) (← links)
- Linear total variation approximate regularized nuclear norm optimization for matrix completion (Q1724931) (← links)
- Enhancing matrix completion using a modified second-order total variation (Q1727032) (← links)
- A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem (Q1729942) (← links)
- Alternating direction method of multipliers for generalized low-rank tensor recovery (Q1736785) (← links)
- Statistical inference of semidefinite programming (Q1739028) (← links)
- Robust covariance estimation for approximate factor models (Q1739628) (← links)
- The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion (Q1740089) (← links)
- A decoupled method for image inpainting with patch-based low rank regulariztion (Q1740104) (← links)
- Structured volatility matrix estimation for non-synchronized high-frequency financial data (Q1740273) (← links)
- Learning semidefinite regularizers (Q1740575) (← links)
- Noise-tolerance matrix completion for location recommendation (Q1741358) (← links)
- Low-rank matrix recovery using Gabidulin codes in characteristic zero (Q1743301) (← links)
- Manifold based low-rank regularization for image restoration and semi-supervised learning (Q1743416) (← links)
- A mixture of nuclear norm and matrix factorization for tensor completion (Q1747028) (← links)
- Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics (Q1747733) (← links)
- On the singular values of matrices with high displacement rank (Q1748068) (← 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)
- Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications (Q1751884) (← links)