A Nonnegatively Constrained Convex Programming Method for Image Reconstruction
- 1 January 2004
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 25 (4) , 1326-1343
- https://doi.org/10.1137/s1064827502410451
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Newton's Method for Large Bound-Constrained Optimization ProblemsSIAM Journal on Optimization, 1999
- An Interior Point Algorithm for Large-Scale Nonlinear ProgrammingSIAM Journal on Optimization, 1999
- Iterative Methods for OptimizationPublished by Society for Industrial & Applied Mathematics (SIAM) ,1999
- A Limited Memory Algorithm for Bound Constrained OptimizationSIAM Journal on Scientific Computing, 1995
- Maximum likelihood, least squares, and penalized least squares for PETIEEE Transactions on Medical Imaging, 1993
- Algorithms for bound constrained quadratic programming problemsNumerische Mathematik, 1989
- Projected gradient methods for linearly constrained problemsMathematical Programming, 1987
- Projected Newton Methods for Optimization Problems with Simple ConstraintsSIAM Journal on Control and Optimization, 1982
- On the Goldstein-Levitin-Polyak gradient projection methodIEEE Transactions on Automatic Control, 1976
- An iterative technique for the rectification of observed distributionsThe Astronomical Journal, 1974