GPDT
From MaRDI portal
Cited in
(62)- 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
- A \textit{fingerprint} of a heterogeneous data set
- Nonlinear optimization and support vector machines
- Nonlinear optimization and support vector machines
- 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
- Hybrid MPI/OpenMP parallel linear support vector machine training
- 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
- Regularized multiple criteria linear programs for classification
- 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
- 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
- SPG
- GEMM
- SVMlight
- CONV_QP
- Kernel-Machines
- TRON
- MINQ
- bmrm
- QL
- SVMTorch
- SSVM
- On the working set selection in gradient projection-based decomposition techniques for support vector machines
- SPIRAL
- 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
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
- An improved gradient projection-based decomposition technique for support vector machines
- Iterative regularization algorithms for constrained image deblurring on graphics processors
- Optimal \(L_2\)-norm empirical importance weights for the change of probability measure
- Fast iterative kernel principal component analysis
- Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training
- Some projection methods with the BB step sizes for variational inequalities
- Non-negatively constrained image deblurring with an inexact interior point method
- BOX-QUACAN
- An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines
- LMBOPT: a limited memory method for bound-constrained optimization
- Efficient optimization of support vector machine learning parameters for unbalanced datasets
- 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
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- A parallel decomposition algorithm for training multiclass kernel-based vector machines
- Spectral properties of Barzilai-Borwein rules in solving singly linearly constrained optimization problems subject to lower and upper bounds
- The interplay of optimization and machine learning research
- MINQ8
- A reduced-space algorithm for minimizing \(\ell_1\)-regularized convex functions
This page was built for software: GPDT
