Pages that link to "Item:Q2342128"
From MaRDI portal
The following pages link to Nonsmooth optimization algorithm for solving clusterwise linear regression problems (Q2342128):
Displaying 11 items.
- Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization (Q288987) (← links)
- Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems (Q727242) (← links)
- Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency (Q1626531) (← links)
- DC programming algorithm for clusterwise linear \(L_1\) regression (Q1706682) (← links)
- Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression (Q1761225) (← links)
- An algorithm for clusterwise linear regression based on smoothing techniques (Q2017840) (← links)
- Clusterwise support vector linear regression (Q2189912) (← links)
- Incremental DC optimization algorithm for large-scale clusterwise linear regression (Q2226259) (← links)
- Nonsmooth nonconvex optimization approach to clusterwise linear regression problems (Q2355817) (← links)
- Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms (Q4638918) (← links)
- Algorithms for Generalized Clusterwise Linear Regression (Q5364278) (← links)