Abstract
Decomposition methods are used for solving large-scale linear and convex programming problems in order to save time by reducing the number of references to the external memory of a computer. Such methods convert the solution of the original problem into the solution of a series of problems of lower dimension (blocks). They are particularly efficient if the structure of each block permits the use of special, fast solution methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin, Heidelberg
About this chapter
Cite this chapter
Shor, N.Z. (1985). Applications of Methods for Nonsmooth Optimization to the Solution of Mathematical Programming Problems. In: Minimization Methods for Non-Differentiable Functions. Springer Series in Computational Mathematics, vol 3. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82118-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-82118-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-82120-2
Online ISBN: 978-3-642-82118-9
eBook Packages: Springer Book Archive