Pages that link to "Item:Q2468369"
From MaRDI portal
The following pages link to An improved gradient projection-based decomposition technique for support vector machines (Q2468369):
Displaying 12 items.
- Nearest neighbors methods for support vector machines (Q256606) (← links)
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules (Q837553) (← links)
- Iterative regularization algorithms for constrained image deblurring on graphics processors (Q1959245) (← links)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
- A unified convergence framework for nonmonotone inexact decomposition methods (Q2301131) (← links)
- Optimal \(L_2\)-norm empirical importance weights for the change of probability measure (Q2361444) (← links)
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds (Q2492668) (← links)
- Binary separation and training support vector machines (Q2890532) (← links)
- IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS (Q3560109) (← links)
- On the convergence rate of scaled gradient projection method (Q4559401) (← links)
- (Q4998894) (← links)
- A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions (Q5348467) (← links)
