Pages that link to "Item:Q5317752"
From MaRDI portal
The following pages link to On the convergence of a modified version of SVM<i><sup>light</sup></i>algorithm (Q5317752):
Displayed 15 items.
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
- On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds (Q537652) (← links)
- A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training (Q711381) (← links)
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds (Q1029281) (← links)
- Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training (Q1790674) (← links)
- Margin maximization in spherical separation (Q1928756) (← links)
- A decomposition method for Lasso problems with zero-sum constraint (Q2106751) (← links)
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems (Q2419552) (← links)
- An improved gradient projection-based decomposition technique for support vector machines (Q2468369) (← links)
- Data preprocessing in semi-supervised SVM classification (Q2996795) (← links)
- A Study on SMO Algorithm for Solving ϵ-SVR with Non-PSD Kernels (Q5299954) (← links)
- On the working set selection in gradient projection-based decomposition techniques for support vector machines (Q5717544) (← links)
- Nonlinear optimization and support vector machines (Q5915690) (← links)
- Nonlinear optimization and support vector machines (Q5918754) (← links)
- On multivariate randomized classification trees: \(l_0\)-based sparsity, VC dimension and decomposition methods (Q6109286) (← links)
