An alternating direction algorithm for matrix completion with nonnegative factors
From MaRDI portal
(Redirected from Publication:693195)
Abstract: This paper introduces an algorithm for the nonnegative matrix factorization-and-completion problem, which aims to find nonnegative low-rank matrices X and Y so that the product XY approximates a nonnegative data matrix M whose elements are partially known (to a certain accuracy). This problem aggregates two existing problems: (i) nonnegative matrix factorization where all entries of M are given, and (ii) low-rank matrix completion where nonnegativity is not required. By taking the advantages of both nonnegativity and low-rankness, one can generally obtain superior results than those of just using one of the two properties. We propose to solve the non-convex constrained least-squares problem using an algorithm based on the classic alternating direction augmented Lagrangian method. Preliminary convergence properties of the algorithm and numerical simulation results are presented. Compared to a recent algorithm for nonnegative matrix factorization, the proposed algorithm produces factorizations of similar quality using only about half of the matrix entries. On tasks of recovering incomplete grayscale and hyperspectral images, the proposed algorithm yields overall better qualities than those produced by two recent matrix-completion algorithms that do not exploit nonnegativity.
Recommendations
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Matrix completion via an alternating direction method
- An efficient method for non-negative low-rank completion
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- An ADMM-factorization algorithm for low rank matrix completion
Cites work
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- A Singular Value Thresholding Algorithm for Matrix Completion
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Algorithms and applications for approximate nonnegative matrix factorization
- Alternating direction augmented Lagrangian methods for semidefinite programming
- An Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Exact matrix completion via convex optimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Interior-point method for nuclear norm approximation with application to system identification
- Learning the parts of objects by non-negative matrix factorization
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Multiplier and gradient methods
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Robust principal component analysis?
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- The multiplier method of Hestenes and Powell applied to convex programming
Cited in
(71)- Parallel matrix factorization for low-rank tensor completion
- Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method
- Alternating direction methods for solving a class of Sylvester-like matrix equations
- A stochastic ADMM algorithm for large-scale ptychography with weighted difference of anisotropic and isotropic total variation
- Low-rank representation-based object tracking using multitask feature learning with joint sparsity
- A new tensor multi-rank approximation with total variation regularization for tensor completion
- Robust Schatten-\(p\) norm based approach for tensor completion
- Iterative algorithm for the symmetric and nonnegative tensor completion problem
- Iterative algorithms for symmetric positive semidefinite solutions of the Lyapunov matrix equations
- An approximate augmented Lagrangian method for nonnegative low-rank matrix approximation
- A general system for heuristic minimization of convex functions over non-convex sets
- Alternating proximal gradient method for sparse nonnegative Tucker decomposition
- Alternating direction method for a class of Sylvester matrix equations with linear matrix inequality constraint
- A mixture of nuclear norm and matrix factorization for tensor completion
- Tensor completion using total variation and low-rank matrix factorization
- Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
- A simple effective heuristic for embedded mixed-integer quadratic programming
- Global convergence of ADMM in nonconvex nonsmooth optimization
- A nonmonotone alternating updating method for a class of matrix factorization problems
- Matrix factorization for low-rank tensor completion using framelet prior
- Local linear convergence of an ADMM-type splitting framework for equality constrained optimization
- Alternating direction method of multipliers with difference of convex functions
- Sparse \(\ell_ {1}\) regularisation of matrix valued models for acoustic source characterisation
- Nonlinear set membership filter with state estimation constraints via consensus-ADMM
- A survey on surrogate approaches to non-negative matrix factorization
- Decomposition methods for computing directional stationary solutions of a class of nonsmooth nonconvex optimization problems
- Alternating iterative methods for solving tensor equations with applications
- Alternating direction method of multipliers for solving dictionary learning models
- Alternating direction method for generalized Sylvester matrix equation \(AXB + CYD = E\)
- Network traffic matrix prediction with incomplete data via masked matrix modeling
- A new updating method for the damped mass-spring systems
- A tensor-based dictionary learning approach to tomographic image reconstruction
- Adaptive total variation and second-order total variation-based model for low-rank tensor completion
- An ADMM-LAP method for total variation myopic deconvolution of adaptive optics retinal images
- An \(l_0\)-norm based color image deblurring model under mixed random-valued impulse and Gaussian noise
- ADMM for Penalized Quantile Regression in Big Data
- High dimensional covariance matrix estimation using multi-factor models from incomplete information
- Nonnegative Low Rank Matrix Completion by Riemannian Optimalization Methods
- An efficient method for non-negative low-rank completion
- An ADMM-factorization algorithm for low rank matrix completion
- A multiphase image segmentation based on fuzzy membership functions and L1-norm fidelity
- An alternating augmented Lagrangian method for constrained nonconvex optimization
- The unified frame of alternating direction method of multipliers for three classes of matrix equations arising in control theory
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A patch-based low-rank tensor approximation model for multiframe image denoising
- An oracle inequality for quasi-Bayesian nonnegative matrix factorization
- An alternating direction method for total variation denoising
- Tomographic image reconstruction using training images
- A preconditioned Riemannian gradient descent algorithm for low-rank matrix recovery
- Hybrid clustering based on content and connection structure using joint nonnegative matrix factorization
- ADMM for multiaffine constrained optimization
- An alternating direction and projection algorithm for structure-enforced matrix factorization
- Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems
- Revisiting the redistancing problem using the Hopf-Lax formula
- Clustering is semidefinitely not that hard: nonnegative SDP for manifold disentangling
- A detail preserving variational model for image Retinex
- Self representation based methods for tensor completion problem
- A divide-and-conquer algorithm for binary matrix completion
- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- T-product factorization based method for matrix and tensor completion problems
- Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications
- A parallel Douglas-Rachford algorithm for minimizing ROF-like functionals on images with values in symmetric Hadamard manifolds
- Dynamic behavior analysis via structured rank minimization
- A two-level distributed algorithm for nonconvex constrained optimization
- A new algorithm for positive semidefinite matrix completion
- An alternating direction method for nonnegative solutions of the matrix equation AX+YB=C
- Image denoising using combined higher order non-convex total variation with overlapping group sparsity
- Phase retrieval from incomplete magnitude information via total variation regularization
- A novel low-light enhancement via fractional-order and low-rank regularized retinex model
- A majorization-minimization based solution to penalized nonnegative matrix factorization with orthogonal regularization
This page was built for publication: An alternating direction algorithm for matrix completion with nonnegative factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693195)
