Nonnegativity constraints in numerical analysis
From MaRDI portal
algorithmshistorical surveyimage processingmatrix and tensor factorizationsnonlinear optimizationnonnegative least squaresnonnegativity constraints
History of mathematics in the 20th century (01A60) History of numerical analysis (65-03) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Recommendations
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Computational experience with numerical methods for nonnegative least-squares problems.
- scientific article; zbMATH DE number 2213786
- scientific article; zbMATH DE number 7404610
- An efficient relaxed projection method for constrained non-negative matrix factorization with application to the phase-mapping problem in materials science
Cited in
(25)- Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization
- Sign-constrained least squares estimation for high-dimensional regression
- An efficient method for non-negative low-rank completion
- A physics-constrained data-driven approach based on locally convex reconstruction for noisy database
- A multilevel approach for nonnegative matrix factorization
- Regularized nonnegative matrix factorization: geometrical interpretation and application to spectral unmixing
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- Stability analysis of a class of sparse optimization problems
- Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations
- Add-in for solvers of unconstrained minimization to eliminate lower bounds of variables by transformation
- Polygon approximations of the Euclidean circles on the square grid by broadcasting sequences
- A hybrid multilevel-active set method for large box-constrained linear discrete ill-posed problems
- Asymptotic results of stochastic decomposition for two-stage stochastic quadratic programming
- An index search method based inner-outer iterative algorithm for solving nonnegative least squares problems
- Noisy linear inverse problems under convex constraints: exact risk asymptotics in high dimensions
- Network Estimation by Mixing: Adaptivity and More
- Order-Constrained ROC Regression With Application to Facial Recognition
- The geometry of hypothesis testing over convex cones: generalized likelihood ratio tests and minimax radii
- A computation study on an integrated alternating direction method of multipliers for large scale optimization
- An ADMM-based interior point method for solving nonnegative tensor least squares problems and its applications
- Revisiting causality using stochastics. I: Theory
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
- A reduced Newton method for constrained linear least-squares problems
- Using underapproximations for sparse nonnegative matrix factorization
This page was built for publication: Nonnegativity constraints in numerical analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3567881)
