An alternating direction and projection algorithm for structure-enforced matrix factorization
From MaRDI portal
Publication:1687315
DOI10.1007/s10589-017-9913-xzbMath1387.90244OpenAlexW2607669834MaRDI QIDQ1687315
Publication date: 22 December 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-017-9913-x
projectionalternating direction methodmatrix factorizationdictionary learningsparse optimizationadaptive penalty parameter
Related Items
An ADMM algorithm for two-stage stochastic programming problems, On indefinite quadratic optimization over the intersection of balls and linear constraints, A hybrid algorithm for the two-trust-region subproblem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Multi-frame compression: theory and design.
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- A new inexact alternating directions method for monotone variational inequalities
- \(\ell_1\)-suboptimal robust controller design for discrete linear SISO plants with structured uncertainty
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Multiplier and gradient methods
- The multiplier method of Hestenes and Powell applied to convex programming
- An affine scaling methodology for best basis selection
- Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- The Split Bregman Method for L1-Regularized Problems
- Greed is Good: Algorithmic Results for Sparse Approximation
- Orthogonal least squares methods and their application to non-linear system identification
- Atomic Decomposition by Basis Pursuit
- Dictionary Learning Algorithms for Sparse Representation
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Matching pursuits with time-frequency dictionaries
- Learning the parts of objects by non-negative matrix factorization
- Projected Gradient Methods for Nonnegative Matrix Factorization