default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNapsu Karmitsa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j22]Manlio Gaudioso, Sona Taheri
, Adil M. Bagirov, Napsu Karmitsa:
Bundle Enrichment Method for Nonsmooth Difference of Convex Programming Problems. Algorithms 16(8): 394 (2023)- [j21]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): 444 (2023) - 2022
- [j20]Adil M. Bagirov, Sona Taheri, Napsu Karmitsa, Nargiz Sultanova, Soodabeh Asadi:
Robust piecewise linear L1-regression via nonsmooth DC optimization. Optim. Methods Softw. 37(4): 1289-1309 (2022) - [j19]Napsu Karmitsa, Sona Taheri, Adil M. Bagirov, Pauliina Mäkinen:
Missing Value Imputation via Clusterwise Linear Regression. IEEE Trans. Knowl. Data Eng. 34(4): 1889-1901 (2022) - 2021
- [j18]Adil M. Bagirov, Sona Taheri, Kaisa Joki, Napsu Karmitsa, Marko M. Mäkelä:
Aggregate subgradient method for nonsmooth DC optimization. Optim. Lett. 15(1): 83-96 (2021) - 2020
- [j17]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): 282 (2020) - [j16]Kaisa Joki, Adil M. Bagirov, Napsu Karmitsa, Marko M. Mäkelä, Sona Taheri:
Clusterwise support vector linear regression. Eur. J. Oper. Res. 287(1): 19-35 (2020) - 2019
- [j15]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): 363-382 (2019) - 2018
- [j14]Napsu Karmitsa, Adil M. Bagirov, Sona Taheri:
Clustering in large data sets with the limited memory bundle method. Pattern Recognit. 83: 245-259 (2018) - [j13]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): 1892-1919 (2018) - 2017
- [j12]Napsu Karmitsa, Adil M. Bagirov, Sona Taheri:
New diagonal bundle method for clustering problems in large data sets. Eur. J. Oper. Res. 263(2): 367-379 (2017) - [j11]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): 501-535 (2017) - [j10]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): 443-459 (2017) - 2016
- [j9]Napsu Karmitsa:
Testing Different Nonsmooth Formulations of the Lennard-Jones Potential in Atomic Clustering Problems. J. Optim. Theory Appl. 171(1): 316-335 (2016) - 2015
- [j8]Napsu Karmitsa:
Diagonal Bundle Method for Nonsmooth Sparse Optimization. J. Optim. Theory Appl. 166(3): 889-905 (2015) - 2014
- [j7]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): 129-165 (2014) - 2013
- [j6]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): 459-487 (2013) - [j5]Adil M. Bagirov, L. Jin, Napsu Karmitsa, A. Al Nuaimat, Napsu Sultanova:
Subgradient Method for Nonconvex Nonsmooth Optimization. J. Optim. Theory Appl. 157(2): 416-435 (2013) - 2012
- [j4]N. M. S. Karmitsa, Adil M. Bagirov, Marko M. Mäkelä:
Comparing different nonsmooth minimization methods and software. Optim. Methods Softw. 27(1): 131-153 (2012) - 2011
- [j3]Napsu Karmitsa, Mario Tanaka Filho, José Herskovits:
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization. J. Optim. Theory Appl. 148(3): 528-549 (2011) - 2010
- [j2]Napsu Karmitsa, Marko M. Mäkelä:
Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis. Optim. Methods Softw. 25(6): 895-916 (2010) - 2008
- [j1]N. M. S. Karmitsa, Marko M. Mäkelä, M. M. Ali:
Limited memory interior point bundle method for large inequality constrained nonsmooth minimization. Appl. Math. Comput. 198(1): 382-400 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
