GPDT

swMATH4803MaRDI QIDQ16965FDOQ16965

Author name not available (Why is that?)

Official website: http://dm.unife.it/gpdt/

Described by source

• Parallel software for training large scale support vector machines on multiprocessor systems
• Gradient projection methods for quadratic programs and applications in training support vector machines

Cited In (59)

• Nearest neighbors methods for support vector machines
• Nonlinear optimization and support vector machines
• Nonlinear optimization and support vector machines
• A \textit{fingerprint} of a heterogeneous data set
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• Hybrid spectral gradient method for the unconstrained minimization problem
• Two new decomposition algorithms for training bound-constrained support vector machines
• MINQ8
• Hybrid MPI/OpenMP parallel linear support vector machine training
• Reconstruction of sparse signals in impulsive disturbance environments
• The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
• On a gradient-based algorithm for sparse signal reconstruction in the signal/measurements domain
• On the convergence rate of scaled gradient projection method
• Regularized multiple criteria linear programs for classification
• BOX-QUACAN
• Duality-based algorithms for total-variation-regularized image restoration
• Steplength selection in gradient projection methods for box-constrained quadratic programs
• Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
• A new analysis on the Barzilai-Borwein gradient method
• Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
• Gradient methods with adaptive step-sizes
• 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
• On the steplength selection in gradient methods for unconstrained optimization
• Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
• An improved gradient projection-based decomposition technique for support vector machines
• Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
• CONV_QP
• Kernel-Machines
• TRON
• MINQ
• bmrm
• Optimal \(L_2\)-norm empirical importance weights for the change of probability measure
• QL
• SVMTorch
• SSVM
• Iterative regularization algorithms for constrained image deblurring on graphics processors
• Fast iterative kernel principal component analysis
• Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training
• SPIRAL
• Non-negatively constrained image deblurring with an inexact interior point method
• Some projection methods with the BB step sizes for variational inequalities
• An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines
• Efficient optimization of support vector machine learning parameters for unbalanced datasets
• LMBOPT: a limited memory method for bound-constrained optimization
• A scaled gradient projection method for constrained image deblurring
• LMBOPT
• Binary separation and training support vector machines
• A predictor-corrector affine scaling method to train optimized extreme learning machine
• A New Active Set Algorithm for Box Constrained Optimization
• A unified convergence framework for nonmonotone inexact decomposition methods
• On the convergence of inexact block coordinate descent methods for constrained optimization
• Spectral properties of Barzilai-Borwein rules in solving singly linearly constrained optimization problems subject to lower and upper bounds
• A parallel decomposition algorithm for training multiclass kernel-based vector machines
• New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
• The interplay of optimization and machine learning research
• A reduced-space algorithm for minimizing \(\ell_1\)-regularized convex functions
• A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables
• Stable equilibrium configuration of two bar truss by an efficient nonmonotone global Barzilai-Borwein gradient method in a fuzzy environment

This page was built for software: GPDT