Competitive online algorithms for resource allocation over the positive semidefinite cone

DOI10.1007/s10107-018-1305-1zbMath1396.68136arXiv1802.01312OpenAlexW2786877223MaRDI QIDQ1650777

Maryam Fazel, Reza Eghbali, James Saunderson

Publication date: 13 July 2018

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.01312

zbMATH Keywords

online algorithmscompetitive ratioLöwner's theorempositive semidefinite cone

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Convex programming (90C25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A stochastic algorithm for online bipartite resource allocation problems
• The fast track to Löwner's theorem
• A primal-dual perspective of online learning algorithms
• How the Experts Algorithm Can Help Solve LPs Online
• Geometry of Online Packing Linear Programs
• Submodularity and Randomized rounding techniques for Optimal Experimental Design
• A Dynamic Near-Optimal Algorithm for Online Linear Programming
• Online Primal-Dual Algorithms for Covering and Packing
• Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
• AdWords and generalized online matching
• The Design of Competitive Online Algorithms via a Primal—Dual Approach
• Variational Analysis
• Online Semidefinite Programming.
• Fast Algorithms for Online Stochastic Convex Programming
• Online matching with concave returns
• Online submodular welfare maximization: Greedy is optimal

This page was built for publication: Competitive online algorithms for resource allocation over the positive semidefinite cone