Incremental DC optimization algorithm for large-scale clusterwise linear regression

DOI10.1016/j.cam.2020.113323zbMath1460.62108OpenAlexW3116379430MaRDI QIDQ2226259

Sona Taheri, Emre Cimen, Adil M. Bagirov

Publication date: 11 February 2021

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2020.113323

zbMATH Keywords

nonsmooth optimizationregression analysisnonconvex optimizationDC optimizationclusterwise linear regression

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Linear regression; mixed models (62J05)

Related Items (2)

An augmented subgradient method for minimizing nonsmooth DC functions ⋮ Foreword to the virtual special issue dedicated to the 3rd international conference NUMTA 2019 ``Numerical computations: theory and algorithms

Uses Software

• UCI-ml
• CRIO
• LBFGS-B
• flexmix
• Algorithm 39

Cites Work

• Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization
• A maximum likelihood methodology for clusterwise linear regression
• Clusterwise PLS regression on a stochastic process
• A fast algorithm for clusterwise linear regression
• Clusterwise linear regression
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• DC programming algorithm for clusterwise linear \(L_1\) regression
• Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
• Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• An algorithm for clusterwise linear regression based on smoothing techniques
• Nonsmooth optimization algorithm for solving clusterwise linear regression problems
• Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
• Robust clusterwise linear regression through trimming
• Introduction to Nonsmooth Optimization
• Classification and Regression via Integer Optimization
• Optimization and nonsmooth analysis
• Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
• Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
• A Limited Memory Algorithm for Bound Constrained Optimization
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
• Fitting mixtures of linear regressions
• Algorithms for Generalized Clusterwise Linear Regression
• Convex analysis and global optimization

This page was built for publication: Incremental DC optimization algorithm for large-scale clusterwise linear regression