Napsu Karmitsa

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 14

Top Topics

Nonlinear Programming Problems

Top Venues

J. Optim. Theory Appl.

J. Glob. Optim.

Optim. Methods Softw.

Publications

Manlio Gaudioso, Sona Taheri, Adil M. Bagirov, Napsu Karmitsa
Bundle Enrichment Method for Nonsmooth Difference of Convex Programming Problems. Algorithms 16 (8) (2023)
Napsu Karmitsa, Sona Taheri, Kaisa Joki, Pauliina Paasivirta, Adil M. Bagirov, Marko M. Mäkelä
Nonsmooth Optimization-Based Hyperparameter-Free Neural Networks for Large-Scale Regression. Algorithms 16 (9) (2023)
Adil M. Bagirov, Sona Taheri, Napsu Karmitsa, Nargiz Sultanova, Soodabeh Asadi
-regression via nonsmooth DC optimization. Optim. Methods Softw. 37 (4) (2022)
Napsu Karmitsa, Sona Taheri, Adil M. Bagirov, Pauliina Mäkinen
Missing Value Imputation via Clusterwise Linear Regression. IEEE Trans. Knowl. Data Eng. 34 (4) (2022)
Adil M. Bagirov, Sona Taheri, Kaisa Joki, Napsu Karmitsa, Marko M. Mäkelä
Aggregate subgradient method for nonsmooth DC optimization. Optim. Lett. 15 (1) (2021)
Napsu Karmitsa, Sona Taheri
Special Issue "Nonsmooth Optimization in Honor of the 60th Birthday of Adil M. Bagirov": Foreword by Guest Editors. Algorithms 13 (11) (2020)
Kaisa Joki, Adil M. Bagirov, Napsu Karmitsa, Marko M. Mäkelä, Sona Taheri
Clusterwise support vector linear regression. Eur. J. Oper. Res. 287 (1) (2020)
Napsu Karmitsa, Manlio Gaudioso, Kaisa Joki
Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization. Optim. Methods Softw. 34 (2) (2019)
Kaisa Joki, Adil M. Bagirov, Napsu Karmitsa, Marko M. Mäkelä, Sona Taheri
Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming. SIAM J. Optim. 28 (2) (2018)
Napsu Karmitsa, Adil M. Bagirov, Sona Taheri
Clustering in large data sets with the limited memory bundle method. Pattern Recognit. 83 (2018)
Kaisa Joki, Adil M. Bagirov, Napsu Karmitsa, Marko M. Mäkelä
A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes. J. Glob. Optim. 68 (3) (2017)
Ville-Pekka Eronen, Jan Kronqvist, Tapio Westerlund, Marko M. Mäkelä, Napsu Karmitsa
Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems. J. Glob. Optim. 69 (2) (2017)
Napsu Karmitsa, Adil M. Bagirov, Sona Taheri
New diagonal bundle method for clustering problems in large data sets. Eur. J. Oper. Res. 263 (2) (2017)
Napsu Karmitsa
Testing Different Nonsmooth Formulations of the Lennard-Jones Potential in Atomic Clustering Problems. J. Optim. Theory Appl. 171 (1) (2016)
Napsu Karmitsa
Diagonal Bundle Method for Nonsmooth Sparse Optimization. J. Optim. Theory Appl. 166 (3) (2015)
Seppo Pulkkinen, Marko M. Mäkelä, Napsu Karmitsa
A generative model and a generalized trust region Newton method for noise reduction. Comput. Optim. Appl. 57 (1) (2014)
Seppo Pulkkinen, Marko M. Mäkelä, Napsu Karmitsa
A continuation approach to mode-finding of multivariate Gaussian mixtures and kernel density estimates. J. Glob. Optim. 56 (2) (2013)
Adil M. Bagirov, L. Jin, Napsu Karmitsa, A. Al Nuaimat, Napsu Sultanova
Subgradient Method for Nonconvex Nonsmooth Optimization. J. Optim. Theory Appl. 157 (2) (2013)
Napsu Karmitsa, Mario Tanaka Filho, José Herskovits
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization. J. Optim. Theory Appl. 148 (3) (2011)
Napsu Karmitsa, Marko M. Mäkelä
Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis. Optim. Methods Softw. 25 (6) (2010)