Linear convergence rate for the MDM algorithm for the nearest point problem

DOI10.1016/j.patcog.2014.10.015zbMath1374.68404OpenAlexW1976194862MaRDI QIDQ1678696

Peng Zhang

Publication date: 20 November 2017

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2014.10.015

zbMATH Keywords

convergencesupport vector machinesconvex hullsMDM algorithmnearest point problem\(\nu\)-SVMS

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

On the MDM method for solving the general quadratic problem of mathematical diagnostics ⋮ Unnamed Item

Uses Software

• LIBSVM
• LIBLINEAR

Cites Work

• Unnamed Item
• Unnamed Item
• Clipping algorithms for solving the nearest point problem over reduced convex hulls
• Polynomial-time decomposition algorithms for support vector machines
• An iterative algorithm learning the maximal margin classifier.
• A general soft method for learning SVM classifiers with \(L_{1}\)-norm penalty
• Dual unification of bi-class support vector machine formulations
• Unified dual for bi-class SVM approaches
• Training v-Support Vector Classifiers: Theory and Algorithms
• Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
• Finding the Point of a Polyhedron Closest to the Origin
• Downlink beamforming for DS-CDMA mobile radio with multimedia services
• Coresets for polytope distance
• Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
• A tutorial on ν‐support vector machines