IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v207y2025i2d10.1007_s10957-025-02799-x.html
   My bibliography  Save this article

An Implementable Proximal Extragradient Method for Structured Fractional Programming

Author

Listed:
  • Jiajun Hao

    (Ningbo University)

  • Hongjin He

    (Ningbo University)

  • Liangshao Hou

    (Sun Yat-sen University
    Hong Kong Baptist University)

Abstract

A class of structured fractional programming is studied, where the numerator of the objective function consists of the sum of a nonsmooth function and a smooth function, while the denominator is a convex function. To solve this class of problems, the implementable proximal extragradient algorithm (IPEM) and its variant with linesearch (IPEM-L) are proposed. First, the fractional structure is handled using Dinkelbach’s method. Then, the extended extragradient method is applied to solve the resulting subproblems. By incorporating parameter updates, the proposed algorithms are formulated. A practical linesearch is further introduced to enhance efficiency of the IPEM. Under certain assumptions, both subsequential and whole sequence convergence are established, with the latter relying on the Kurdyka-Łojasiewicz (KŁ) property. Finally, numerical experiments on some synthetic and real datasets demonstrate the competitiveness of the proposed algorithms.

Suggested Citation

  • Jiajun Hao & Hongjin He & Liangshao Hou, 2025. "An Implementable Proximal Extragradient Method for Structured Fractional Programming," Journal of Optimization Theory and Applications, Springer, vol. 207(2), pages 1-33, November.
    • Handle: RePEc:spr:joptap:v:207:y:2025:i:2:d:10.1007_s10957-025-02799-x
    DOI: 10.1007/s10957-025-02799-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-025-02799-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-025-02799-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:207:y:2025:i:2:d:10.1007_s10957-025-02799-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.