Proximal-gradient algorithms for fractional programming
From MaRDI portal
Publication:5356929
DOI10.1080/02331934.2017.1294592zbMath1378.90080arXiv1601.08166OpenAlexW2963402834WikidataQ101051484 ScholiaQ101051484MaRDI QIDQ5356929
Ernö Robert Csetnek, Radu Ioan Boţ
Publication date: 12 September 2017
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.08166
fractional programmingconvergence ratelimiting subdifferentialforward-backward algorithmKurdyka-Łojasiewicz propertyconvex subdifferential
Related Items (15)
A proximal algorithm with backtracked extrapolation for a class of structured fractional programming ⋮ General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems ⋮ The forward-backward-forward method from continuous and discrete perspective for pseudo-monotone variational inequalities in Hilbert spaces ⋮ Two-step inertial forward-reflected-backward splitting based algorithm for nonconvex mixed variational inequalities ⋮ Extension of forward-reflected-backward method to non-convex mixed variational inequalities ⋮ Dinkelbach Type Approximation Algorithms for Nonlinear Fractional Optimization Problems ⋮ Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems ⋮ Relaxed-inertial proximal point type algorithms for quasiconvex minimization ⋮ The Kurdyka–Łojasiewicz Inequality as Regularity Condition ⋮ Strengthened splitting methods for computing resolvents ⋮ Solving mixed variational inequalities beyond convexity ⋮ Modern regularization methods for inverse problems ⋮ Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization ⋮ Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs ⋮ An extension of the proximal point algorithm beyond convexity
This page was built for publication: Proximal-gradient algorithms for fractional programming
