Gradient projection methods for quadratic programs and applications in training support vector machines
From MaRDI portal
Publication:5317754
Recommendations
- scientific article; zbMATH DE number 2110305
- On the use of the spectral projected gradient method for support vector machines
- Fast projected gradient method for support vector machines
- A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training
- Proximal gradient method for huberized support vector machine
- scientific article; zbMATH DE number 1974617
- A coordinate gradient descent algorithm for support vector machines training
- An improved gradient projection-based decomposition technique for support vector machines
- Convex optimization of support vector machines
- scientific article; zbMATH DE number 3880458
Cites work
- A Nonmonotone Line Search Technique for Newton’s Method
- A modified projection algorithm for large strictly-convex quadratic programs
- A simple decomposition method for support vector machines
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- An introduction to support vector machines and other kernel-based learning methods.
- Efficient SVM regression training with SMO
- Gradient Method with Retards and Generalizations
- Interior-Point Methods for Massive Support Vector Machines
- Modified two-point stepsize gradient methods for unconstrained optimization
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- SVMTorch: Support vector machines for large-scale regression problems.
- Two-Point Step Size Gradient Methods
- \(R\)-linear convergence of the Barzilai and Borwein gradient method
Cited in
(45)- Stable equilibrium configuration of two bar truss by an efficient nonmonotone global Barzilai-Borwein gradient method in a fuzzy environment
- A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables
- Nearest neighbors methods for support vector machines
- IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS
- scientific article; zbMATH DE number 2110305 (Why is no real title available?)
- Hybrid spectral gradient method for the unconstrained minimization problem
- Combined Newton-gradient method for constrained root-finding in chemical reaction networks
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
- Reconstruction of sparse signals in impulsive disturbance environments
- On a gradient-based algorithm for sparse signal reconstruction in the signal/measurements domain
- scientific article; zbMATH DE number 1974617 (Why is no real title available?)
- Multiplicative Updates for Nonnegative Quadratic Programming
- Duality-based algorithms for total-variation-regularized image restoration
- On the convergence rate of scaled gradient projection method
- Steplength selection in gradient projection methods for box-constrained quadratic programs
- The application of an oblique-projected Landweber method to a model of supervised learning
- A limited memory steepest descent method
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
- Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming
- Projected gradient algorithms for optimization over order simplices
- Classification and Regression Using an Outer Approximation Projection-Gradient Method
- A quasi-Newton method for unconstrained non-smooth problems
- A new analysis on the Barzilai-Borwein gradient method
- Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
- Delayed weighted gradient method with simultaneous step-sizes for strongly convex optimization
- On the Preconditioned Delayed Weighted Gradient Method
- GPDT
- On the working set selection in gradient projection-based decomposition techniques for support vector machines
- On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- On the steplength selection in gradient methods for unconstrained optimization
- An improved gradient projection-based decomposition technique for support vector machines
- Iterative regularization algorithms for constrained image deblurring on graphics processors
- Some projection methods with the BB step sizes for variational inequalities
- Non-negatively constrained image deblurring with an inexact interior point method
- LMBOPT: a limited memory method for bound-constrained optimization
- Efficient optimization of support vector machine learning parameters for unbalanced datasets
- Binary separation and training support vector machines
- A predictor-corrector affine scaling method to train optimized extreme learning machine
- An active set method for bound-constrained optimization
- On the use of the spectral projected gradient method for support vector machines
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Spectral properties of Barzilai-Borwein rules in solving singly linearly constrained optimization problems subject to lower and upper bounds
- A reduced-space algorithm for minimizing \(\ell_1\)-regularized convex functions
- Barzilai–Borwein-like rules in proximal gradient schemes for ℓ 1 -regularized problems
Describes a project that uses
Uses Software
This page was built for publication: Gradient projection methods for quadratic programs and applications in training support vector machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317754)
