The University of Southampton
University of Southampton Institutional Repository

# A convergent iterative hard thresholding for nonnegative sparsity optimization

Pan, Lili, Zhou, Shenglong, Xiu, Naihua and Qi, Hou-Duo (2017) A convergent iterative hard thresholding for nonnegative sparsity optimization. Pacific Journal of Optimization, 13 (2), 325-353.

Record type: Article

## Abstract

The iterative hard thresholding (IHT) algorithm is a popular greedy-type method in (linear and nonlinear) compressed sensing and sparse optimization problems.
In this paper, we give an improved iterative hard thresholding algorithm for solving the nonnegative sparsity optimization (NSO) by employing the Armijo-type stepsize rule, which automatically adjusts the stepsize and support set and leads to a sufficient decrease of the objective function each iteration.
Consequently, the improved IHT algorithm enjoys several convergence properties under standard assumptions. Those include the convergence to $\alpha$-stationary point (also known as $L$-stationary point in literature if the objective function has Lipschitz gradient) and the finite identification of the true support set. We also characterize when the full sequence converges to a local minimizer of NSO and establish its linear convergence rate. Extensive numerical experiments are included to demonstrate the good performance of the proposed algorithm.

Text
CIHT - Accepted Manuscript

Accepted/In Press date: 21 February 2017
Published date: May 2017
Keywords: sparsity constrained optimization
Organisations: Mathematical Sciences, Operational Research

## Identifiers

Local EPrints ID: 408654
URI: http://eprints.soton.ac.uk/id/eprint/408654
ISSN: 1348-9151
PURE UUID: 233cd7bc-edf9-4d1e-8970-decd59cacf4f
ORCID for Hou-Duo Qi: orcid.org/0000-0003-3481-4814

## Catalogue record

Date deposited: 25 May 2017 04:03

## Contributors

Author: Lili Pan
Author: Shenglong Zhou
Author: Naihua Xiu
Author: Hou-Duo Qi