Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs

H. Boualam () and A. Roubi ()
Additional contact information
H. Boualam: Laboratoire MISI, Faculté des Sciences et Techniques
A. Roubi: Laboratoire MISI, Faculté des Sciences et Techniques

Journal of Global Optimization, 2019, vol. 74, issue 2, No 3, 255-284

Abstract: Abstract We are interested in this work to solve the Lagrangian dual of a generalized fractional program (GFP), which gives the minimal value of the primal problem, thanks to some duality results. With the help of a general minimax equality assumption, we give duality results under minimal assumptions. Since the associated parametric programs of the dual of GFP are always concave, we use a general approximating proximal scheme to these subproblems and construct bundle methods by means of approximate values and approximate subgradients of the dual parametric function. As for all dual algorithms, the proposed methods generate a sequence of values that converges from below to the minimal value of the GFP and a sequence of approximate solutions that converges to a solution of the Lagrangian dual of the GFP. For certain classes of problems, the convergence is at least linear.

Keywords: Minimax fractional programs; Lagrangian duality; Proximal point algorithm; Bundle methods; 90C32; 90C25; 49K35; 49M29; 49M37 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10898-019-00757-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:74:y:2019:i:2:d:10.1007_s10898-019-00757-2

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-019-00757-2

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().