IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v39y2022i05ns0217595921500391.html
   My bibliography  Save this article

Proximal Gradient-Type Algorithms for a Class of Bilevel Programming Problems

Author

Listed:
  • Dan Li

    (Information and Engineering College, Dalian University, Dalian 116622, P. R. China)

  • Shuang Chen

    (Information and Engineering College, Dalian University, Dalian 116622, P. R. China)

  • Li-Ping Pang

    (School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, P. R. China)

Abstract

A class of proximal gradient-type algorithm for bilevel nonlinear nondifferentiable programming problems with smooth substructure is developed in this paper. The original problem is approximately reformulated by explicit slow control technique to a parameterized family function which makes full use of the information of smoothness. At each iteration, we only need to calculate one proximal point analytically or with low computational cost. We prove that the accumulation iterations generated by the algorithms are solutions of the original problem. Moreover, some results of complexity of the algorithms are presented in convergence analysis. Numerical experiments are implemented to verify the efficiency of the proximal gradient algorithms for solving this kind of bilevel programming problems.

Suggested Citation

  • Dan Li & Shuang Chen & Li-Ping Pang, 2022. "Proximal Gradient-Type Algorithms for a Class of Bilevel Programming Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 39(05), pages 1-17, October.
    • Handle: RePEc:wsi:apjorx:v:39:y:2022:i:05:n:s0217595921500391
    DOI: 10.1142/S0217595921500391
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595921500391
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595921500391?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 search for a different version of it.

    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:wsi:apjorx:v:39:y:2022:i:05:n:s0217595921500391. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.