A gradient projection algorithm with a new stepsize for nonnegative sparsity-constrained optimization (Q2007126)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A gradient projection algorithm with a new stepsize for nonnegative sparsity-constrained optimization |
scientific article; zbMATH DE number 7259641
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A gradient projection algorithm with a new stepsize for nonnegative sparsity-constrained optimization |
scientific article; zbMATH DE number 7259641 |
Statements
A gradient projection algorithm with a new stepsize for nonnegative sparsity-constrained optimization (English)
0 references
12 October 2020
0 references
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.
0 references
0 references
