An alternating direction algorithm for matrix completion with nonnegative factors

DOI10.1007/s11464-012-0194-5zbMath1323.65044arXiv1103.1168OpenAlexW1846534543MaRDI QIDQ693195

Wotao Yin, Yang-yang Xu, Yin Zhang, ZaiWen Wen

Publication date: 7 December 2012

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.1168

zbMATH Keywords

algorithmconvergencematrix completionnumerical simulationalternating direction methodnonnegative matrix factorizationhyperspectral unmixingnon-convex constrained least squares problem

Mathematics Subject Classification ID

Factorization of matrices (15A23) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Positive matrices and their generalizations; cones of matrices (15B48) Matrix completion problems (15A83)

Related Items

Alternating direction method for generalized Sylvester matrix equation \(AXB + CYD = E\), Unnamed Item, A Parallel Douglas–Rachford Algorithm for Minimizing ROF-like Functionals on Images with Values in Symmetric Hadamard Manifolds, A multiphase image segmentation based on fuzzy membership functions and L1-norm fidelity, Tomographic image reconstruction using training images, A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems, The Unified Frame of Alternating Direction Method of Multipliers for Three Classes of Matrix Equations Arising in Control Theory, A patch-based low-rank tensor approximation model for multiframe image denoising, An alternating direction method for total variation denoising, An oracle inequality for quasi-Bayesian nonnegative matrix factorization, A divide-and-conquer algorithm for binary matrix completion, ADMM for Penalized Quantile Regression in Big Data, Nonlinear set membership filter with state estimation constraints via consensus-ADMM, 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, Dynamic behavior analysis via structured rank minimization, An \(l_0\)-norm based color image deblurring model under mixed random-valued impulse and Gaussian noise, Matrix factorization for low-rank tensor completion using framelet prior, A novel low-light enhancement via fractional-order and low-rank regularized retinex model, Network traffic matrix prediction with incomplete data via masked matrix modeling, An Alternating Augmented Lagrangian method for constrained nonconvex optimization, Nonnegative Low Rank Matrix Completion by Riemannian Optimalization Methods, Alternating direction methods for solving a class of Sylvester-like matrix equations, A two-level distributed algorithm for nonconvex constrained optimization, T-product factorization based method for matrix and tensor completion problems, Image denoising using combined higher order non-convex total variation with overlapping group sparsity, Adaptive total variation and second-order total variation-based model for low-rank tensor completion, Low-rank representation-based object tracking using multitask feature learning with joint sparsity, Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method, Alternating iterative methods for solving tensor equations with applications, Global convergence of ADMM in nonconvex nonsmooth optimization, An ADMM-LAP method for total variation myopic deconvolution of adaptive optics retinal images, A new algorithm for positive semidefinite matrix completion, A general system for heuristic minimization of convex functions over non-convex sets, Alternating Direction Method for a Class of Sylvester Matrix Equations with Linear Matrix Inequality Constraint, A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion, Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems, Local linear convergence of an ADMM-type splitting framework for equality constrained optimization, An efficient method for non-negative low-rank completion, A mixture of nuclear norm and matrix factorization for tensor completion, Tensor completion using total variation and low-rank matrix factorization, Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications, An alternating direction method for nonnegative solutions of the matrix equation \(AX+YB=C\), Hybrid clustering based on content and connection structure using joint nonnegative matrix factorization, Alternating direction method of multipliers with difference of convex functions, Sparse \(\ell_ {1}\) regularisation of matrix valued models for acoustic source characterisation, A tensor-based dictionary learning approach to tomographic image reconstruction, High dimensional covariance matrix estimation using multi-factor models from incomplete information, A simple effective heuristic for embedded mixed-integer quadratic programming, Robust Schatten-\(p\) norm based approach for tensor completion, ADMM for multiaffine constrained optimization, A new updating method for the damped mass-spring systems, A detail preserving variational model for image Retinex, Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints, Phase Retrieval from Incomplete Magnitude Information via Total Variation Regularization, Unnamed Item, A majorization-minimization based solution to penalized nonnegative matrix factorization with orthogonal regularization, Alternating direction method of multipliers for solving dictionary learning models, A new tensor multi-rank approximation with total variation regularization for tensor completion, Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning, Parallel matrix factorization for low-rank tensor completion, Alternating proximal gradient method for sparse nonnegative Tucker decomposition

Uses Software

• RecPF
• FTVd
• LMaFit
• Multilinear Engine

Cites Work

• Unnamed Item
• Unnamed Item
• Fixed point and Bregman iterative methods for matrix rank minimization
• Alternating direction augmented Lagrangian methods for semidefinite programming
• Algorithms and applications for approximate nonnegative matrix factorization
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• Multiplier and gradient methods
• The multiplier method of Hestenes and Powell applied to convex programming
• Exact matrix completion via convex optimization
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• An Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise
• Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Learning the parts of objects by non-negative matrix factorization
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing