Napsu Karmitsa
napsu.karmitsa@utu.fi Vesilinnantie 5 Turku |
3 of 6
- A New Subgradient Based Method for Nonsmooth DC Programming (2019) Adil M. Bagirov, Sona Taheri, Kaisa Joki, Napsu Karmitsa, Marko M. Mäkelä
- Diagonal Bundle Method with Convex and Concave Updates for Large-Scale Nonconvex and Nonsmooth Optimization (2019)
- Optimization Methods and Software
- Clustering in large data sets with the limited memory bundle method (2018)
- Pattern Recognition
- Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming (2018)
- SIAM Journal on Optimization
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization (2018)
- Optimization
- On generalized pseudo- and quasiconvexities for nonsmooth functions (2018) Current Research in Nonlinear Analysis. Springer Optimization and Its Applications Ville-Pekka Eronen, Marko M. Mäkelä, Napsu Karmitsa
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes (2017)
- Journal of Global Optimization
- Double Bundle Method for Nonsmooth DC Optimization (2017)
- TUCS Publication Series
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems (2017)
- Journal of Global Optimization
- New bundle method for clusterwise linear regression utilizing support vector machines (2017)
- TUCS Publication Series
UTU Research Portal