References in zbMATH (referenced in 13 articles )

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

  1. Montonen, Outi; Karmitsa, N.; Mäkelä, M.M.: Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization (2018)
  2. Fendl, Hannes; Neumaier, Arnold; Schichl, Hermann: Certificates of infeasibility via nonsmooth optimization (2017)
  3. Joki, Kaisa; Bagirov, Adil M.; Karmitsa, Napsu; Mäkelä, Marko M.: A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes (2017)
  4. Khan, Kamil A.; Watson, Harry A.J.; Barton, Paul I.: Differentiable McCormick relaxations (2017)
  5. Yuan, Gonglin; Meng, Zehong; Li, Yong: A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (2016)
  6. Karmitsa, Napsu: Diagonal bundle method for nonsmooth sparse optimization (2015)
  7. Wechsung, Achim; Scott, Joseph K.; Watson, Harry A.J.; Barton, Paul I.: Reverse propagation of McCormick relaxations (2015)
  8. Bagirov, Adil; Karmitsa, Napsu; Mäkelä, Marko M.: Introduction to nonsmooth optimization. Theory, practice and software (2014)
  9. 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)
  10. Mäkelä, Marko M.; Karmitsa, Napsu; Bagirov, Adil: Subgradient and bundle methods for nonsmooth optimization (2013)
  11. Karmitsa, N.; Bagirov, A.; Mäkelä, M.M.: Comparing different nonsmooth minimization methods and software (2012)
  12. Karmitsa, Napsu; Mäkelä, Marko M.: Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis (2010)
  13. Karmitsa, N.; Mäkelä, M.M.: Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization (2010)