Online Semidefinite Programming
暂无分享,去创建一个
[1] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[2] Anupam Gupta,et al. Approximating Sparse Covering Integer Programs Online , 2014, Math. Oper. Res..
[3] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[4] Joseph Naor,et al. Online Primal-Dual Algorithms for Covering and Packing , 2009, Math. Oper. Res..
[5] Joel A. Tropp,et al. User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..
[6] Rudolf Ahlswede,et al. Strong converse for identification via quantum channels , 2000, IEEE Trans. Inf. Theory.
[7] Avi Wigderson,et al. Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications , 2006, Electron. Colloquium Comput. Complex..