QSM is a Fortran implementation of the quasi-secant method for nonsmooth possibly nonconvex minimization. The user can employ either analytically calculated or approximated subgradients in his experiments (this can be done automatically by selecting one parameter). The software is free for academic teaching and research purposes but I ask you to refer the reference given below if you use it. If you have any questions conserning the software, please contact directly the author Prof. Adil Bagirov

References in zbMATH (referenced in 20 articles )

Showing results 1 to 20 of 20.
Sorted by year (citations)

  1. Bagirov, Adil M.; Taheri, Sona; Joki, Kaisa; Karmitsa, Napsu; Mäkelä, Marko M.: Aggregate subgradient method for nonsmooth DC optimization (2021)
  2. Gaudioso, Manlio; Giallombardo, Giovanni; Miglionico, Giovanna: Minimizing piecewise-concave functions over polyhedra (2018)
  3. Hoseini, N.; Nobakhtian, S.: A new trust region method for nonsmooth nonconvex optimization (2018)
  4. Joki, Kaisa; Bagirov, Adil M.; Karmitsa, Napsu; Mäkelä, Marko M.: A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes (2017)
  5. Long, Qiang; Wu, Changzhi; Wang, Xiangyu; Wu, Zhiyou: A modified quasisecant method for global optimization (2017)
  6. Mahdavi-Amiri, N.; Shaeiri, M.: An adaptive competitive penalty method for nonsmooth constrained optimization (2017)
  7. Yuan, Gonglin; Meng, Zehong; Li, Yong: A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (2016)
  8. Karmitsa, Napsu: Diagonal bundle method for nonsmooth sparse optimization (2015)
  9. Long, Qiang; Wu, Changzhi; Wang, Xiangyu: A system of nonsmooth equations solver based upon subgradient method (2015)
  10. Bagirov, Adil; Karmitsa, Napsu; Mäkelä, Marko M.: Introduction to nonsmooth optimization. Theory, practice and software (2014)
  11. Burachik, Regina S.; Freire, Wilhelm P.; Kaya, C. Yalçın: Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality (2014)
  12. Long, Qiang; Wu, Changzhi: A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization (2014)
  13. Bagirov, A. M.; Jin, L.; Karmitsa, N.; Al Nuaimat, A.; Sultanova, N.: Subgradient method for nonconvex nonsmooth optimization (2013)
  14. Li, Qiong: Conjugate gradient type methods for the nondifferentiable convex minimization (2013)
  15. Long, Qiang; Wu, Changzhi: A quasisecant method for solving a system of nonsmooth equations (2013)
  16. Mäkelä, Marko M.; Karmitsa, Napsu; Bagirov, Adil: Subgradient and bundle methods for nonsmooth optimization (2013)
  17. Karmitsa, N.; Bagirov, A.; Mäkelä, M. M.: Comparing different nonsmooth minimization methods and software (2012)
  18. Bagirov, A. M.; Ugon, J.: Codifferential method for minimizing nonsmooth DC functions (2011)
  19. Bagirov, Adil M.; Ganjehlou, Asef Nazari: A quasisecant method for minimizing nonsmooth functions (2010)
  20. Kiwiel, K. C.: Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization (2010)