{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:38:53Z","timestamp":1787341133787,"version":"build-2736575974"},"reference-count":61,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>We propose new duality results for generalized fractional programs (GFP) for a wide class of problems, not limited only to the convex case. Our approach does not use Lagrangian duality, but only an equivalent form of the GFP. We present a general approximating scheme, based on the proximal point algorithm, for solving this dual program. We take advantage of the convexity property of the dual, independently of the primal properties, to build implementable bundle methods with the support of the general scheme. However, it is well known that the principal difficulty with the duality is the evaluation of the dual function. To mitigate this difficulty, we propose bundle methods that need only approximate values and approximate subgradients of the objective dual function. We prove the convergence and the rate of convergence of these algorithms. As is the case for 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 dual problem. For certain classes of problems, the convergence is at least linear.<\/jats:p>","DOI":"10.1137\/18m1199708","type":"journal-article","created":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T14:10:01Z","timestamp":1559657401000},"page":"1578-1602","source":"Crossref","is-referenced-by-count":13,"title":["Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs"],"prefix":"10.1137","volume":"29","author":[{"given":"Karima","family":"Boufi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahmed","family":"Roubi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2019,6,4]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1080\/02331930903395857"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-018-1342-1"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2017.1338698"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592087"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1007\/BF00138690"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940006"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582298"},{"key":"atypb8","first-page":"10","volume":"13","author":"Boualam H.","year":"2017","journal-title":"J. Ind. Manag. Optim."},{"key":"atypb9","doi-asserted-by":"crossref","unstructured":"H. Boualam and A. Roubi,\n                      Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs\n                      , J. Global Optim. (2019),https:\/\/doi.org\/10.1007\/s10898-019-00757-2.","DOI":"10.1007\/s10898-019-00757-2"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2017.1392520"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-017-0523-z"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585170"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582887"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1007\/BF03398807"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591908"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1007\/BF00941314"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1007\/BF00938484"},{"key":"atypb18","unstructured":"I. Ekeland and R. Temam,\n                      Analyse Convexe et Probl\u00e8mes Variationnels\n                      , Gauthier-Villars, Paris, 1974."},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2017004"},{"key":"atypb20","doi-asserted-by":"crossref","first-page":"1991","DOI":"10.3934\/jimo.2017028","volume":"13","author":"El Haffari M.","year":"2017","journal-title":"J. Ind. Manag. Optim."},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1137\/0117055"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.39.1.42"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.08.013"},{"key":"atypb24","unstructured":"J. B. G. Frenk and S. Schaible,\n                      Fractional Programming\n                      , ERIM Report Series ERS-2004-074-LIS, 2004; available athttps:\/\/ssrn.com\/abstract=595012."},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591883"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021759318653"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1137\/0329022"},{"key":"atypb28","doi-asserted-by":"crossref","unstructured":"J.B. Hiriart-Urruty and C. Lemar\u00e9chal,\n                      Convex Analysis and Minimization AlgorithmsI\n                      , Springer, New York, 1993.","DOI":"10.1007\/978-3-662-02796-7"},{"key":"atypb29","doi-asserted-by":"crossref","unstructured":"J.B. Hiriart-Urruty and C. Lemar\u00e9chal,\n                      Convex Analysis and Minimization AlgorithmsII\n                      , Springer, New York, 1993.","DOI":"10.1007\/978-3-662-02796-7"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1007\/BF00935361"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1007\/BF01874462"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591907"},{"key":"atypb33","doi-asserted-by":"crossref","unstructured":"K. C. Kiwiel,\n                      Methods of Descent for Nondifferentiable Optimization\n                      , Lecture Notes in Math. 1133, Springer, Berlin, 1985.","DOI":"10.1007\/BFb0074500"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/6.2.137"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585731"},{"key":"atypb36","first-page":"79","author":"Lemar\u00e9chal C.","year":"1978","journal-title":"Oxford"},{"key":"atypb37","first-page":"201","author":"Lemar\u00e9chal C.","year":"1986","journal-title":"Amsterdam"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006721718184"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1080\/10556780290027828"},{"key":"atypb40","first-page":"154","volume":"4","author":"Martinet B.","year":"1970","journal-title":"Rech. O."},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2.2.191"},{"key":"atypb42","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120960"},{"key":"atypb43","doi-asserted-by":"publisher","DOI":"10.24033\/bsmf.1625"},{"key":"atypb44","doi-asserted-by":"publisher","DOI":"10.1051\/ro:1999118"},{"key":"atypb45","unstructured":"B. T. Polyak,\n                      Introduction to Optimization\n                      , Transl. Ser. Math. Engrg., Optimization Software, New York, 1987."},{"key":"atypb46","doi-asserted-by":"publisher","DOI":"10.1137\/0314056"},{"key":"atypb47","doi-asserted-by":"publisher","DOI":"10.1023\/A:1004660917684"},{"key":"atypb48","doi-asserted-by":"publisher","DOI":"10.1051\/ro:2002006"},{"key":"atypb49","first-page":"495","author":"Schaible S.","year":"1995","journal-title":"Dordrecht"},{"key":"atypb50","doi-asserted-by":"publisher","DOI":"10.1137\/0802008"},{"key":"atypb51","doi-asserted-by":"publisher","DOI":"10.1007\/BF01191168"},{"key":"atypb52","first-page":"1","author":"Simons S.","year":"1995","journal-title":"MA"},{"key":"atypb53","first-page":"171","volume":"8","author":"Sion M.","year":"1958","journal-title":"Pac. J. Optim."},{"key":"atypb54","unstructured":"A. M. Stancu,\n                      Mathematical Programming with Type-I Functions\n                      , MatrixRom, Romania, Bucharest, 2013."},{"key":"atypb55","doi-asserted-by":"crossref","unstructured":"I. M. Stancu-Minasian,\n                      Fractional Programming: Theory, Methods and Applications\n                      , Kluwer Academic, Dordrecht, 1997.","DOI":"10.1007\/978-94-009-0035-6"},{"key":"atypb56","doi-asserted-by":"publisher","DOI":"10.1080\/02331930600819613"},{"key":"atypb57","first-page":"309","volume":"15","author":"I.","year":"2013","journal-title":"Adv. Model. Optim."},{"key":"atypb58","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2016.1276179"},{"key":"atypb59","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9270-x"},{"key":"atypb60","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(92)90099-Y"},{"key":"atypb61","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(90)90046-I"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/18M1199708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:07:09Z","timestamp":1787339229000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/18M1199708"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":61,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1137\/18M1199708"],"URL":"https:\/\/doi.org\/10.1137\/18m1199708","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}