Pages that link to "Item:Q5317754"
From MaRDI portal
The following pages link to Gradient projection methods for quadratic programs and applications in training support vector machines (Q5317754):
Displaying 39 items.
- GPDT (Q16965) (← links)
- Nearest neighbors methods for support vector machines (Q256606) (← links)
- A new analysis on the Barzilai-Borwein gradient method (Q457542) (← links)
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
- On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds (Q537652) (← links)
- Duality-based algorithms for total-variation-regularized image restoration (Q616786) (← links)
- A limited memory steepest descent method (Q715093) (← links)
- Some projection methods with the BB step sizes for variational inequalities (Q765311) (← links)
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules (Q837553) (← links)
- Hybrid spectral gradient method for the unconstrained minimization problem (Q839039) (← links)
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization (Q849145) (← links)
- On a gradient-based algorithm for sparse signal reconstruction in the signal/measurements domain (Q1793419) (← links)
- Iterative regularization algorithms for constrained image deblurring on graphics processors (Q1959245) (← links)
- Steplength selection in gradient projection methods for box-constrained quadratic programs (Q2009551) (← links)
- A predictor-corrector affine scaling method to train optimized extreme learning machine (Q2071232) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
- Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming (Q2156911) (← links)
- Stable equilibrium configuration of two bar truss by an efficient nonmonotone global Barzilai-Borwein gradient method in a fuzzy environment (Q2361517) (← links)
- Non-negatively constrained image deblurring with an inexact interior point method (Q2389555) (← links)
- Reconstruction of sparse signals in impulsive disturbance environments (Q2399059) (← links)
- On the steplength selection in gradient methods for unconstrained optimization (Q2422865) (← links)
- An improved gradient projection-based decomposition technique for support vector machines (Q2468369) (← links)
- Efficient optimization of support vector machine learning parameters for unbalanced datasets (Q2503014) (← links)
- A quasi-Newton method for unconstrained non-smooth problems (Q2804871) (← links)
- Binary separation and training support vector machines (Q2890532) (← links)
- Projected gradient algorithms for optimization over order simplices (Q2926073) (← links)
- IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS (Q3560109) (← links)
- On the convergence rate of scaled gradient projection method (Q4559401) (← links)
- A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables (Q4687242) (← links)
- Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds (Q5110558) (← links)
- A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions (Q5348467) (← links)
- Multiplicative Updates for Nonnegative Quadratic Programming (Q5440961) (← links)
- On the working set selection in gradient projection-based decomposition techniques for support vector machines (Q5717544) (← links)
- Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks (Q5853723) (← links)
- Combined Newton-gradient method for constrained root-finding in chemical reaction networks (Q6142077) (← links)
- On the Preconditioned Delayed Weighted Gradient Method (Q6177046) (← links)
- Delayed weighted gradient method with simultaneous step-sizes for strongly convex optimization (Q6606853) (← links)
- Barzilai–Borwein-like rules in proximal gradient schemes for ℓ <sub>1</sub> -regularized problems (Q6640996) (← links)
- An active set method for bound-constrained optimization (Q6661109) (← links)
