A non-monotonic method for large-scale non-negative least squares
From MaRDI portal
Publication:2867422
DOI10.1080/10556788.2012.656368zbMath1310.93089OpenAlexW2151471453MaRDI QIDQ2867422
Inderjit S. Dhillon, Suvrit Sra, Dongmin Kim
Publication date: 19 December 2013
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2012.656368
least squareslarge-scalegradient projection methodBarzilai-Borwein stepsizenonnegativity constraintsNNLSnon-monotonic descent
Quadratic programming (90C20) Least squares and related methods for stochastic control systems (93E24) Methods of reduced gradient type (90C52)
Related Items (8)
Modulus Methods for Nonnegatively Constrained Image Restoration ⋮ Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization ⋮ Accelerating block coordinate descent methods with identification strategies ⋮ A continuous energy-based immersed boundary method for elastic shells ⋮ Non-negatively constrained least squares and parameter choice by the residual periodogram for the inversion of electrochemical impedance spectroscopy data ⋮ Non-negative moment fitting quadrature rules for fictitious domain methods ⋮ A computation study on an integrated alternating direction method of multipliers for large scale optimization ⋮ Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Boolean networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On iterative algorithms for linear least squares problems with bound constraints
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- A New Active Set Algorithm for Box Constrained Optimization
- Robust Stochastic Approximation Approach to Stochastic Programming
- Two-Point Step Size Gradient Methods
- On the Identification of Active Constraints
- The Numerical Solution of Constrained Linear Least-squares Problems
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Inexact spectral projected gradient methods on convex sets
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
- Newton's Method for Large Bound-Constrained Optimization Problems
- A Limited Memory Algorithm for Bound Constrained Optimization
- On the Barzilai and Borwein choice of steplength for the gradient method
- Algorithm 813
This page was built for publication: A non-monotonic method for large-scale non-negative least squares