Pages that link to "Item:Q3081493"
From MaRDI portal
The following pages link to Tensor completion and low-n-rank tensor recovery via convex optimization (Q3081493):
Displayed 50 items.
- Parallel matrix factorization for low-rank tensor completion (Q256035) (← links)
- Minimum \( n\)-rank approximation via iterative hard thresholding (Q299732) (← links)
- On the nuclear norm and the singular value decomposition of tensors (Q300892) (← links)
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems (Q312683) (← links)
- On tensor completion via nuclear norm minimization (Q330103) (← links)
- Tucker factorization with missing data with application to low-\(n\)-rank tensor completion (Q335961) (← links)
- Low-rank tensor completion by Riemannian optimization (Q398628) (← links)
- Von Neumann's trace inequality for tensors (Q492761) (← links)
- Criteria for strong \(H\)-tensors (Q528212) (← links)
- Rank adaptive tensor recovery based model reduction for partial differential equations with high-dimensional random inputs (Q778295) (← links)
- New estimations on the upper bounds for the nuclear norm of a tensor (Q824834) (← links)
- Completely positive tensor recovery with minimal nuclear value (Q1639713) (← links)
- Low Tucker rank tensor recovery via ADMM based on exact and inexact iteratively reweighted algorithms (Q1678114) (← links)
- Cross: efficient low-rank tensor completion (Q1731066) (← links)
- Alternating direction method of multipliers for generalized low-rank tensor recovery (Q1736785) (← links)
- Tensor completion using total variation and low-rank matrix factorization (Q1750415) (← links)
- Block tensor train decomposition for missing data estimation (Q1757240) (← links)
- Tensor factorization using auxiliary information (Q1944991) (← links)
- Iterative adaptive nonconvex low-rank tensor approximation to image restoration based on ADMM (Q1999470) (← links)
- On the subdifferential of symmetric convex functions of the spectrum for symmetric and orthogonally decomposable tensors (Q2002772) (← links)
- On polynomial time methods for exact low-rank tensor completion (Q2007852) (← links)
- Tensor \(N\)-tubal rank and its convex relaxation for low-rank tensor recovery (Q2023171) (← links)
- Tensor train rank minimization with nonlocal self-similarity for tensor completion (Q2037222) (← links)
- Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees (Q2039795) (← links)
- Tensor theta norms and low rank recovery (Q2048814) (← links)
- T-product factorization method for internet traffic data completion with spatio-temporal regularization (Q2057227) (← links)
- A comprehensive and systematic look up into deep learning based object detection techniques: a review (Q2065967) (← links)
- Tensor completion via a generalized transformed tensor t-product decomposition without t-SVD (Q2103412) (← links)
- An optimal statistical and computational framework for generalized tensor estimation (Q2119217) (← links)
- Low tubal rank tensor recovery using the Bürer-Monteiro factorisation approach. Application to optical coherence tomography (Q2122021) (← links)
- Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
- Interpolatory tensorial reduced order models for parametric dynamical systems (Q2145123) (← links)
- Tensor completion via fully-connected tensor network decomposition with regularized factors (Q2149028) (← links)
- Matrix factorization for low-rank tensor completion using framelet prior (Q2195446) (← links)
- Characterization of sampling patterns for low-tt-rank tensor retrieval (Q2202522) (← links)
- Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data (Q2203366) (← links)
- Iterative \(p\)-shrinkage thresholding algorithm for low Tucker rank tensor recovery (Q2212078) (← links)
- Adaptive total variation and second-order total variation-based model for low-rank tensor completion (Q2219433) (← links)
- Nonconvex optimization for robust tensor completion from grossly sparse observations (Q2219800) (← links)
- Nonconvex tensor rank minimization and its applications to tensor recovery (Q2224917) (← links)
- A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization (Q2245040) (← links)
- Learning with tensors: a framework based on convex optimization and spectral regularization (Q2251466) (← links)
- Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems (Q2275326) (← links)
- Robust Schatten-\(p\) norm based approach for tensor completion (Q2291931) (← links)
- A non-convex tensor rank approximation for tensor completion (Q2293872) (← links)
- Fundamental conditions on the sampling pattern for union of low-rank subspaces retrieval (Q2294578) (← links)
- Multi-dimensional imaging data recovery via minimizing the partial sum of tubal nuclear norm (Q2297175) (← links)
- On the tensor spectral \(p\)-norm and its dual norm via partitions (Q2307701) (← links)
- Low-rank tensor completion via smooth matrix factorization (Q2310630) (← links)
- Low-rank tensor completion based on log-det rank approximation and matrix factorization (Q2330690) (← links)