Abstract
In [4] several procedures were presented for finding a saddle point of a continuous convex-concave function, and it was shown that some decomposition methods for convex programs can be considered as special cases of these procedures. This paper follows the same way of thinking.
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.
References
Dantzig, G.B.: “Linear programming and extensions”, pp. 476–477, Princeton University Press, Princeton, 1963.
Fiacco, A.V.: “Sensitivity analysis for nonlinear programming using penalty methods”, Technical paper, The George Washington University, Washington, 1973.
Kronsjö, T.O.M.: “Decomposition of a nonlinear convex separable economic system in primal and dual directions”. In: Optimization (ed. by R. Fletcher ), pp. 85–97, Academic Press, London, 1969.
Oettli, W.: “Eine allgemeine, symmetrische Formulierung des Dekompositionsprinzips für duale Paare nichtlinearer Min-max-und Maxmin-Probleme”, Zeitschrift für Operations Research 18 (1974), 1–18.
Stahl, J.: “Decomposition procedure for doubly coupled LP programs”, INFELOR Közlemények 10, Budapest, 1975 (In Hungarian).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Stahl, J. (1976). Decomposition Procedures for Convex Programs. In: Oettli, W., Ritter, K. (eds) Optimization and Operations Research. Lecture Notes in Economics and Mathematical Systems, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46329-7_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-46329-7_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07616-2
Online ISBN: 978-3-642-46329-7
eBook Packages: Springer Book Archive