Incremental DC optimization algorithm for large-scale clusterwise linear regression
From MaRDI portal
Publication:2226259
Recommendations
- Nonsmooth optimization algorithm for solving clusterwise linear regression problems
- Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
- DC programming algorithm for clusterwise linear \(L_1\) regression
- An algorithm for clusterwise linear regression based on smoothing techniques
- Clusterwise support vector linear regression
Cites work
- A fast algorithm for clusterwise linear regression
- A Limited Memory Algorithm for Bound Constrained Optimization
- A maximum likelihood methodology for clusterwise linear regression
- Algorithms for Generalized Clusterwise Linear Regression
- An algorithm for clusterwise linear regression based on smoothing techniques
- Classification and Regression via Integer Optimization
- Clusterwise linear regression
- Clusterwise PLS regression on a stochastic process
- Convex analysis and global optimization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming algorithm for clusterwise linear \(L_1\) regression
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
- Fitting mixtures of linear regressions
- Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization
- Introduction to nonsmooth optimization. Theory, practice and software
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
- Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
- Nonsmooth optimization algorithm for solving clusterwise linear regression problems
- Optimization and nonsmooth analysis
- Robust clusterwise linear regression through trimming
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
Cited in
(11)- DC programming algorithm for clusterwise linear \(L_1\) regression
- An algorithm for clusterwise linear regression based on smoothing techniques
- Foreword to the virtual special issue dedicated to the 3rd international conference NUMTA 2019 ``Numerical computations: theory and algorithms
- A novel heuristic algorithm to solve penalized regression-based clustering model
- Clusterwise support vector linear regression
- An augmented subgradient method for minimizing nonsmooth DC functions
- Nonsmooth optimization algorithm for solving clusterwise linear regression problems
- Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
- Minimizing differences of convex functions with applications to facility location and clustering
- Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
- A truncated -subdifferential method for global DC optimization
This page was built for publication: Incremental DC optimization algorithm for large-scale clusterwise linear regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2226259)