Proximal bundle methods for generalized fractional programs with ratios of difference of convex functions

In this paper, we present an approximating scheme based on the proximal point algorithm for solving generalized fractional programs involving ratios of difference of convex (DC) functions and subject to DC constraints, which we shall refer to as DC-GFP. These problems are usually nonsmooth and nonco...

Full description

Saved in:
Bibliographic Details
Published in:R.A.I.R.O. Recherche opérationnelle Vol. 59; no. 4; pp. 1749 - 1774
Main Authors: Ghazi, Abdelouafi, Roubi, Ahmed
Format: Journal Article
Language:English
Published: 01.07.2025
ISSN:0399-0559, 2804-7303
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract In this paper, we present an approximating scheme based on the proximal point algorithm for solving generalized fractional programs involving ratios of difference of convex (DC) functions and subject to DC constraints, which we shall refer to as DC-GFP. These problems are usually nonsmooth and nonconvex, but we approximate them iteratively with parametric convex ones. We capitalize on the latter attribute to employ the conventional bundle method to address them. The proposed method is seen as a pure proximal algorithm or a proximal bundle method and generates a sequence of approximate solutions that converge to critical points satisfying the necessary optimality conditions of the KKT type. Finally, we provide numerical test results to illustrate the effectiveness of our algorithm.
AbstractList In this paper, we present an approximating scheme based on the proximal point algorithm for solving generalized fractional programs involving ratios of difference of convex (DC) functions and subject to DC constraints, which we shall refer to as DC-GFP. These problems are usually nonsmooth and nonconvex, but we approximate them iteratively with parametric convex ones. We capitalize on the latter attribute to employ the conventional bundle method to address them. The proposed method is seen as a pure proximal algorithm or a proximal bundle method and generates a sequence of approximate solutions that converge to critical points satisfying the necessary optimality conditions of the KKT type. Finally, we provide numerical test results to illustrate the effectiveness of our algorithm.
Author Ghazi, Abdelouafi
Roubi, Ahmed
Author_xml – sequence: 1
  givenname: Abdelouafi
  surname: Ghazi
  fullname: Ghazi, Abdelouafi
– sequence: 2
  givenname: Ahmed
  surname: Roubi
  fullname: Roubi, Ahmed
