General algorithmic frameworks for online problems

MaRDI QIDQ3526452zbMATH OpenFDO

Authors Alexander J. Zaslavski, Yair Censor, Simeon Reich

Publication date 25 September 2008

zbMATH Keywords

convex feasibility

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• scientific article; zbMATH DE number 1569102
• Online Regularized Classification Algorithms
• Adaptive and self-confident on-line learning algorithms
• Unified algorithms for online learning and competitive analysis
• scientific article; zbMATH DE number 5957338

Cited in

(7)

• A primal-dual perspective of online learning algorithms
• Online algorithms: a survey
• Unified algorithms for online learning and competitive analysis
• Reasoning about online algorithms with weighted automata
• Formal Analysis of Online Algorithms
• Online Algorithms for Multilevel Aggregation
• Conceptual Structures for Knowledge Creation and Communication

This page was built for publication: General algorithmic frameworks for online problems

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