Dual algorithms based on the proximal bundle method for solving convex minimax fractional programs

Abstract

In this work, we propose an approximating scheme based on the proximal point algorithm, for solving generalized fractional programs (GFP) by their continuous reformulation, also known to as partial dual counterparts of GFP. Bundle dual algorithms are then derived from this scheme. We prove the convergence and the rate of convergence of these algorithms. As for dual algorithms, the proposed methods generate a sequence of values that converges from below to the minimal value of \begin{document}$(P)$\end{document} , and a sequence of approximate solutions that converges to a solution of the dual problem. For certain classes of problems, the convergence is at least linear.