A proximal algorithm with backtracked extrapolation for a class of structured fractional programming

Qia Li, Lixin Shen, Na Zhang, Junpeng Zhou

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we consider a class of structured fractional minimization problems where the numerator part of the objective is the sum of a convex function and a Lipschitz differentiable (possibly) nonconvex function, while the denominator part is a convex function. By exploiting the structure of the problem, we propose a first-order algorithm, namely, a proximal-gradient-subgradient algorithm with backtracked extrapolation (PGSA_BE) for solving this type of optimization problem. It is worth pointing out that there are a few differences between our backtracked extrapolation and other popular extrapolations used in convex and nonconvex optimization. One of such differences is as follows: if the new iterate obtained from the extrapolated iteration satisfies a backtracking condition, then this new iterate will be replaced by the one generated from the non-extrapolated iteration. We show that any accumulation point of the sequence generated by PGSA_BE is a critical point of the problem regarded. In addition, by assuming that some auxiliary functions satisfy the Kurdyka-Łojasiewicz property, we are able to establish global convergence of the entire sequence, in the case where the denominator is locally Lipschitz differentiable, or its conjugate satisfies the calmness condition. Finally, we present some preliminary numerical results to illustrate the efficiency of PGSA_BE.

Original languageEnglish (US)
Pages (from-to)98-122
Number of pages25
JournalApplied and Computational Harmonic Analysis
Volume56
DOIs
StatePublished - Jan 2022

Keywords

  • Backtracked extrapolation
  • Fractional programming
  • Proximal algorithm
  • Sparse recovery

ASJC Scopus subject areas

  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A proximal algorithm with backtracked extrapolation for a class of structured fractional programming'. Together they form a unique fingerprint.

Cite this