Approximate Structured Optimization by Cyclic Block-Coordinate Descent
- 1 January 1996
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Fast Approximation Algorithms for Fractional Packing and Covering ProblemsMathematics of Operations Research, 1995
- Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling ConstraintsSIAM Journal on Optimization, 1994
- Linear time algorithms for some separable quadratic programming problemsOperations Research Letters, 1993
- A natural randomization strategy for multicommodity flow and related algorithmsInformation Processing Letters, 1992
- An Interior Point Method for Block Angular OptimizationSIAM Journal on Optimization, 1991
- The maximum concurrent flow problemJournal of the ACM, 1990
- Approximation algorithms for scheduling unrelated parallel machinesMathematical Programming, 1990
- An O(n) algorithm for the multiple-choice knapsack linear programMathematical Programming, 1984
- An Algorithm for Large Zero-One Knapsack ProblemsOperations Research, 1980
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear ProgrammingJournal of the ACM, 1978