Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
From MaRDI portal
Publication:4638918
DOI10.1080/10556788.2017.1371717zbMath1390.90436OpenAlexW2755334291MaRDI QIDQ4638918
Publication date: 2 May 2018
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2017.1371717
Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (7)
The DTC (difference of tangentially convex functions) programming: optimality conditions ⋮ Clusterwise support vector linear regression ⋮ Directional differentiability, coexhausters, codifferentials and polyhedral DC functions ⋮ Incremental DC optimization algorithm for large-scale clusterwise linear regression ⋮ An augmented subgradient method for minimizing nonsmooth DC functions ⋮ Two curve Chebyshev approximation and its application to signal clustering ⋮ Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- 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
- Introduction to Nonsmooth Optimization
- Convex analysis and global optimization
This page was built for publication: Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms