Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Boolean networks
From MaRDI portal
Publication:5739731
DOI10.1002/nla.2001zbMath1349.65140OpenAlexW2103628488MaRDI QIDQ5739731
Vassilios S. Vassiliadis, Man Wang, Wai-Ki Ching, Xiaoqing Cheng, Zhiying Cao, You-Wei Wen
Publication date: 19 July 2016
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.2001
algorithminverse problemprojectionleast squaresgradient descent methodsparse solutionsprobabilistic Boolean networks
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10)
Related Items
Dedication to Robert J. Plemmons, A modified orthogonal matching pursuit for construction of sparse probabilistic Boolean networks, A geometric proximal gradient method for sparse least squares regression with probabilistic simplex constraint, Bayesian selection probability estimation for probabilistic Boolean networks, High-dimensional sign-constrained feature selection and grouping, An efficient Hessian based algorithm for singly linearly and box constrained least squares regression
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
- Application of the proximal point method to nonmonotone equilibrium problems
- Interior-point gradient method for large-scale totally nonnegative least squares problems
- A reduced Newton method for constrained linear least-squares problems
- Wavelet inpainting by nonlocal total variation
- A non-monotonic method for large-scale non-negative least squares
- A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
- Sparse and stable Markowitz portfolios
- Stable recovery of sparse overcomplete representations in the presence of noise
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- An interior point Newton-like method for non-negative least-squares problems with degenerate solution
- Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations
- Fast Image Recovery Using Variable Splitting and Constrained Optimization
- Efficient Box-Constrained TV-Type-l<sup>1</sup> Algorithms for Restoring Images with Impulse Noise
- Construction of Probabilistic Boolean Networks from a Prescribed Transition Probability Matrix: A Maximum Entropy Rate Approach
- On Construction of Sparse Probabilistic Boolean Networks
- Linearized Alternating Direction Method of Multipliers for Constrained Linear Least-Squares Problem
- Signal Recovery by Proximal Forward-Backward Splitting
