Pages that link to "Item:Q1397416"
From MaRDI portal
The following pages link to Polynomial-time decomposition algorithms for support vector machines (Q1397416):
Displaying 10 items.
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
- Radial kernels and their reproducing kernel Hilbert spaces (Q609742) (← links)
- A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training (Q711381) (← links)
- A simple decomposition algorithm for support vector machines with polynomial-time convergence (Q885211) (← links)
- Provably fast training algorithms for support vector machines (Q927401) (← links)
- Choosing the kernel parameters for support vector machines by the inter-cluster distance in the feature space (Q1010078) (← links)
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411) (← links)
- Linear convergence rate for the MDM algorithm for the nearest point problem (Q1678696) (← links)
- On the complexity of working set selection (Q2381582) (← links)
- Binary separation and training support vector machines (Q2890532) (← links)
