Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing

DOI10.1155/2019/9609302zbMATH Open1435.90132OpenAlexW2989635782MaRDI QIDQ2299008FDOQ2299008

Authors: Li Sun, Ziwen Liu, Congying Han 

Publication date: 20 February 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2019/9609302

Recommendations

• Nonnegative matrix factorization with region sparsity learning for hyperspectral unmixing
• A Complexity Constrained Nonnegative Matrix Factorization for Hyperspectral Unmixing
• Nonlinear unmixing for hyperspectral imagery based on kernel nonnegative matrix factorization with constraints on abundances
• Hyperspectral unmixing via deep matrix factorization
• Regularized nonnegative matrix factorization: geometrical interpretation and application to spectral unmixing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical linear algebra (65F99) Nonlinear programming (90C30)

Cites Work

• Algorithms and applications for approximate nonnegative matrix factorization
• Projected Gradient Methods for Nonnegative Matrix Factorization
• Non-negative matrix factorization with sparseness constraints
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• An accurate active set Newton algorithm for large scale bound constrained optimization.
• Projected Newton Methods for Optimization Problems with Simple Constraints
• Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
• Nonnegative matrix factorization for spectral data analysis
• Efficient nonnegative matrix factorization via projected Newton method
• A symmetric rank-one quasi-Newton method for nonnegative matrix factorization
• Regularized nonnegative matrix factorization: geometrical interpretation and application to spectral unmixing
• An active set strategy based on the multiplier function or the gradient.
• An active set quasi-Newton method with projected search for bound constrained minimization
• Spectral Unmixing via Data-Guided Sparsity
• NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
• Graph regularized nonnegative matrix factorization with sparse coding
• Graph sparse nonnegative matrix factorization algorithm based on the inertial projection neural network
• A class of modified FR conjugate gradient method and applications to non-negative matrix factorization
• A new active set method for nonnegative matrix factorization
• Incremental graph regulated nonnegative matrix factorization for face recognition
• An efficient monotone projected Barzilai-Borwein method for nonnegative matrix factorization
• Minimum Determinant Constraint for Non-negative Matrix Factorization

Cited In (11)

• A method for finding structured sparse solutions to nonnegative least squares problems with applications
• Regularized nonnegative matrix factorization: geometrical interpretation and application to spectral unmixing
• SISAL revisited
• Nonlinear unmixing for hyperspectral imagery based on kernel nonnegative matrix factorization with constraints on abundances
• Nonnegative matrix factorization for spectral data analysis
• A Complexity Constrained Nonnegative Matrix Factorization for Hyperspectral Unmixing
• Hyperspectral unmixing via deep matrix factorization
• Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis
• Nonnegative matrix factorization with region sparsity learning for hyperspectral unmixing
• Unmixing of large-scale hyperspectral data based on projected mini-batch gradient descent
• A bio-mathematical approach to control the \textit{Anopheles} mosquito using sterile males technology

Uses Software

• NeNMF

This page was built for publication: Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2299008)