Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs-Reference-Cited by-同舟云学术

Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs

Published:1994-08 Issue:1-3 Volume:66 Page:79-101
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Medhi Deepankar

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01581138.pdf

Reference28 articles.

1. G.B. Dantzig and P. Wolfe, “Decomposition principle for linear programs,”Operations Research 8 (1960) 101–111.

2. Y.M.I. Dirickx and L.P. Jennergren,Systems Analysis by Multilevel Methods: With Applications to Economics and Management (Wiley, Chichester, England, 1979).

3. P.E. Gill, W. Murray and M.H. Wright,Practical Optimization (Academic Press, New York, 1981).

4. C.D. Ha, “Decomposition methods for structured convex programming,” Ph.D. dissertation, Department of Industrial Engineering, University of Wisconsin-Madison (Madison, WI, 1980).

5. M. Held, P. Wolfe and H. Crowder, “Validation of subgradient optimization,”Mathematical Programming 6 (1974) 62–88.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures;Parallel Algorithms in Computational Science and Engineering;2020

2. A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method;Mathematical Programming;2016-09-19

3. Permuting Sparse Rectangular Matrices into Block-Diagonal Form;SIAM Journal on Scientific Computing;2004-01

4. BIBLIOGRAPHY;Routing, Flow, and Capacity Design in Communication and Computer Networks;2004

5. A Survey of Algorithms for Convex Multicommodity Flow Problems;Management Science;2000-01