IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v171y2016i1d10.1007_s10957-016-0955-5.html
   My bibliography  Save this article

Testing Different Nonsmooth Formulations of the Lennard–Jones Potential in Atomic Clustering Problems

Author

Listed:
  • Napsu Karmitsa

    (University of Turku)

Abstract

A cluster is a group of identical molecules or atoms loosely bound by inter-atomic forces. The optimal geometry minimises the potential energy—usually modelled as the Lennard–Jones potential—of the cluster. The minimisation of the Lennard–Jones potential is a very difficult global optimisation problem with extremely many local minima. In addition to cluster problems, the Lennard–Jones potential represents an important component in many of the potential energy models used, for example, in protein folding, protein–peptide docking, and complex molecular conformation problems. In this paper, we study different modifications of the Lennard–Jones potential in order to improve the success rate of finding the global minimum of the original potential. The main interest of the paper is in nonsmooth penalised form of the Lennard–Jones potential. The preliminary numerical experiments confirm that the success rate of finding the global minimum is clearly improved when using the new formulae.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:joptap:v:171:y:2016:i:1:d:10.1007_s10957-016-0955-5
    DOI: 10.1007/s10957-016-0955-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-016-0955-5
    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-016-0955-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. 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.
    2. Francesco Lampariello & Giampaolo Liuzzi, 2015. "Global Optimization of Protein–peptide Docking by a Filling Function Method," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 1090-1108, March.
    3. Adil Bagirov & Napsu Karmitsa & Marko M. Mäkelä, 2014. "Introduction to Nonsmooth Optimization," Springer Books, Springer, edition 127, number 978-3-319-08114-4, October.
    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)

    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. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2020. "Essentials of numerical nonsmooth optimization," 4OR, Springer, vol. 18(1), pages 1-47, March.
    2. M. Golestani & H. Sadeghi & Y. Tavan, 2018. "Nonsmooth Multiobjective Problems and Generalized Vector Variational Inequalities Using Quasi-Efficiency," Journal of Optimization Theory and Applications, Springer, vol. 179(3), pages 896-916, December.
    3. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2022. "Essentials of numerical nonsmooth optimization," Annals of Operations Research, Springer, vol. 314(1), pages 213-253, July.
    4. Joki, Kaisa & Bagirov, Adil M. & Karmitsa, Napsu & Mäkelä, Marko M. & Taheri, Sona, 2020. "Clusterwise support vector linear regression," European Journal of Operational Research, Elsevier, vol. 287(1), pages 19-35.
    5. Gaudioso, Manlio & Giallombardo, Giovanni & Mukhametzhanov, Marat, 2018. "Numerical infinitesimals in a variable metric method for convex nonsmooth optimization," Applied Mathematics and Computation, Elsevier, vol. 318(C), pages 312-320.
    6. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2018. "Minimizing Piecewise-Concave Functions Over Polyhedra," Mathematics of Operations Research, INFORMS, vol. 43(2), pages 580-597, May.
    7. 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.
    8. Felipe Serrano & Robert Schwarz & Ambros Gleixner, 2020. "On the relation between the extended supporting hyperplane algorithm and Kelley’s cutting plane algorithm," Journal of Global Optimization, Springer, vol. 78(1), pages 161-179, September.
    9. 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.
    10. Tapio Westerlund & Ville-Pekka Eronen & Marko M. Mäkelä, 2018. "On solving generalized convex MINLP problems using supporting hyperplane techniques," Journal of Global Optimization, Springer, vol. 71(4), pages 987-1011, August.
    11. Ville-Pekka Eronen & Jan Kronqvist & Tapio Westerlund & Marko M. Mäkelä & Napsu Karmitsa, 2017. "Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems," Journal of Global Optimization, Springer, vol. 69(2), pages 443-459, October.
    12. 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.
    13. Nader Kanzi & Majid Soleimani-damaneh, 2020. "Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization," Journal of Global Optimization, Springer, vol. 77(3), pages 627-641, July.
    14. Olivier Morand & Kevin Reffett & Suchismita Tarafdar, 2018. "Generalized Envelope Theorems: Applications to Dynamic Programming," Journal of Optimization Theory and Applications, Springer, vol. 176(3), pages 650-687, March.
    15. M. V. Dolgopolik, 2018. "A convergence analysis of the method of codifferential descent," Computational Optimization and Applications, Springer, vol. 71(3), pages 879-913, December.
    16. A. Bagirov & J. Ugon, 2011. "Codifferential method for minimizing nonsmooth DC functions," Journal of Global Optimization, Springer, vol. 50(1), pages 3-22, May.
    17. Li-Ping Pang & Qi Wu & Jin-He Wang & Qiong Wu, 2020. "A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods," Computational Optimization and Applications, Springer, vol. 76(1), pages 125-153, May.
    18. Shuai Liu, 2019. "A simple version of bundle method with linear programming," Computational Optimization and Applications, Springer, vol. 72(2), pages 391-412, March.
    19. Morteza Maleknia & Mostafa Shamsi, 2020. "A Gradient Sampling Method Based on Ideal Direction for Solving Nonsmooth Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 187(1), pages 181-204, October.
    20. K. C. Kiwiel, 2010. "Improved Convergence Result for the Discrete Gradient and Secant Methods for Nonsmooth Optimization," Journal of Optimization Theory and Applications, Springer, vol. 144(1), pages 69-75, January.

    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:171:y:2016:i:1:d:10.1007_s10957-016-0955-5. 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.