Majorized proximal alternating imputation for regularized rank constrained matrix completion (Q2297134)

scientific article; zbMATH DE number 7169512

Language	Label	Description	Also known as
default for all languages	No label defined
English	Majorized proximal alternating imputation for regularized rank constrained matrix completion	scientific article; zbMATH DE number 7169512

Statements

instance of

scholarly article

0 references

title

Majorized proximal alternating imputation for regularized rank constrained matrix completion (English)

0 references

0 references

0 references

0 references

Journal of Computational and Applied Mathematics

0 references

publication date

18 February 2020

0 references

zbMATH Keywords

matrix completion

0 references

bilinear factorization

0 references

majorization minimization

0 references

proximal alternating minimization

0 references

nuclear norm

0 references

non-convex regularization

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cam.2019.112679

0 references

cites work

Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization

0 references

Robust principal component analysis?

0 references

Tensor completion using total variation and low-rank matrix factorization

0 references

Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm

0 references

Affine matrix rank minimization problem via non-convex fraction function penalty

0 references

Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm

0 references

Parallel matrix factorization for low-rank tensor completion

0 references

Matrix completion and low-rank SVD via fast alternating least squares

0 references

Low-rank matrix completion via preconditioned optimization on the Grassmann manifold

0 references

Fixed-rank matrix factorizations and Riemannian low-rank optimization

0 references

Low-rank optimization with trace norm penalty

0 references

Regression on fixed-rank positive semidefinite matrices: a Riemannian approach

0 references

Variable selection using MM algorithms

0 references

Spectral regularization algorithms for learning large incomplete matrices

0 references

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

A Singular Value Thresholding Algorithm for Matrix Completion

0 references

A reweighted nuclear norm minimization algorithm for low rank matrix recovery

0 references

One-step sparse estimates in nonconcave penalized likelihood models

0 references

A general theory of concave regularization for high-dimensional sparse estimation problems

0 references

An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems

0 references

Matrix completion from noisy entries

0 references

Low-rank matrix completion by Riemannian optimization

0 references

Low-rank matrix completion using alternating minimization

0 references

Guaranteed Matrix Completion via Non-Convex Factorization

0 references

Smooth PARAFAC Decomposition for Tensor Completion

0 references

Tensor Factorization for Low-Rank Tensor Completion

0 references

Matrix factorization for low-rank tensor completion using framelet prior

0 references

Identifiers

zbMATH Open document ID

1433.65085

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1016/J.CAM.2019.112679

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2297134