BookMark eNotUMFKAzEUDFLBWnvxC3IW1r4ku5vNUYpaoaAHPS_Z5KUNbJOSbLX69W61p2GGmYGZazIJMSAhtwzuGVRskeKCA6-gFhdkyhsoCylATMgUhFIFVJW6IvOcfTeam7pWUE2Jf0vx6He6p90h2B7pDodttJm6mOgGAybd-x-01CVtBh_D6NynuEl6l-mXH7Y06VHONDpqvXOYMBg8MRPDJx6pO4S_XL4hl073GednnJGPp8f35apYvz6_LB_WheG8GQojjQAJBgAUOs4BTaVLgLoDYctOMqu5QVk7JiST6DqhUKna8IaxpjRWzMjdf69JMeeErt2ncWD6bhm0p5_aFNvzT-IXnX9ezg
Cites_doi 10.1023/B:JOTA.0000026134.57920.e1
10.1137/S1052623401384096
10.3934/jimo.2018128
10.1137/S0363012995281742
10.1007/978-3-662-02796-7
10.1073/pnas.39.1.42
10.1007/s10957-018-1342-1
10.1007/978-1-4757-2809-5
10.1007/s10479-004-5022-1
10.1007/BF03398807
10.1109/JSTSP.2015.2469259
10.1007/s11590-020-01694-w
10.1080/10556788.2020.1818234
10.1007/BF00940006
10.1007/s10898-017-0523-z
10.1007/s10898-019-00757-2
10.1007/s10898-007-9270-x
10.1109/TSP.2018.2868265
10.1007/BF01582298
10.1137/0802008
10.1007/BF00138690
10.1023/A:1004660917684
10.1287/moor.2.2.191
10.1007/BF00941314
10.1080/10556788.2017.1392520
10.1007/BF02591883
10.1007/s10898-017-0568-z
10.1080/02331934.2023.2257220
10.1007/s10107-007-0112-x
10.1137/120891009
10.1080/10556780290027828
10.1080/02331934.2017.1338698
10.3934/jimo.2017028
10.1007/s10957-020-01738-2
10.1109/LSP.2016.2555880
10.1051/ro/2017004
10.1007/978-94-009-0035-6
10.1016/S0304-0208(08)72400-9
10.1137/18M1199708
10.1007/BF00938484
10.1080/02331930600819613
10.1080/02331934.2016.1276179
10.1287/moor.22.2.326
10.1007/BF01585170
10.1007/BFb0120960
10.1051/ro:2002006
10.1007/BF02591908
10.1080/02331934.2019.1632250
10.1007/BF01582887
10.1007/BF00935361
10.1007/978-3-642-45610-7_3
10.1109/TSP.2016.2576423
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1051/ro/2025063
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2804-7303
EndPage 1774
ExternalDocumentID 10_1051_ro_2025063
GroupedDBID --K
-E.
.FH
0E1
123
1B1
4.4
5VS
74X
74Y
7~V
8FE
8FG
AADXX
AAFWJ
AAOGA
AAOTM
AAYXX
ABGDZ
ABKKG
ABNSH
ABUBZ
ABZDU
ACACO
ACGFS
ACIMK
ACIWK
ACQPF
ACRPL
ACZPN
ADNMO
AEMTW
AFAYI
AFHSK
AFUTZ
AGQPQ
AJPFC
ALMA_UNASSIGNED_HOLDINGS
AMVHM
ARABE
ASPBG
AVWKF
AZPVJ
BPHCQ
C0O
CITATION
CS3
DC4
EBS
EJD
FAM
HG-
HST
HZ~
I-F
I.6
IHE
IL9
I~P
J36
J38
J3A
K60
K6V
K6~
L6V
L98
LO0
M-V
M41
NIF
O9-
OAV
P62
PQQKQ
PROAC
RCA
ROL
RPZ
RR0
S6-
WQ3
WXU
ID FETCH-LOGICAL-c228t-c7c3070c0009ef220ec5a4006b03d4b71da2ce76f13717efb39e996c281184cd3
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001527888800004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0399-0559
IngestDate Sat Nov 29 07:46:55 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
License https://creativecommons.org/licenses/by/4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c228t-c7c3070c0009ef220ec5a4006b03d4b71da2ce76f13717efb39e996c281184cd3
OpenAccessLink https://doi.org/10.1051/ro/2025063
PageCount 26
ParticipantIDs crossref_primary_10_1051_ro_2025063
PublicationCentury 2000
PublicationDate 2025-07-01
PublicationDateYYYYMMDD 2025-07-01
PublicationDate_xml – month: 07
  year: 2025
  text: 2025-07-01
  day: 01
PublicationDecade 2020
PublicationTitle R.A.I.R.O. Recherche opérationnelle
PublicationYear 2025
References Ghazi (R4) 2022; 37
Barros (R17) 1996; 8
Addoune (R24) 2017; 66
Boualam (R27) 2019; 74
Aubry (R36) 2016; 23
Crouzeix (R6) 1985; 47
Stancu-Minasian (R31) 2017; 66
Salmon (R58) 2004; 14
R62
Roubi (R10) 2000; 107
R28
Crouzeix (R11) 2008; 45
Nguyen (R57) 2009; 116
Barros (R16) 1996; 72
Jagannathan (R14) 1983; 41
Aubry (R35) 2015; 9
R3
Fukushima (R48) 1984; 30
Boufi (R23) 2019; 29
Kiwiel (R51) 1997; 35
Le Thi (R44) 2005; 133
Boufi (R22) 2019; 34
Fan (R60) 1953; 39
Bector (R18) 1989; 60
Mifflin (R47) 1982; 17
El Haffari (R19) 2017; 13
R34
Boualam (R26) 2019; 15
R33
Razaviyayn (R40) 2013; 23
Crouzeix (R7) 1986; 50
Roubi (R12) 2002; 36
R39
Hue (R56) 2004; 121
Aubry (R41) 2018; 66
Correa (R55) 1993; 62
Schramm (R52) 1992; 2
Boufi (R21) 2017; 69
Stancu-Minasian (R29) 2006; 55
Stancu-Minasian (R32) 2019; 68
M¨akel¨a (R54) 2002; 17
Stancu-Minasian (R30) 2013; 15
R43
R45
Crouzeix (R9) 1991; 52
Le Thi (R38) 2015; 15
R49
Aubry (R37) 2016; 64
Ghazi (R5) 2023; 74
Mifflin (R46) 1977; 2
Kiwiel (R50) 1997; 22
Strodiot (R13) 2008; 42
Gaudioso (R42) 2018; 71
Ghazi (R2) 2021; 15
Boufi (R1) 2020; 187
Crouzeix (R15) 1983; 27
R53
Addoune (R25) 2018; 179
R59
El Haffari (R20) 2017; 51
Sion (R61) 1958; 8
Bernard (R8) 1989; 43
References_xml – volume: 121
  start-page: 119
  year: 2004
  ident: R56
  publication-title: J. Optim. Theory App.
  doi: 10.1023/B:JOTA.0000026134.57920.e1
