Nonsmooth optimization algorithm for solving clusterwise linear regression problems
From MaRDI portal
Publication:2342128
DOI10.1007/s10957-014-0566-yzbMath1311.65067OpenAlexW1996330238MaRDI QIDQ2342128
Hijran G. Mirzayeva, Julien Ugon, Adil M. Bagirov
Publication date: 11 May 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0566-y
Linear regression; mixed models (62J05) Numerical mathematical programming methods (65K05) Convex programming (90C25)
Related Items (6)
Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency ⋮ Clusterwise support vector linear regression ⋮ DC programming algorithm for clusterwise linear \(L_1\) regression ⋮ Incremental DC optimization algorithm for large-scale clusterwise linear regression ⋮ Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms ⋮ Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems
Uses Software
Cites Work
- Unnamed Item
- A maximum likelihood methodology for clusterwise linear regression
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Clusterwise PLS regression on a stochastic process
- A fast algorithm for clusterwise linear regression
- Clusterwise linear regression
- Continuous subdifferential approximations and their applications
- Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
- Robust clusterwise linear regression through trimming
- Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
- Optimization and nonsmooth analysis
This page was built for publication: Nonsmooth optimization algorithm for solving clusterwise linear regression problems
