Pages that link to "Item:Q3004989"
From MaRDI portal
The following pages link to An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines (Q3004989):
Displaying 11 items.
- Nearest neighbors methods for support vector machines (Q256606) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- An affine scaling method for optimization problems with polyhedral constraints (Q742300) (← links)
- A Newton's method for the continuous quadratic knapsack problem (Q892383) (← 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 wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
- Generalized affine scaling algorithms for linear programming problems (Q2337378) (← links)
- An augmented Lagrangian affine scaling method for nonlinear programming (Q3458825) (← links)
- A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables (Q4687242) (← links)
- A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions (Q5348467) (← links)
