A deterministic rescaled perceptron algorithm
DOI10.1007/S10107-015-0860-YzbMATH Open1332.90202OpenAlexW2009932696MaRDI QIDQ5962726FDOQ5962726
Authors: Javier Peña, Negar Soheili 
Publication date: 23 February 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-015-0860-y
Recommendations
- An efficient rescaled perceptron algorithm for conic systems
- An Efficient Re-scaled Perceptron Algorithm for Conic Systems
- A simple polynomial-time rescaling algorithm for solving linear programs
- Examples with decreasing largest inscribed ball for deterministic rescaling algorithms
- A deterministic and polynomial modified perceptron algorithm
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Cites Work
- Pegasos: primal estimated sub-gradient solver for SVM
- Adaptive restart for accelerated gradient schemes
- Large margin classification using the perceptron algorithm
- Title not available (Why is that?)
- Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
- On the non-polynomiality of the relaxation method for systems of linear inequalities
- A simple polynomial-time rescaling algorithm for solving linear programs
- Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
- A strongly polynomial algorithm for linear systems having a binary solution
- A polynomial-time algorithm for learning noisy linear threshold functions
- The Relaxation Method for Solving Systems of Linear Inequalities
- A smooth perceptron algorithm
- The Perceptron: A Model for Brain Functioning. I
- An efficient rescaled perceptron algorithm for conic systems
- Boundedness Theorems for the Relaxation Method
Cited In (13)
- Learning Theory
- Rescaled Coordinate Descent Methods for Linear Programming
- A smooth perceptron algorithm
- Rescaling Algorithms for Linear Conic Feasibility
- Computational performance of a projection and rescaling algorithm
- Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
- An Efficient Re-scaled Perceptron Algorithm for Conic Systems
- Implementation of a projection and rescaling algorithm for second-order conic feasibility problems
- Examples with decreasing largest inscribed ball for deterministic rescaling algorithms
- A deterministic and polynomial modified perceptron algorithm
- Solving conic systems via projection and rescaling
- An efficient rescaled perceptron algorithm for conic systems
- Geometric Rescaling Algorithms for Submodular Function Minimization
Uses Software
This page was built for publication: A deterministic rescaled perceptron algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962726)
