×

Einzelschrittverfahren zur Lösung konvexer und dual-konvexer Minimierungsprobleme. (German) Zbl 0281.90058


MSC:

90C25 Convex programming
65K05 Numerical mathematical programming methods
PDFBibTeX XMLCite
Full Text: DOI Link

References:

[1] Warga, SIAM J. Appl. Math. 11 pp 588– (1963)
[2] , Programmes, jeux et réseaux de transport. Dunod, Paris, 1962.
[3] Nonlinear Programming. Prentice-Hall, Englewood Cliffs, N. J., 1969.
[4] Constructive Real Analysis. Harper & Row, New York, 1967. · Zbl 0189.49703
[5] Optimisation. Dunod, Paris, 1971.
[6] Minimization of a convex function by relaxation. In: Integer and Nonlinear Programming ( ed.), North-Holland, Amsterdam, 1970, pp. 177–189.
[7] Fenchel, Math. Z. 63 pp 496– (1956)
[8] , Convexity and Optimization in Finite Dimensions I. Springer, Berlin, 1970. · doi:10.1007/978-3-642-46216-0
[9] Beiträge zur zyklischen Relaxation in der konvexen Programmierung. Dissertation, Universität Zürich, 1971.
[10] Recherche numérique d’un optimum dans un espace produit. In: Colloquium on Methods of Optimization (Lecture Notes in Mathematics, 112), Springer, Berlin, 1970, pp. 33–50.
[11] , Nichtlineare Programmierung. Springer, Berlin, 1962. · Zbl 0102.15502 · doi:10.1007/978-3-642-96287-5
[12] Beiträge zum Hildreth-Verfahren und zur {\(\epsilon\)}-Störung quadratischer und linearer Optimierungsaufgaben. Dissertation, Universität Bonn, 1969.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.