DC programming algorithm for clusterwise linear \(L_1\) regression

DOI10.1007/s40305-017-0151-9zbMath1390.90437MaRDI QIDQ1706682

Sona Taheri, Adil M. Bagirov

Publication date: 28 March 2018

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-017-0151-9

zbMATH Keywords

nonsmooth optimization; smoothing; clusterwise regression; incremental algorithm

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C56: Derivative-free methods and methods using generalized derivatives

Uses Software

• UCI-ml
• Algorithm 39

Cites Work

• Unnamed Item
• Unnamed Item
• On local search in d.c. optimization problems
• A maximum likelihood methodology for clusterwise linear regression
• Clusterwise PLS regression on a stochastic process
• Algorithm: Clusterwise linear least absolute deviations regression
• A fast algorithm for clusterwise linear absolute deviations regression
• Clusterwise linear regression
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• 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
• DC programming: overview.
• 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
• Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
• Robust clusterwise linear regression through trimming
• A smoothing approach for the optimal parameter selection problem with continuous inequality constraint
• Introduction to Nonsmooth Optimization
• Convex Analysis
• Convex analysis and global optimization