{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T04:18:15Z","timestamp":1783311495677,"version":"3.54.6"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T00:00:00Z","timestamp":1528761600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T00:00:00Z","timestamp":1528761600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1409204"],"award-info":[{"award-number":["1409204"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-12-1-1002"],"award-info":[{"award-number":["N00014-12-1-1002"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10107-018-1305-1","type":"journal-article","created":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T14:42:16Z","timestamp":1528814536000},"page":"267-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Competitive online algorithms for resource allocation over the positive semidefinite cone"],"prefix":"10.1007","volume":"170","author":[{"given":"Reza","family":"Eghbali","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Saunderson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maryam","family":"Fazel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"key":"1305_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Devanur, N.R.: Fast algorithms for online stochastic convex programming. In: Proceedings of the Twenty-Sixth Annual Symposium on Discrete Algorithms, pp. 1405\u20131424. SIAM (2015)","DOI":"10.1137\/1.9781611973730.93"},{"issue":"4","key":"1305_CR2","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1287\/opre.2014.1289","volume":"62","author":"S Agrawal","year":"2014","unstructured":"Agrawal, S., Wang, Z., Ye, Y.: A dynamic near-optimal algorithm for online linear programming. Oper. Res. 62(4), 876\u2013890 (2014)","journal-title":"Oper. Res."},{"key":"1305_CR3","doi-asserted-by":"crossref","unstructured":"Azar, Y., Buchbinder, N., Chan, T.H., Chen, S., Cohen, I.R., Gupta, A., Huang, Z., Kang, N., Nagarajan, V., Naor, J., et al: Online algorithms for covering and packing problems with convex objectives. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 148\u2013157. IEEE (2016)","DOI":"10.1109\/FOCS.2016.24"},{"key":"1305_CR4","unstructured":"Bian, A.A., Buhmann, J.M., Krause, A., Tschiatschek, S.: Guarantees for greedy maximization of non-submodular functions with applications (2017). \n                    arXiv:1703.02100"},{"key":"1305_CR5","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1016\/j.endm.2010.05.086","volume":"36","author":"M Bouhtou","year":"2010","unstructured":"Bouhtou, M., Gaubert, S., Sagnol, G.: Submodularity and randomized rounding techniques for optimal experimental design. Electron. Discret. Math. 36, 679\u2013686 (2010)","journal-title":"Electron. Discret. Math."},{"key":"1305_CR6","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Naor, J.: Improved bounds for online routing and packing via a primal-dual approach. In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906), pp. 293\u2013304. IEEE (2006)","DOI":"10.1109\/FOCS.2006.39"},{"issue":"2","key":"1305_CR7","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1287\/moor.1080.0363","volume":"34","author":"N Buchbinder","year":"2009","unstructured":"Buchbinder, N., Naor, J.: Online primal-dual algorithms for covering and packing. Math. Oper. Res. 34(2), 270\u2013286 (2009)","journal-title":"Math. Oper. Res."},{"issue":"2\u20133","key":"1305_CR8","first-page":"93","volume":"3","author":"N Buchbinder","year":"2009","unstructured":"Buchbinder, N., Naor, J.S.: The design of competitive online algorithms via a primal-dual approach Foundations and Trends\u00ae. Theor. Comput. Sci. 3(2\u20133), 93\u2013263 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"1305_CR9","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Jain, K., Naor, J.S.: Online primal-dual algorithms for maximizing ad-auctions revenue. In: Algorithms\u2013ESA 2007, pp. 253\u2013264. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-75520-3_24"},{"key":"1305_CR10","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Jain, K.: Online matching with concave returns. In: Proceedings of the forty-fourth annual ACM symposium on theory of computing (STOC), pp. 137\u2013144. ACM (2012)","DOI":"10.1145\/2213977.2213992"},{"key":"1305_CR11","volume-title":"Some Gronwall Type Inequalities and Applications","author":"SS Dragomir","year":"2003","unstructured":"Dragomir, S.S.: Some Gronwall Type Inequalities and Applications. Nova Science, New York (2003)"},{"key":"1305_CR12","unstructured":"Eghbali, R.: Online algorithm design via smoothing with application to online experiment selection. Ph.D. thesis, The University of Washington (2017)"},{"key":"1305_CR13","doi-asserted-by":"crossref","unstructured":"Eghbali, R., Fazel, M.: Designing smoothing functions for improved worst-case competitive ratio in online optimization. In: Advances in Neural Information Processing Systems, pp. 3279\u20133287 (2016)","DOI":"10.1109\/CDC.2016.7798549"},{"key":"1305_CR14","unstructured":"Eghbali, R., Fazel, M.: Worst case competitive analysis of online algorithms for conic optimization (2016). \n                    arXiv:1611.00507"},{"key":"1305_CR15","unstructured":"Eghbali, R., Swenson, J., Fazel, M.: Exponentiated subgradient algorithm for online optimization under the random permutation model (2014). \n                    arXiv:1410.7171"},{"key":"1305_CR16","unstructured":"Elad, N., Kale, S., Naor, J.S.: Online semidefinite programming. In: LIPIcs-Leibniz International Proceedings in Informatics, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, vol.\u00a055 (2016)"},{"issue":"4","key":"1305_CR17","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1287\/moor.2016.0782","volume":"41","author":"A Gupta","year":"2016","unstructured":"Gupta, A., Molinaro, M.: How the experts algorithm can help solve LPs online. Math. Oper. Res. 41(4), 1404\u20131431 (2016)","journal-title":"Math. Oper. Res."},{"issue":"11","key":"1305_CR18","doi-asserted-by":"publisher","first-page":"4557","DOI":"10.1016\/j.laa.2013.01.022","volume":"438","author":"F Hansen","year":"2013","unstructured":"Hansen, F.: The fast track to L\u00f6wners theorem. Linear Algebra Appl. 438(11), 4557\u20134571 (2013)","journal-title":"Linear Algebra Appl."},{"key":"1305_CR19","doi-asserted-by":"crossref","unstructured":"Kapralov, M., Post, I., Vondr\u00e1k, J.: Online submodular welfare maximization: greedy is optimal. In: Proceedings of the Twenty-Fourth Annual Symposium on Discrete Algorithms, pp. 1216\u20131225.SIAM (2013)","DOI":"10.1137\/1.9781611973105.88"},{"key":"1305_CR20","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.cor.2016.05.004","volume":"75","author":"A Legrain","year":"2016","unstructured":"Legrain, A., Jaillet, P.: A stochastic algorithm for online bipartite resource allocation problems. Comput. Oper. Res. 75, 28\u201337 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"1305_CR21","first-page":"173","volume":"2","author":"AS Lewis","year":"1995","unstructured":"Lewis, A.S.: The convex analysis of unitarily invariant matrix functions. J. Convex Anal. 2(1), 173\u2013183 (1995)","journal-title":"J. Convex Anal."},{"issue":"5","key":"1305_CR22","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/1284320.1284321","volume":"54","author":"A Mehta","year":"2007","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. J. ACM 54(5), 22 (2007)","journal-title":"J. ACM"},{"key":"1305_CR23","doi-asserted-by":"crossref","unstructured":"Meng, D., Fazel, M., Mesbahi, M.: Online algorithms for network formation. In: IEEE Conference on Decision and Control (CDC), pp. 135\u2013140 (2016)","DOI":"10.1109\/CDC.2016.7798259"},{"issue":"1","key":"1305_CR24","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1287\/moor.2013.0612","volume":"39","author":"M Molinaro","year":"2013","unstructured":"Molinaro, M., Ravi, R.: The geometry of online packing linear programs. Math. Oper. Res. 39(1), 46\u201359 (2013)","journal-title":"Math. Oper. Res."},{"key":"1305_CR25","volume-title":"Optimal Design of Experiments","author":"F Pukelsheim","year":"1993","unstructured":"Pukelsheim, F.: Optimal Design of Experiments, vol. 50. SIAM, Philadelphia (1993)"},{"key":"1305_CR26","first-page":"1","volume":"161","author":"A Reiz","year":"1943","unstructured":"Reiz, A.: On the numerical solution of certain types of integral equations. Medd. Fran Lunds Astrono. Obs. Ser. I 161, 1\u201321 (1943)","journal-title":"Medd. Fran Lunds Astrono. Obs. Ser. I"},{"key":"1305_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.B., Wets, M.: Variational Analysis, vol. 317. Springer, Berlin (1998)"},{"key":"1305_CR28","unstructured":"Seeger, M.: On the submodularity of linear experimental design. Tech. rep., Saarland University (2009)"},{"issue":"2\u20133","key":"1305_CR29","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10994-007-5014-x","volume":"69","author":"S Shalev-Shwartz","year":"2007","unstructured":"Shalev-Shwartz, S., Singer, Y.: A primal-dual perspective of online learning algorithms. Mach. Learn. 69(2\u20133), 115\u2013142 (2007)","journal-title":"Mach. Learn."},{"key":"1305_CR30","doi-asserted-by":"crossref","unstructured":"Shamaiah, M., Banerjee, S., Vikalo, H.: Greedy sensor selection: Leveraging submodularity. In: 49th IEEE Conference on Decision and Control (CDC), pp. 2572\u20132577. IEEE (2010)","DOI":"10.1109\/CDC.2010.5717225"},{"key":"1305_CR31","unstructured":"Wang, Y., Yu, A.W., Singh, A.: On computationally tractable selection of experiments in regression models (2016). \n                    arXiv:1601.02068"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1305-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1305-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1305-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:24:34Z","timestamp":1589646274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1305-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,12]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1305"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1305-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,12]]},"assertion":[{"value":"2 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}