Space Dilation in Polynomial-Time Perceptron Algorithms
Andriy Kharechko
In: The 4th Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2011), 16-17 Apr 2011, National Tsing Hua University, Hsinchu, Taiwan.

Abstract

This talk surveys applications of space dilation in the perceptron-like algorithms for solving systems of linear inequalities in polynomial time: from the ellipsoid algorithm to the modfied perceptron algorithm and the perceptron rescaling algorithm. It also suggests a more general version of the latter algorithm and poses an open problem about the lowest complexity of this approach.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.

[Edit]