Napsu Karmitsa

According to our database, Napsu Karmitsa authored at least 22 papers between 2008 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Nonsmooth Optimization-Based Hyperparameter-Free Neural Networks for Large-Scale Regression.

Napsu Karmitsa, Sona Taheri, Kaisa Joki, Pauliina Paasivirta, Adil M. Bagirov, Marko M. Mäkelä

Algorithms, 2023

Bundle Enrichment Method for Nonsmooth Difference of Convex Programming Problems.

Manlio Gaudioso, Sona Taheri, Adil M. Bagirov, Napsu Karmitsa

Algorithms, 2023

2022

Missing Value Imputation via Clusterwise Linear Regression.

Napsu Karmitsa, Sona Taheri, Adil M. Bagirov, Pauliina Mäkinen

IEEE Trans. Knowl. Data Eng., 2022

Robust piecewise linear <i>L</i>₁-regression via nonsmooth DC optimization.

Adil M. Bagirov, Sona Taheri, Napsu Karmitsa, Nargiz Sultanova, Soodabeh Asadi

Optim. Methods Softw., 2022

2021

Aggregate subgradient method for nonsmooth DC optimization.

Adil M. Bagirov, Sona Taheri, Kaisa Joki, Napsu Karmitsa, Marko M. Mäkelä

Optim. Lett., 2021

2020

Clusterwise support vector linear regression.

Kaisa Joki, Adil M. Bagirov, Napsu Karmitsa, Marko M. Mäkelä, Sona Taheri

Eur. J. Oper. Res., 2020

Special Issue "Nonsmooth Optimization in Honor of the 60th Birthday of Adil M. Bagirov": Foreword by Guest Editors.

Napsu Karmitsa, Sona Taheri

Algorithms, 2020

2019

Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization.

Napsu Karmitsa, Manlio Gaudioso, Kaisa Joki

Optim. Methods Softw., 2019

2018

Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming.

Kaisa Joki, Adil M. Bagirov, Napsu Karmitsa, Marko M. Mäkelä, Sona Taheri

SIAM J. Optim., 2018

Clustering in large data sets with the limited memory bundle method.

Napsu Karmitsa, Adil M. Bagirov, Sona Taheri

Pattern Recognit., 2018

2017

A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes.

Kaisa Joki, Adil M. Bagirov, Napsu Karmitsa, Marko M. Mäkelä

J. Glob. Optim., 2017

Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems.

Ville-Pekka Eronen, Jan Kronqvist, Tapio Westerlund, Marko M. Mäkelä, Napsu Karmitsa

J. Glob. Optim., 2017

New diagonal bundle method for clustering problems in large data sets.

Napsu Karmitsa, Adil M. Bagirov, Sona Taheri

Eur. J. Oper. Res., 2017

2016

Testing Different Nonsmooth Formulations of the Lennard-Jones Potential in Atomic Clustering Problems.

Napsu Karmitsa

J. Optim. Theory Appl., 2016

2015

Diagonal Bundle Method for Nonsmooth Sparse Optimization.

Napsu Karmitsa

J. Optim. Theory Appl., 2015

2014

A generative model and a generalized trust region Newton method for noise reduction.

Seppo Pulkkinen, Marko M. Mäkelä, Napsu Karmitsa

Comput. Optim. Appl., 2014

2013

Subgradient Method for Nonconvex Nonsmooth Optimization.

Adil M. Bagirov, L. Jin, Napsu Karmitsa, A. Al Nuaimat, Napsu Sultanova

J. Optim. Theory Appl., 2013

A continuation approach to mode-finding of multivariate Gaussian mixtures and kernel density estimates.

Seppo Pulkkinen, Marko M. Mäkelä, Napsu Karmitsa

J. Glob. Optim., 2013

2012

Comparing different nonsmooth minimization methods and software.

N. M. S. Karmitsa, Adil M. Bagirov, Marko M. Mäkelä

Optim. Methods Softw., 2012

2011

Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization.

Napsu Karmitsa, Mario Tanaka Filho, José Herskovits

J. Optim. Theory Appl., 2011

2010

Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis.

Napsu Karmitsa, Marko M. Mäkelä

Optim. Methods Softw., 2010

2008

Limited memory interior point bundle method for large inequality constrained nonsmooth minimization.

N. M. S. Karmitsa, Marko M. Mäkelä, M. M. Ali

Appl. Math. Comput., 2008