1. |
Differentiability in optimization theory1 |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 9,
Issue 4,
1978,
Page 497-513
Ekkehard Sachs,
Preview
|
PDF (817KB)
|
|
摘要:
This paper deals with necessary conditions for optimization problems with infinitely many inequality constraints assuming various differentiability conditions. By introducing a second topologyNon a topological vector space we define generalized versions of differentiability and tangential cones. Different choices ofNlead to Gâteaux-, Hadamaed- and weak differentiability with corresponding tangential cones. The general concept is used to derive necessary conditions for local optimal points in form of inequalities and generalized multiplier rules, Special versions of these theorems are obtained for different differentiability assumptions by choosing properly. An application to approximation theory is given.
ISSN:0323-3898
DOI:10.1080/02331937808842516
出版商:Akademic-Verlag
年代:1978
数据来源: Taylor
|
2. |
Buchbesprechung |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 9,
Issue 4,
1978,
Page 514-514
P. Neumann,
Preview
|
PDF (68KB)
|
|
摘要:
K.Bauknecht, J.Kohlas, C.A.Zehnder: Simulationstechnik. Springer-Verlag, Berlin-Heidelberg-New York 1976, 15 Abb., V+216 S.,DM 24,50.
ISSN:0323-3898
DOI:10.1080/02331937808842517
出版商:Akademic-Verlag
年代:1978
数据来源: Taylor
|
3. |
Necessary optimality conditions for programming problems over cone domains |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 9,
Issue 4,
1978,
Page 515-521
C.B. Alders,
V.A. Sposito,
Preview
|
PDF (299KB)
|
|
摘要:
In earlier results by Sposito and David, Kuhn-Tucker type duality associated with a certain saddlepoint problem was established over convex cone domains (not necessarily polyhedral) without differentiability. Recent variants have established necessary optimality conditions of the Fritz John and Kuhn-Tucker type for programming problems over" convex polyhedral cone domains which require differentiability assumptions. This paper extends the present results in the literature to programming problems over arbitrary convex cone domains (not necessarily polyhedral).
ISSN:0323-3898
DOI:10.1080/02331937808842518
出版商:Akademic-Verlag
年代:1978
数据来源: Taylor
|
4. |
Buchbesprechung |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 9,
Issue 4,
1978,
Page 522-522
K.H. Elster,
Preview
|
PDF (47KB)
|
|
摘要:
Yau-Chuen Wong, Kung-Fu No: Partially Ordered Topological Vector Spaces. Oxford Mathematical Monographs, Oxford University Press, London W.I, 1973, XII, 217 p.,£7.
ISSN:0323-3898
DOI:10.1080/02331937808842519
出版商:Akademic-Verlag
年代:1978
数据来源: Taylor
|
5. |
Relations between stochastic and parametric programming for decision problems with a random objective function |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 9,
Issue 4,
1978,
Page 523-535
Klaus Tammer,
Preview
|
PDF (642KB)
|
|
摘要:
In this paper we study the relation between the general concept for an optimal solution for stochastic programming problems with a random objective function-the concept of an £-efficient solution-and the associated parametric problem, We show that it is possible under certain assumptions to obtain some or even all £-efficient solutions of the stochastic problem by solving the parametric problem with respect to a certain parameter set.
ISSN:0323-3898
DOI:10.1080/02331937808842520
出版商:Akademic-Verlag
年代:1978
数据来源: Taylor
|
6. |
Buchbesprechung |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 9,
Issue 4,
1978,
Page 536-536
H.U. Küenle,
Preview
|
PDF (42KB)
|
|
摘要:
D.Stoyan: Qualitative Elgenschaften und Abchätzungen stochastischer Modelle. R.Oldenburg Verlag Müchen-Wien 1977, X,198 S.,DM 44.
ISSN:0323-3898
DOI:10.1080/02331937808842521
出版商:Akademic-Verlag
年代:1978
数据来源: Taylor
|
7. |
A note on mixed procedures for decomposing linear programming problems |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 9,
Issue 4,
1978,
Page 537-544
Borge Obel,
Preview
|
PDF (301KB)
|
|
摘要:
This paper shows how to combine primal and dual decomposition procedures where both a vertical and a horizontal decomposition approach can be applied. The motivation for using a mixed procedure is that it improves the possibility of efficiently initializing the procedure, which has been shown to be crucial for the convergence of the procedures, Additionally mixed procedures have important interpretations as mixed price and budget planning procedures for decentralized organizations.
ISSN:0323-3898
DOI:10.1080/02331937808842522
出版商:Akademic-Verlag
年代:1978
数据来源: Taylor
|
8. |
Zur minimierung konvexer subdifferenzierbarer funktionen Über demRn |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 9,
Issue 4,
1978,
Page 545-557
Bernd Schwartz,
Preview
|
PDF (689KB)
|
|
摘要:
A minimization method is described for convex subdifferentiable functions and the convergence proof is given. The method is based on an extension of the subdifferential in such a way that this point to set map is continuous. Different methods follow for a special choice of the used norm and the used extension of the subdifferential. For certain classes of functions the method is explained in detail and corresponding realisations of the extensions of the subdiffential are given.
ISSN:0323-3898
DOI:10.1080/02331937808842523
出版商:Akademic-Verlag
年代:1978
数据来源: Taylor
|
9. |
Buchbesprechung |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 9,
Issue 4,
1978,
Page 558-558
D. Stoyan,
Preview
|
PDF (76KB)
|
|
摘要:
P.R.Krishnaiah (ed.): Applications of Statistics. Proceedings of the Symposium Held at Wright State University, Dayton, Ohin, 14-18 June 1976. North-Holland Publishing Company, Amsterdam-New York-Oxford 1977, 543 S., US $ 44.95.
ISSN:0323-3898
DOI:10.1080/02331937808842524
出版商:Akademic-Verlag
年代:1978
数据来源: Taylor
|
10. |
Bemerkungen zur superlinearen konvergenz von abstiegsverfahren |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 9,
Issue 4,
1978,
Page 559-567
Wolfgang Warth,
Preview
|
PDF (450KB)
|
|
摘要:
We discuss superlinearly convergent algorithms for unconstrained optimization problems. Two feneral algorithms are presented and we outline a theory of convergence for those algorithms.
ISSN:0323-3898
DOI:10.1080/02331937808842525
出版商:Akademic-Verlag
年代:1978
数据来源: Taylor
|