IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v67y2008i2p187-206.html
   My bibliography  Save this article

An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization

Author

Listed:
  • Adil Bagirov
  • Asef Ganjehlou

Abstract

In this paper a new algorithm for minimizing locally Lipschitz functions is developed. Descent directions in this algorithm are computed by solving a system of linear inequalities. The convergence of the algorithm is proved for quasidifferentiable semismooth functions. We present the results of numerical experiments with both regular and nonregular objective functions. We also compare the proposed algorithm with two different versions of the subgradient method using the results of numerical experiments. These results demonstrate the superiority of the proposed algorithm over the subgradient method. Copyright Springer-Verlag 2008

Suggested Citation

  • Adil Bagirov & Asef Ganjehlou, 2008. "An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 67(2), pages 187-206, April.
    • Handle: RePEc:spr:mathme:v:67:y:2008:i:2:p:187-206
    DOI: 10.1007/s00186-007-0186-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-007-0186-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00186-007-0186-5?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.

    References listed on IDEAS

    as
    1. E. Polak & J. O. Royset, 2003. "Algorithms for Finite and Semi-Infinite Min–Max–Min Problems Using Adaptive Smoothing Techniques," Journal of Optimization Theory and Applications, Springer, vol. 119(3), pages 421-457, December.
    2. Bagirov, Adil M. & Yearwood, John, 2006. "A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems," European Journal of Operational Research, Elsevier, vol. 170(2), pages 578-596, April.
    3. A. Bagirov & A. Rubinov & N. Soukhoroukova & J. Yearwood, 2003. "Unsupervised and supervised data classification via nonsmooth and global optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 11(1), pages 1-75, June.
    4. A. M. Bagirov & B. Karasözen & M. Sezer, 2008. "Discrete Gradient Method: Derivative-Free Method for Nonsmooth Optimization," Journal of Optimization Theory and Applications, Springer, vol. 137(2), pages 317-334, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. A. M. Bagirov & L. Jin & N. Karmitsa & A. Al Nuaimat & N. Sultanova, 2013. "Subgradient Method for Nonconvex Nonsmooth Optimization," Journal of Optimization Theory and Applications, Springer, vol. 157(2), pages 416-435, May.
    2. Qu, Shaojian & Liu, Chen & Goh, Mark & Li, Yijun & Ji, Ying, 2014. "Nonsmooth multiobjective programming with quasi-Newton methods," European Journal of Operational Research, Elsevier, vol. 235(3), pages 503-510.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. A. M. Bagirov & B. Karasözen & M. Sezer, 2008. "Discrete Gradient Method: Derivative-Free Method for Nonsmooth Optimization," Journal of Optimization Theory and Applications, Springer, vol. 137(2), pages 317-334, May.
    2. A. Bagirov & B. Ordin & G. Ozturk & A. Xavier, 2015. "An incremental clustering algorithm based on hyperbolic smoothing," Computational Optimization and Applications, Springer, vol. 61(1), pages 219-241, May.
    3. Karmitsa, Napsu & Bagirov, Adil M. & Taheri, Sona, 2017. "New diagonal bundle method for clustering problems in large data sets," European Journal of Operational Research, Elsevier, vol. 263(2), pages 367-379.
    4. A. Bagirov & J. Ugon, 2011. "Codifferential method for minimizing nonsmooth DC functions," Journal of Global Optimization, Springer, vol. 50(1), pages 3-22, May.
    5. Nezam Mahdavi-Amiri & Rohollah Yousefpour, 2012. "An Effective Nonsmooth Optimization Algorithm for Locally Lipschitz Functions," Journal of Optimization Theory and Applications, Springer, vol. 155(1), pages 180-195, October.
    6. Bagirov, Adil M. & Ugon, Julien & Mirzayeva, Hijran, 2013. "Nonsmooth nonconvex optimization approach to clusterwise linear regression problems," European Journal of Operational Research, Elsevier, vol. 229(1), pages 132-142.
    7. Rubinov, A.M. & Soukhorokova, N.V. & Ugon, J., 2006. "Classes and clusters in data analysis," European Journal of Operational Research, Elsevier, vol. 173(3), pages 849-865, September.
    8. Hui-juan Xiong & Bo Yu, 2010. "An aggregate deformation homotopy method for min-max-min problems with max-min constraints," Computational Optimization and Applications, Springer, vol. 47(3), pages 501-527, November.
    9. B. Rustem & S. Žaković & P. Parpas, 2008. "Convergence of an Interior Point Algorithm for Continuous Minimax," Journal of Optimization Theory and Applications, Springer, vol. 136(1), pages 87-103, January.
    10. Napsu Karmitsa, 2016. "Testing Different Nonsmooth Formulations of the Lennard–Jones Potential in Atomic Clustering Problems," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 316-335, October.
    11. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2020. "Essentials of numerical nonsmooth optimization," 4OR, Springer, vol. 18(1), pages 1-47, March.
    12. Chen, Yi-Ting & Sun, Edward W. & Lin, Yi-Bing, 2020. "Merging anomalous data usage in wireless mobile telecommunications: Business analytics with a strategy-focused data-driven approach for sustainability," European Journal of Operational Research, Elsevier, vol. 281(3), pages 687-705.
    13. Gambella, Claudio & Ghaddar, Bissan & Naoum-Sawaya, Joe, 2021. "Optimization problems for machine learning: A survey," European Journal of Operational Research, Elsevier, vol. 290(3), pages 807-828.
    14. Alfred Auslender & Miguel A. Goberna & Marco A. López, 2009. "Penalty and Smoothing Methods for Convex Semi-Infinite Programming," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 303-319, May.
    15. Adil M. Bagirov & Julien Ugon & Hijran G. Mirzayeva, 2015. "Nonsmooth Optimization Algorithm for Solving Clusterwise Linear Regression Problems," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 755-780, March.
    16. Welington Oliveira, 2019. "Proximal bundle methods for nonsmooth DC programming," Journal of Global Optimization, Springer, vol. 75(2), pages 523-563, October.
    17. Laura Palagi, 2017. "Global Optimization issues in Supervised Learning. An overview," DIAG Technical Reports 2017-11, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    18. Kaisa Joki & Adil M. Bagirov & Napsu Karmitsa & Marko M. Mäkelä, 2017. "A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes," Journal of Global Optimization, Springer, vol. 68(3), pages 501-535, July.
    19. Angel Juan & Javier Faulin & Albert Ferrer & Helena Lourenço & Barry Barrios, 2013. "MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 109-132, April.
    20. Z. Akbari & R. Yousefpour & M. Reza Peyghami, 2015. "A New Nonsmooth Trust Region Algorithm for Locally Lipschitz Unconstrained Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 733-754, March.

    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:mathme:v:67:y:2008:i:2:p:187-206. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.