IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v48y2023i1p53-77.html
   My bibliography  Save this article

Convergent Nested Alternating Minimization Algorithms for Nonconvex Optimization Problems

Author

Listed:
  • Eyal Gur

    (Faculty of Industrial Engineering and Management, Technion–Israel Institute of Technology, Haifa 3200003, Israel)

  • Shoham Sabach

    (Faculty of Industrial Engineering and Management, Technion–Israel Institute of Technology, Haifa 3200003, Israel)

  • Shimrit Shtern

    (Faculty of Industrial Engineering and Management, Technion–Israel Institute of Technology, Haifa 3200003, Israel)

Abstract

We introduce a new algorithmic framework for solving nonconvex optimization problems, that is called nested alternating minimization , which aims at combining the classical alternating minimization technique with inner iterations of any optimization method. We provide a global convergence analysis of the new algorithmic framework to critical points of the problem at hand, which to the best of our knowledge, is the first of this kind for nested methods in the nonconvex setting. Central to our global convergence analysis is a new extension of classical proof techniques in the nonconvex setting that allows for errors in the conditions. The power of our framework is illustrated with some numerical experiments that show the superiority of this algorithmic framework over existing methods.

Suggested Citation

  • Eyal Gur & Shoham Sabach & Shimrit Shtern, 2023. "Convergent Nested Alternating Minimization Algorithms for Nonconvex Optimization Problems," Mathematics of Operations Research, INFORMS, vol. 48(1), pages 53-77, February.
    • Handle: RePEc:inm:ormoor:v:48:y:2023:i:1:p:53-77
    DOI: 10.1287/moor.2022.1256
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.1256
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2022.1256?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
    ---><---

    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:inm:ormoor:v:48:y:2023:i:1:p:53-77. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.