The Duality Between the Perceptron Algorithm and the von Neumann Algorithm

DOI10.1007/978-1-4614-8987-0_5zbMath1305.49045OpenAlexW2183817373MaRDI QIDQ5172960

Dan Li, Tamás Terlaky

Publication date: 6 February 2015

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-8987-0_5

zbMATH Keywords

dualityperceptron algorithmlinear feasibility problemvon Neumann algorithmApproximate Farkas Lemma

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Duality theory (optimization) (49N15)

Related Items (5)

Examples with decreasing largest inscribed ball for deterministic rescaling algorithms ⋮ On Chubanov’s Method for Solving a Homogeneous Inequality System ⋮ Rescaling Algorithms for Linear Conic Feasibility ⋮ An improved version of Chubanov's method for solving a homogeneous feasibility problem ⋮ On the von Neumann and Frank--Wolfe Algorithms with Away Steps

This page was built for publication: The Duality Between the Perceptron Algorithm and the von Neumann Algorithm