An improved gradient projection-based decomposition technique for support vector machines
From MaRDI portal
Publication:2468369
DOI10.1007/s10287-005-0004-6zbMath1163.90693OpenAlexW2072036782MaRDI QIDQ2468369
Publication date: 22 January 2008
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-005-0004-6
support vector machineslarge-scale problemsdecomposition techniquesquadratic programsgradient projection methods
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Quadratic programming (90C20) Methods of reduced gradient type (90C52)
Related Items
Optimal \(L_2\)-norm empirical importance weights for the change of probability measure, Binary separation and training support vector machines, Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules, A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints, On the convergence rate of scaled gradient projection method, A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions, Unnamed Item, Iterative regularization algorithms for constrained image deblurring on graphics processors, IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS, New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds, A unified convergence framework for nonmonotone inexact decomposition methods, Nearest neighbors methods for support vector machines
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A numerically stable dual method for solving strictly convex quadratic programs
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- A modified projection algorithm for large strictly-convex quadratic programs
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- 10.1162/15324430152733142
- Two-Point Step Size Gradient Methods
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique for Newton’s Method
- Improvements to Platt's SMO Algorithm for SVM Classifier Design
- On the convergence of a modified version of SVMlightalgorithm
- Gradient projection methods for quadratic programs and applications in training support vector machines
- On the working set selection in gradient projection-based decomposition techniques for support vector machines
- A simple decomposition method for support vector machines
- Convergence of a generalized SMO algorithm for SVM classifier design
