Journal
OPTIMIZATION
Volume 66, Issue 8, Pages 1383-1396Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/02331934.2017.1294592
Keywords
Fractional programming; forward-backward algorithm; convergence rate; convex subdifferential; limiting subdifferential; Kurdyka-Lojasiewicz property
Funding
- FWF (Austrian Science Fund), Lise Meitner Programme [M 1682-N25]
- Austrian Science Fund (FWF) [M 1682] Funding Source: researchfish
- Austrian Science Fund (FWF) [M1682] Funding Source: Austrian Science Fund (FWF)
Ask authors/readers for more resources
In this paper, we propose two proximal-gradient algorithms for fractional programming problems in real Hilbert spaces, where the numerator is a proper, convex and lower semicontinuous function and the denominator is a smooth function, either concave or convex. In the iterative schemes, we perform a proximal step with respect to the nonsmooth numerator and a gradient step with respect to the smooth denominator. The algorithm in case of a concave denominator has the particularity that it generates sequences which approach both the (global) optimal solutions set and the optimal objective value of the underlying fractional programming problem. In case of a convex denominator the numerical scheme approaches the set of critical points of the objective function, provided the latter satisfies the Kurdyka-Lojasiewicz property.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available