A Primal–Dual Smooth Perceptron–von Neumann Algorithm

DOI10.1007/978-3-319-00200-2_17zbMath1273.90121OpenAlexW14433305MaRDI QIDQ2849005

Negar Soheili, Javier F. Peña

Publication date: 13 September 2013

Published in: Discrete Geometry and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-00200-2_17

zbMATH Keywords

condition numberperceptron algorithmsmoothing techniquevon Neumann algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Methods of reduced gradient type (90C52)

Related Items (4)

Solving conic systems via projection and rescaling ⋮ A new extension of Chubanov's method to symmetric cones ⋮ On the von Neumann and Frank--Wolfe Algorithms with Away Steps ⋮ Towards a deeper geometric, analytic and algorithmic understanding of margins

This page was built for publication: A Primal–Dual Smooth Perceptron–von Neumann Algorithm