GPDT
From MaRDI portal
Software:16965
No author found.
Related Items (47)
Optimal \(L_2\)-norm empirical importance weights for the change of probability measure ⋮ Stable equilibrium configuration of two bar truss by an efficient nonmonotone global Barzilai-Borwein gradient method in a fuzzy environment ⋮ Two new decomposition algorithms for training bound-constrained support vector machines ⋮ Binary separation and training support vector machines ⋮ Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules ⋮ Hybrid spectral gradient method for the unconstrained minimization problem ⋮ LMBOPT: a limited memory method for bound-constrained optimization ⋮ Regularized multiple criteria linear programs for classification ⋮ Partial spectral projected gradient method with active-set strategy for linearly constrained optimization ⋮ Gradient methods with adaptive step-sizes ⋮ Non-negatively constrained image deblurring with an inexact interior point method ⋮ On the convergence rate of scaled gradient projection method ⋮ Reconstruction of sparse signals in impulsive disturbance environments ⋮ Duality-based algorithms for total-variation-regularized image restoration ⋮ A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions ⋮ On the steplength selection in gradient methods for unconstrained optimization ⋮ Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds ⋮ Iterative regularization algorithms for constrained image deblurring on graphics processors ⋮ A new analysis on the Barzilai-Borwein gradient method ⋮ The 2-coordinate descent method for solving double-sided simplex constrained minimization problems ⋮ Unnamed Item ⋮ An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines ⋮ An improved gradient projection-based decomposition technique for support vector machines ⋮ 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 ⋮ Steplength selection in gradient projection methods for box-constrained quadratic programs ⋮ Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming ⋮ New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds ⋮ A scaled gradient projection method for constrained image deblurring ⋮ Nonlinear optimization and support vector machines ⋮ Efficient optimization of support vector machine learning parameters for unbalanced datasets ⋮ A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables ⋮ Nonlinear optimization and support vector machines ⋮ Unnamed Item ⋮ Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training ⋮ On a gradient-based algorithm for sparse signal reconstruction in the signal/measurements domain ⋮ Unnamed Item ⋮ A unified convergence framework for nonmonotone inexact decomposition methods ⋮ A parallel decomposition algorithm for training multiclass kernel-based vector machines ⋮ Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds ⋮ Some projection methods with the BB step sizes for variational inequalities ⋮ A predictor-corrector affine scaling method to train optimized extreme learning machine ⋮ Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks ⋮ A \textit{fingerprint} of a heterogeneous data set ⋮ A New Active Set Algorithm for Box Constrained Optimization ⋮ Nearest neighbors methods for support vector machines ⋮ On the convergence of inexact block coordinate descent methods for constrained optimization
This page was built for software: GPDT
