IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v92y2025i1d10.1007_s10898-025-01485-6.html
   My bibliography  Save this article

Bundle trust region algorithm based on linear subproblem

Author

Listed:
  • Najmeh Hoseini Monjezi

    (University of Isfahan
    Institute for Research in Fundamental Sciences (IPM))

Abstract

Bundle algorithms are currently considered as the most efficient methods for nonsmooth optimization. In most existing bundle methods (proximal, level, and trust region versions), it is necessary to solve at least one quadratic subproblem at each iteration. In this paper, a new bundle trust region algorithm with linear programming subproblems is proposed for solving nonsmooth nonconvex optimization problems. At each iteration, a piecewise linear model is defined, and using the infinity norm and the trust region technique, a linear subproblem is generalized. The algorithm is studied from both theoretical and practical points of view. Under the locally Lipschitz assumption on the objective function, global convergence of it is verified to stationary points. In the end, some encouraging numerical results with a MATLAB implementation are also reported. Computational results show that the developed method is efficient and robust for solving nonsmooth problems.

Suggested Citation

  • Najmeh Hoseini Monjezi, 2025. "Bundle trust region algorithm based on linear subproblem," Journal of Global Optimization, Springer, vol. 92(1), pages 87-109, May.
    • Handle: RePEc:spr:jglopt:v:92:y:2025:i:1:d:10.1007_s10898-025-01485-6
    DOI: 10.1007/s10898-025-01485-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-025-01485-6
    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/s10898-025-01485-6?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:spr:jglopt:v:92:y:2025:i:1:d:10.1007_s10898-025-01485-6. 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.