– volume: 14
  start-page: 869
  year: 2004
  ident: R58
  publication-title: SIAM J. Optim.
  doi: 10.1137/S1052623401384096
– volume: 15
  start-page: 1897
  year: 2019
  ident: R26
  publication-title: J. Ind. Manag. Optim.
  doi: 10.3934/jimo.2018128
– volume: 35
  start-page: 1142
  year: 1997
  ident: R51
  publication-title: SIAM J. Control Optim.
  doi: 10.1137/S0363012995281742
– ident: R59
  doi: 10.1007/978-3-662-02796-7
– volume: 39
  start-page: 42
  year: 1953
  ident: R60
  publication-title: Proc. Nat. Acad. Sci. USA
  doi: 10.1073/pnas.39.1.42
– volume: 179
  start-page: 212
  year: 2018
  ident: R25
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/s10957-018-1342-1
– ident: R3
  doi: 10.1007/978-1-4757-2809-5
– volume: 133
  start-page: 23
  year: 2005
  ident: R44
  publication-title: Ann. Oper. Res.
  doi: 10.1007/s10479-004-5022-1
– volume: 15
  start-page: 137
  year: 2015
  ident: R38
  publication-title: Math. Program. Ser. B
– volume: 15
  start-page: 309
  year: 2013
  ident: R30
  publication-title: Adv. Model. Optim.
– volume: 45
  start-page: 97
  year: 2008
  ident: R11
  publication-title: Opsearch
  doi: 10.1007/BF03398807
– volume: 9
  start-page: 1387
  year: 2015
  ident: R35
  publication-title: IEEE J. Selected Topics Signal Process.
  doi: 10.1109/JSTSP.2015.2469259
– ident: R33
– volume: 15
  start-page: 2351
  year: 2021
  ident: R2
  publication-title: Optim. Lett.
  doi: 10.1007/s11590-020-01694-w
– volume: 37
  start-page: 639
  year: 2022
  ident: R4
  publication-title: Optim. Methods Softw.
  doi: 10.1080/10556788.2020.1818234
– volume: 60
  start-page: 243
  year: 1989
  ident: R18
  publication-title: J. Optim. Theory App.
  doi: 10.1007/BF00940006
– volume: 69
  start-page: 387
  year: 2017
  ident: R21
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-017-0523-z
– volume: 74
  start-page: 255
  year: 2019
  ident: R27
  publication-title: J. Global Optim.
  doi: 10.1007/s10898-019-00757-2
– volume: 72
  start-page: 147
  year: 1996
  ident: R16
  publication-title: Math. Program.
– ident: R39
– volume: 42
  start-page: 121
  year: 2008
  ident: R13
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-007-9270-x
– volume: 66
  start-page: 6518
  year: 2018
  ident: R41
  publication-title: IEEE Trans. Signal Process.
  doi: 10.1109/TSP.2018.2868265
