Back to Results
First PageMeta Content
Operations research / Convex optimization / Linear programming / Combinatorial optimization / Computational complexity theory / Ellipsoid method / Perceptron / Mathematical optimization / Time complexity / Theoretical computer science / Applied mathematics / Mathematics


Space Dilation in Polynomial-Time Perceptron Algorithms Andriy Kharechko∗† [removed] Abstract This talk surveys applications of space dilation in the perceptron-like algorithms for solving systems of linear inequa
Add to Reading List

Document Date: 2011-11-30 10:22:02


Open Document

File Size: 122,41 KB

Share Result on Facebook

Country

Australia / /

/

Facility

University of Southampton / University of Newcastle / /

IndustryTerm

polynomial-time rescaling algorithm / latter algorithm / polynomial algorithm / ellipsoid algorithm / polynomial-time algorithm / perceptron algorithm / perceptron-like algorithms / subgradient descent algorithms / perceptron rescaling algorithm / modified perceptron algorithm / /

Organization

University of Southampton / University of Newcastle / School of Electronics and Computer Science / United Kingdom Centre for Geotechnical and Materials Modelling / /

Position

probabilistic model for information storage / /

PublishedMedium

Psychological Review / /

Technology

polynomial-time rescaling algorithm / latter algorithm / perceptron rescaling algorithm / perceptron-like algorithms / subgradient descent algorithms / perceptron algorithm / ellipsoid algorithm / modified perceptron algorithm / polynomial-time algorithm / polynomial algorithm / /

SocialTag