Interior-Point Methods for Massive Support Vector Machines
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2110305
- Semismooth support vector machines.
- Using an iterative linear solver in an interior-point method for generating support vector machines
- An efficient support vector machine learning method with second-order cone programming for large-scale problems
- An efficient implementation of an active set method for SVMs
Cited in
(36)- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
- High dimensional data classification and feature selection using support vector machines
- Cutting-plane training of structural SVMs
- A predictor-corrector affine scaling method to train optimized extreme learning machine
- Exploiting structure in parallel implementation of interior point methods for optimization
- A matrix-free smoothing algorithm for large-scale support vector machines
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- Fast projected gradient method for support vector machines
- Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
- A convergent decomposition algorithm for support vector machines
- Nearest neighbors methods for support vector machines
- An efficient support vector machine learning method with second-order cone programming for large-scale problems
- Clustering-based preconditioning for stochastic programs
- Binary separation and training support vector machines
- An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines
- Introduction to support vector machines and their applications in bankruptcy prognosis
- Supervised classification and mathematical optimization
- Matrix-free interior point method
- Adaptive constraint reduction for convex quadratic programming
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- PNKH-B: A Projected Newton--Krylov Method for Large-Scale Bound-Constrained Optimization
- Gradient projection methods for quadratic programs and applications in training support vector machines
- Exploiting separability in large-scale linear support vector machine training
- Nonlinear optimization and support vector machines
- Nonlinear optimization and support vector machines
- The profitability of online loans: a competing risks analysis on default and prepayment
- Using an iterative linear solver in an interior-point method for generating support vector machines
- Penalized spline support vector classifiers computational issues
- New interior-point approach for one- and two-class linear support vector machines using multiple variable splitting
- A rank-one-update method for the training of support vector machines
- Iterative regularization in classification via hinge loss diagonal descent
- Semismooth support vector machines.
- A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training
- Convoluted support matrix machine in high dimensions
- Global resolution of the support vector machine regression parameters selection problem with LPCC
- Regularized multiple criteria linear programs for classification
This page was built for publication: Interior-Point Methods for Massive Support Vector Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4441923)