Approximate Structured Optimization by Cyclic Block-Coordinate Descent
暂无分享,去创建一个
[1] Egon Balas,et al. An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..
[2] Robert R. Meyer,et al. An Interior Point Method for Block Angular Optimization , 1991, SIAM J. Optim..
[3] Martin Dyer,et al. AN O(n) ALGORITHM FOR THE MULTIPLE-CHOICE , 2007 .
[4] Andrew V. Goldberg. A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms , 1992, Inf. Process. Lett..
[5] Norman Zadeh. Note---A Note on the Cyclic Coordinate Ascent Method , 1970 .
[6] Nimrod Megiddo,et al. Linear time algorithms for some separable quadratic programming problems , 1993, Oper. Res. Lett..
[7] Farhad Shahrokhi,et al. The maximum concurrent flow problem , 1990, JACM.
[8] Leonid Khachiyan,et al. Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints , 1994, SIAM J. Optim..
[9] Eugene L. Lawler,et al. On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming , 1978, JACM.
[10] Fillia Makedon,et al. Fast Approximation Algorithms for Multicommodity Flow Problems , 1995, J. Comput. Syst. Sci..
[11] Tomasz Radzik. Fast deterministic approximation for the multicommodity flow problem , 1995, SODA '95.
[12] Leonid Khachiyan,et al. Coordination Complexity of Parallel Price-Directive Decomposition , 1996, Math. Oper. Res..
[13] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[14] Leonid Khachiyan,et al. Approximate minimum-cost multicommodity flows in $$\tilde O$$ (ɛ−2KNM) timetime , 1996, Math. Program..
[15] Éva Tardos,et al. Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.