– volume: 43
  start-page: 349
  year: 1989
  ident: R8
  publication-title: Math. Program.
  doi: 10.1007/BF01582298
– volume: 2
  start-page: 121
  year: 1992
  ident: R52
  publication-title: SIAM J. Optim.
  doi: 10.1137/0802008
– volume: 8
  start-page: 139
  year: 1996
  ident: R17
  publication-title: J. Glob. Optim.
  doi: 10.1007/BF00138690
– volume: 107
  start-page: 123
  year: 2000
  ident: R10
  publication-title: J. Optim. Theory Appl.
  doi: 10.1023/A:1004660917684
– volume: 2
  start-page: 191
  year: 1977
  ident: R46
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.2.2.191
– volume: 47
  start-page: 35
  year: 1985
  ident: R6
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/BF00941314
– volume: 34
  start-page: 515
  year: 2019
  ident: R22
  publication-title: Optim. Methods Softw.
  doi: 10.1080/10556788.2017.1392520
– volume: 30
  start-page: 163
  year: 1984
  ident: R48
  publication-title: Math. Program.
  doi: 10.1007/BF02591883
– volume: 71
  start-page: 37
  year: 2018
  ident: R42
  publication-title: J. Global Optim.
  doi: 10.1007/s10898-017-0568-z
– volume: 74
  start-page: 427
  year: 2023
  ident: R5
  publication-title: Optimization
  doi: 10.1080/02331934.2023.2257220
– volume: 116
  start-page: 529
  year: 2009
  ident: R57
  publication-title: Math. Program.
  doi: 10.1007/s10107-007-0112-x
– volume: 23
  start-page: 1126
  year: 2013
  ident: R40
  publication-title: SIAM J. Optim.
  doi: 10.1137/120891009
– volume: 17
  start-page: 1
  year: 2002
  ident: R54
  publication-title: Optim. Methods Softw.
  doi: 10.1080/10556780290027828
– volume: 66
  start-page: 1495
  year: 2017
  ident: R24
  publication-title: Optimization
  doi: 10.1080/02331934.2017.1338698
– volume: 13
  start-page: 1991
  year: 2017
  ident: R19
  publication-title: J. Ind. Manag. Optim.
  doi: 10.3934/jimo.2017028
– volume: 187
  start-page: 105
  year: 2020
  ident: R1
  publication-title: J. Optim. Theory App.
  doi: 10.1007/s10957-020-01738-2
– volume: 23
  start-page: 848
  year: 2016
  ident: R36
  publication-title: IEEE Signal Process. Lett.
  doi: 10.1109/LSP.2016.2555880
– volume: 51
  start-page: 985
  year: 2017
  ident: R20
  publication-title: RAIRO-Oper. Res.
  doi: 10.1051/ro/2017004
– ident: R53
  doi: 10.1007/978-3-662-02796-7
– ident: R28
  doi: 10.1007/978-94-009-0035-6
– ident: R49
  doi: 10.1016/S0304-0208(08)72400-9
– volume: 29
  start-page: 1578
  year: 2019
  ident: R23
  publication-title: SIAM J. Optim.
  doi: 10.1137/18M1199708
– volume: 50
  start-page: 183
  year: 1986
  ident: R7
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/BF00938484
– volume: 55
  start-page: 405
  year: 2006
  ident: R29
  publication-title: Optimization
  doi: 10.1080/02331930600819613
– volume: 66
  start-page: 439
  year: 2017
  ident: R31
  publication-title: Optimization
  doi: 10.1080/02331934.2016.1276179
– ident: R62
– volume: 22
  start-page: 326
  year: 1997
  ident: R50
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.22.2.326
– volume: 62
  start-page: 261
  year: 1993
  ident: R55
  publication-title: Math. Program.
  doi: 10.1007/BF01585170
– volume: 17
  start-page: 77
  year: 1982
  ident: R47
  publication-title: Math. Program. Stud.
  doi: 10.1007/BFb0120960
– volume: 36
  start-page: 73
  year: 2002
  ident: R12
  publication-title: RAIRO Oper. Res.
  doi: 10.1051/ro:2002006
