This paper describes an improved technique for enforcing positivity in deco
nvolution applications. An accelerated quadratic programming approach is ap
plied and shown to be an improvement to a method proposed by Nakamura et al
. [J. Opt. Sec. Am. A 5 (1988) 554]. The resulting algorithm produces a mon
otonically decreasing error function and guaranteed convergence. The perfor
mance of the algorithm is tested on computer simulated images. (C) 2000 Els
evier Science B.V. All rights reserved.