A unified formulation and fast accelerated proximal gradient method for classification
From MaRDI portal
Recommendations
- A unified classification model based on robust optimization
- Proximal gradient method for huberized support vector machine
- Unified dual for bi-class SVM approaches
- Dual unification of bi-class support vector machine formulations
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
Cited in
(13)- Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination
- On the interplay between acceleration and identification for the proximal gradient algorithm
- An accelerated first-order method with complexity analysis for solving cubic regularization subproblems
- Efficient iterative method for SOAV minimization problem with linear equality and box constraints and its linear convergence
- Multi-label classification with weighted classifier selection and stacked ensemble
- Accelerated proximal gradient method for bi-modulus static elasticity
- Cubic regularization methods with second-order complexity guarantee based on a new subproblem reformulation
- Algorithm 996
- An efficient augmented Lagrangian method for support vector machine
- A unified classification model based on robust optimization
- Nesterov's accelerated Jacobi-type methods for large-scale symmetric positive semidefinite linear systems
- A unified proximal gradient method for nonconvex composite optimization with extrapolation
- Unified algorithms for distributed regularized linear regression model
This page was built for publication: A unified formulation and fast accelerated proximal gradient method for classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361279)