– volume: 27
  start-page: 342
  year: 1983
  ident: R15
  publication-title: Math. Program.
  doi: 10.1007/BF02591908
– ident: R45
– volume: 68
  start-page: 2123
  year: 2019
  ident: R32
  publication-title: Optimization
  doi: 10.1080/02331934.2019.1632250
– volume: 52
  start-page: 191
  year: 1991
  ident: R9
  publication-title: Math. Program.
  doi: 10.1007/BF01582887
– volume: 41
  start-page: 417
  year: 1983
  ident: R14
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/BF00935361
– ident: R43
  doi: 10.1007/978-3-642-45610-7_3
– volume: 64
  start-page: 5848
  year: 2016
  ident: R37
  publication-title: IEEE Trans. Signal Process.
  doi: 10.1109/TSP.2016.2576423
– volume: 8
  start-page: 171
  year: 1958
  ident: R61
  publication-title: Pac. J. Optim.
– ident: R34
SSID ssib051866905
ssib051327486
ssj0003353
ssib050921426
Score 2.3427296
Snippet In this paper, we present an approximating scheme based on the proximal point algorithm for solving generalized fractional programs involving ratios of...
SourceID crossref
SourceType Index Database
StartPage 1749
Title Proximal bundle methods for generalized fractional programs with ratios of difference of convex functions
Volume 59
WOSCitedRecordID wos001527888800004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2804-7303
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib051866905
  issn: 0399-0559
  databaseCode: M~E
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1La9tAEF7ctIfmUPqk6YuF9hakSKvHro6m5FFo01BSyM1oVyMiSCSj2sbk0HN_dmdfktpc0kPBFtZalszOxzx2Z74h5IPe3EO7pgKIFccARchAVHUZ5FDlBY8UBh2ma8lnfnoqLi6Ks9nsl6-F2VzxthXbbbH8r6LGMRS2Lp39B3EPN8UB_IxCxyOKHY93EvxZ322ba5x5udYECq5HtKFd0P2S9RpUc4NuZt3bmgZdimWTtFylm8GEyfDw3VMU2OzzdgPbfW0Jx1U-z-0dzsNP4bfwa6gdUcQBvve7pd2GtyDT-TQDio4vyxuTRzCXFVx169KWD9utn7W0X11eu8ortyrBsiGDdajG0uwGmWP7BjPGRJQGqFGSqfZ1VzTTpQWjSjFUKiZmOea2m88tlY9aBUWii4KO9B-JnL78g1n7L4s35CGaHfgsXvTdwv32HrmP4C20iv_y89BrJvSqNDXd4LhlGMPzVEzORZ4X0Rh4JYnlP_Wz4Ilxs_ig7w7csyau0MSnOX9MHrlghM4tiJ6QGbRPye6EovIZaTycqIUTdXCiCCc6gRMd4UQ9nKiGE7Vwol1NRzjpMwsnOsDpOfl-dHj-8SRw7TkCxZhYBYorbTCUdtOhZiwClZVoEnIZJVUqeVyVTAHP6zjhMYdaJgVgdK2YwKA2VVXyguy0XQsvCU1ljC-e1jmgRymYFJCi7SmhLEQNebZH3vuZWiwtC8vituxe3emq1-ThCNg3ZGfVr-EteaA2q-ZH_86I_TdCNXmC
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Proximal+bundle+methods+for+generalized+fractional+programs+with+ratios+of+difference+of+convex+functions&rft.jtitle=R.A.I.R.O.+Recherche+op%C3%A9rationnelle&rft.au=Ghazi%2C+Abdelouafi&rft.au=Roubi%2C+Ahmed&rft.date=2025-07-01&rft.issn=0399-0559&rft.eissn=2804-7303&rft.volume=59&rft.issue=4&rft.spage=1749&rft.epage=1774&rft_id=info:doi/10.1051%2Fro%2F2025063&rft.externalDBID=n%2Fa&rft.externalDocID=10_1051_ro_2025063
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0399-0559&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0399-0559&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0399-0559&client=summon