An algorithm for clusterwise linear regression based on smoothing techniques
From MaRDI portal
Publication:2017840
DOI10.1007/s11590-014-0749-3zbMath1311.90106MaRDI QIDQ2017840
Julien Ugon, Adil M. Bagirov, Hijran G. Mirzayeva
Publication date: 23 March 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-014-0749-3
90C26: Nonconvex programming, global optimization
Related Items
Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms, DC programming algorithm for clusterwise linear \(L_1\) regression
Uses Software
Cites Work
- A maximum likelihood methodology for clusterwise linear regression
- Optimal covering of plane domains by circles via hyperbolic smoothing
- Clusterwise PLS regression on a stochastic process
- A fast algorithm for clusterwise linear regression
- Clusterwise linear regression
- Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
- Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
- The hyperbolic smoothing clustering method
- Hyperbolic smoothing function method for minimax problems