Pages that link to "Item:Q2226279"
From MaRDI portal
The following pages link to DCA-based algorithms for DC fitting (Q2226279):
Displaying 13 items.
- Self-organizing maps by difference of convex functions optimization (Q736509) (← links)
- DC programming and DCA for solving Brugnano-Casulli piecewise linear systems (Q1652418) (← links)
- Accelerating the DC algorithm for smooth functions (Q1749446) (← links)
- Visualizing data as objects by DC (difference of convex) optimization (Q1749447) (← links)
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA (Q1928496) (← links)
- Foreword to the virtual special issue dedicated to the 3rd international conference NUMTA 2019 ``Numerical computations: theory and algorithms'' (Q2020593) (← links)
- Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression (Q2057761) (← links)
- Alternating DC algorithm for partial DC programming problems (Q2124808) (← links)
- Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning (Q2244130) (← links)
- A difference of convex optimization algorithm for piecewise linear regression (Q2313774) (← links)
- D. c. optimization approaches via Markov models for restoration of signal (1-D) and (2-D). (Q2768051) (← links)
- Online Learning Based on Online DCA and Application to Online Classification (Q5131197) (← links)
- Block Clustering Based on Difference of Convex Functions (DC) Programming and DC Algorithms (Q5378276) (← links)
