暂无分享,去创建一个
[1] Yoram Singer,et al. On‐Line Portfolio Selection Using Multiplicative Updates , 1998, ICML.
[2] M. Sion. On general minimax theorems , 1958 .
[3] Sanjeev Arora,et al. Fast algorithms for approximate semidefinite programming using the multiplicative weights update method , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[4] Hsueh-I Lu,et al. Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING , 1996, STOC '96.
[5] Daniel Bienstock,et al. Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice , 2002 .
[6] Elad Hazan,et al. Logarithmic regret algorithms for online convex optimization , 2006, Machine Learning.
[7] Eran Halperin,et al. HAPLOFREQ-Estimating Haplotype Frequencies Efficiently , 2006, J. Comput. Biol..
[8] Lisa Fleischer,et al. Approximating Fractional Multicommodity Flow Independent of the Number of Commodities , 2000, SIAM J. Discret. Math..
[9] Daniel Bienstock,et al. Solving fractional packing problems in Oast(1/ε) iterations , 2004, STOC '04.
[10] Manfred K. Warmuth,et al. The Weighted Majority Algorithm , 1994, Inf. Comput..
[11] Tong Zhang,et al. Sequential greedy approximation for certain convex optimization problems , 2003, IEEE Trans. Inf. Theory.
[12] R. Khandekar. Lagrangian relaxation based algorithms for convex programming problems , 2004 .
[13] Neal E. Young,et al. Randomized rounding without solving the linear program , 1995, SODA '95.
[14] Martin Zinkevich,et al. Online Convex Programming and Generalized Infinitesimal Gradient Ascent , 2003, ICML.
[15] Leonid Khachiyan,et al. Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints , 1994, SIAM J. Optim..
[16] Klaus Jansen. Approximation Algorithm for the Mixed Fractional Packing and Covering Problem , 2006, SIAM J. Optim..
[17] Stephen P. Boyd,et al. Applications of second-order cone programming , 1998 .
[18] Jochen Könemann,et al. Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[19] T. Cover. Universal Portfolios , 1996 .
[20] Philip Wolfe,et al. An algorithm for quadratic programming , 1956 .
[21] Philip N. Klein,et al. Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts , 1994, SIAM J. Comput..
[22] Leonid Khachiyan,et al. A sublinear-time randomized approximation algorithm for matrix games , 1995, Oper. Res. Lett..
[23] Yurii Nesterov,et al. Rounding of convex sets and efficient gradient methods for linear programming problems , 2004, Optim. Methods Softw..
[24] Farhad Shahrokhi,et al. The maximum concurrent flow problem , 1990, JACM.
[25] S. Hart,et al. A simple adaptive procedure leading to correlated equilibrium , 2000 .
[26] Fillia Makedon,et al. Fast approximation algorithms for multicommodity flow problems , 1991, STOC '91.
[27] Y. Freund,et al. Adaptive game playing using multiplicative weights , 1999 .
[28] Elad Hazan,et al. Efficient Algorithms for Online Game Playing and Universal Portfolio Management , 2006, Electron. Colloquium Comput. Complex..
[29] Miroslav Dudík,et al. Maximum Entropy Distribution Estimation with Generalized Regularization , 2006, COLT.
[30] Éva Tardos,et al. Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[31] Philip N. Klein,et al. On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms , 1999, SIAM J. Comput..
[32] Manfred K. Warmuth,et al. Exponentiated Gradient Versus Gradient Descent for Linear Predictors , 1997, Inf. Comput..
[33] Santosh S. Vempala,et al. A simple polynomial-time rescaling algorithm for solving linear programs , 2004, STOC '04.