A primal-dual smooth perceptron-von Neumann algorithm

DOI10.1007/978-3-319-00200-2_17zbMATH Open1273.90121OpenAlexW14433305MaRDI QIDQ2849005FDOQ2849005

Javier Peña, Negar Soheili

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

Recommendations

• A smooth perceptron algorithm
• An Efficient Re-scaled Perceptron Algorithm for Conic Systems
• A simple polynomial-time rescaling algorithm for solving linear programs
• A family of linear programming algorithms based on an algorithm by von Neumann
• An efficient rescaled perceptron algorithm for conic systems

zbMATH Keywords

condition numbersmoothing techniqueperceptron algorithmvon Neumann algorithm

Mathematics Subject Classification ID

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

Cited In (6)

• A smooth perceptron algorithm
• Towards a deeper geometric, analytic and algorithmic understanding of margins
• Solving conic systems via projection and rescaling
• The Duality Between the Perceptron Algorithm and the von Neumann Algorithm
• On the von Neumann and Frank-Wolfe algorithms with away steps
• A new extension of Chubanov's method to symmetric cones

This page was built for publication: A primal-dual smooth perceptron-von Neumann algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849005)