Abstract
Robinson has proposed the bundle-based decomposition algorithm to solve a class of structured large-scale convex optimization problems. In this method, the original problem is transformed (by dualization) to an unconstrained nonsmooth concave optimization problem which is in turn solved by using a modified bundle method. In this paper, we give a posteriori error estimates on the approximate primal optimal solution and on the duality gap. We describe implementation and present computational experience with a special case of this class of problems, namely, block-angular linear programming problems. We observe that the method is efficient in obtaining the approximate optimal solution and compares favorably with MINOS and an advanced implementation of the Dantzig—Wolfe decomposition method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G.B. Dantzig and P. Wolfe, “Decomposition principle for linear programs,”Operations Research 8 (1960) 101–111.
Y.M.I. Dirickx and L.P. Jennergren,Systems Analysis by Multilevel Methods: With Applications to Economics and Management (Wiley, Chichester, England, 1979).
P.E. Gill, W. Murray and M.H. Wright,Practical Optimization (Academic Press, New York, 1981).
C.D. Ha, “Decomposition methods for structured convex programming,” Ph.D. dissertation, Department of Industrial Engineering, University of Wisconsin-Madison (Madison, WI, 1980).
M. Held, P. Wolfe and H. Crowder, “Validation of subgradient optimization,”Mathematical Programming 6 (1974) 62–88.
J.-B. Hiriart-Urruty, “∈-subdifferential calculus,” in:Convex Analysis and Optimization, Research note in Mathematics, Series 57 (Pitman, London, 1982) pp. 43–92.
J.K. Ho and É. Loute, “DECOMP User's Guide,” unpublished manuscript.
J.K. Ho and É. Loute, “An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming,”Mathematical Programming 20 (1981) 303–326.
J.K. Ho and É. Loute, “Computational experience with advanced implementation of decomposition algorithms for linear programming,”Mathematical Programming 27 (1983) 283–290.
J.K. Ho and É. Loute, “Computational aspects of dynamico: a model of trade and development in the world economy,”Revue Française d'Automatique, Informatique et Recherche opérationnelle 18 (1984) 403–414.
J.K. Ho and R.P. Sundarraj,DECOMP: An Implementation of Dantzig—Wolfe Decomposition for Linear Programming (Lecture Notes in Economics and Mathematical Systems, Vol. 338) (Springer-Verlag, New York, 1989).
IMSL User's manual, Edition 9.2, International Mathematical and Statistical Library, Houston, Texas (1984).
C. Lemaréchal, “A view of line-searches”, in: Auslender, Oettli and Stoer, eds.,Optimization and Optimal Control (Lecture Notes in Control and Information Sciences, Vol. 30) (Springer-Verlag, Berlin, 1981) pp. 59–78.
C. Lemaréchal, J.J. Strodiot and A. Bihain, “On a bundle algorithm for nonsmooth optimization,” in: O.L. Mangasarian, R.R. Meyer and S.M. Robinson, eds.,Nonlinear Programming 4 (Academic Press, New York, 1981) pp. 245–282.
C. Lemaréchal and M.-C. Bancora Imbert, “Le module M1FC1”, preprint: INRIA, B.P. 105, Le Chesnay, France (France, March 1985).
C. Lemaréchal, Private communication (1986).
D. Medhi, “Decomposition of structured large-scale optimization problems and parallel optimizations,” Ph.D. dissertation, Technical Report #718, Computer Sciences Dept., University of Wisconsin-Madison (September 1987).
D. Medhi, “Parallel bundle-based decomposition algorithm for large-scale structured mathematical programming problems,”Annals of Operations Research 22 (1990) 101–127.
R. Mifflin, “A stable method for solving certain constrained least-squares problems,”Mathematical Programming 16 (1979) 141–158.
B.A. Murtagh and M.A. Saunders, “MINOS 5.0 user's guide”, Technical Report #SOL 83-20, Department of Operations Research, Stanford University (Stanford, CA, December 1983).
K.G. Murty,Linear Programming (John Wiley and Sons, New York, 1983).
B.T. Polyak, “Subgradient method: a survey of Soviet research,” in: C. Lemaréchal and R. Mifflin, eds.,Nonsmooth Optimization (Pergamon Press, Oxford, 1978) pp. 5–28.
S.M. Robinson, “Bundle-based decomposition: Description and preliminary results,” in: A. Prékopa, J. Szelezsán and B. Strazicky, eds.,System Modelling and Optimization (Lecture Notes in Control and Information Sciences, Vol. 84) (Springer-Verlag, Berlin, 1986) pp. 751–756.
S.M. Robinson, “Bundle-based decomposition: conditions for convergence,”Annales de l'Institute Henri Poincaré: Analyse Non Linéaire 6 (1989) 435–447.
R.T. Rockafellar,Convex Analysis (Princeton University Press, 1970).
R.T. Rockafellar,Conjugate Duality and Optimization (SIAM, Philadelphia, 1974).
R.T. Rockafellar, “Monotone operators and the proximal point algorithm,”SIAM Journal on Control and Optimization 14 (1976) 877–898.
M.A. Saunders, Private communication (1987).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Medhi, D. Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs. Mathematical Programming 66, 79–101 (1994). https://doi.org/10.1007/BF01581138
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581138