An Efficient Re-scaled Perceptron Algorithm for Conic Systems

DOI10.1007/978-3-540-72927-3_29MaRDI QIDQ5434064zbMATH OpenOpenAlexFDO

Authors A. Belloni, Robert M. Freund, Santosh S. Vempala

Publication date 3 January 2008

Published in Learning Theory (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/37304

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Linear programming (90C05)

Recommendations

• An efficient rescaled perceptron algorithm for conic systems
• A deterministic rescaled perceptron algorithm
• Solving conic systems via projection and rescaling
• A simple polynomial-time rescaling algorithm for solving linear programs
• A primal-dual smooth perceptron-von Neumann algorithm

Cited in

(8)

• A geometric analysis of Renegar's condition number, and its interplay with conic curvature
• Examples with decreasing largest inscribed ball for deterministic rescaling algorithms
• A deterministic rescaled perceptron algorithm
• A deterministic and polynomial modified perceptron algorithm
• An improved deterministic rescaling for linear programming algorithms
• Solving conic systems via projection and rescaling
• An efficient rescaled perceptron algorithm for conic systems
• A primal-dual smooth perceptron-von Neumann algorithm

This page was built for publication: An Efficient Re-scaled Perceptron Algorithm for Conic Systems

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