Fast projected gradient method for support vector machines
From MaRDI portal
Publication:2358069
DOI10.1007/s11081-016-9328-zzbMath1364.68319OpenAlexW2517571260MaRDI QIDQ2358069
Fabio Quijada, Veronica Bloom, Igor A. Griva
Publication date: 21 June 2017
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-016-9328-z
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An interior-point algorithm for nonconvex nonlinear programming
- Introductory lectures on convex optimization. A basic course.
- Dual fast projected gradient method for quadratic programming
- 1.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization
- Multiplier and gradient methods
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Interior-Point Methods for Massive Support Vector Machines
This page was built for publication: Fast projected gradient method for support vector machines