A gradient projection algorithm with a new stepsize for nonnegative sparsity-constrained optimization (Q2007126)

Summary: Nonnegative sparsity-constrained optimization problem arises in many fields, such as the linear compressing sensing problem and the regularized logistic regression cost function. In this paper, we introduce a new stepsize rule and establish a gradient projection algorithm. We also obtain some convergence results under milder conditions.