Abstract
A new approach for synthetizing optimization algorithms is presented. New concepts for the continuity of point-to-set maps are given in terms of families of maps. These concepts are well adapted to construct fixed point theorems that are widely useful for synthetizing optimization methods. The general algorithms already published are shown to be particular applications and illustrations in the field of mathematical programming are given.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C. Berge, Espaces topologiques—fonctions multivoques (Dunod, Paris, 1966).
D.P. Bertsekas and S.K. Mitter, “A descent numerical method for optimization problem with nondifferentiable cost functionals”, SIAM Journal on Control 11 (1973) 637–652.
G. Dantzig, J. Folkmann and N. Shapiro, “On the continuity of the minimum set of a continuous function”, Journal of Mathematical Analysis and Applications 17 (1967) 519–548.
J. Denel, “Adaptation and performance of the linearized method of centers”, Cahiers du CERO (Bruxelles) 16 (1974) 447–458.
J. Denel, “Propriétés des familles ρ-décroissantes d’applications multivoques”, Publication no. 87, Laboratoire de Calcul, Université de Lille 1 (1977).
J. Denel, “On the continuity of point-to-set maps with applications to optimization”, Proceedings of the II symposium of operations research, Aachen, 1977, to appear.
V.F. Dem’yanov and V.N. Molozemov, “On the theory of nonlinear minimax problems”, Russian Mathematical surveys 26 (1971) 57–115.
J.P. Evans and F.J. Gould, “Stability in nonlinear programming”, Operations Research 18 (1970) 107–118.
A.M. Geoffrion, “Duality in nonlinear programming: a simplified application oriented development”, SIAM Review 13 (1971) 1–37.
W.W. Hogan, “Point-to-set maps in mathematical programming”, SIAM Review 15 (1973) 591–603.
P. Huard, “Programmation mathématique convexe,” Revue Française d’Informatique et de Recherche Opérationnelle 7 (1968) 43–59.
P. Huard, “A method of centers by upper bounding functions with applications”, in: O.L. Mangasarian, K. Ritter, J.B. Rosen, eds., Nonlinear programming (Academic Press, New York, 1970) 1–30.
P. Huard, “Tentative de synthèse dans les méthodes de programmation nonlinéaire”, Cahiers du CERO (Bruxelles) 16 (1974) 347–367.
P. Huard, “Implementation of gradient methods by tangential discretization”, Journal of Optimization Theory and Applications 28 (1978).
P. Huard, “Optimization algorithms and point-to-set maps”, Mathematical Programming 8 (1975) 308–331.
G.G.L. Meyer and E. Polak, “Abstract model for the synthesis of optimization algorithms”, SIAM Journal on Control 9 (1971) 547–560.
R. Meyer, “The validity of a family of optimization methods”, SIAM Journal on Control 8 (1970) 41–54.
R.T. Rockafellar, Convex analysis (Princeton University Press, Princeton, NJ, 1970).
W.I. Zangwill, Nonlinear programming, a unified approach (Prentice Hall, Englewood Cliffs, RI, 1969).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 The Mathematical Programming Society
About this chapter
Cite this chapter
Denel, J. (1979). Extensions of the continuity of point-to-set maps: Applications to fixed point algorithms. In: Huard, P. (eds) Point-to-Set Maps and Mathematical Programming. Mathematical Programming Studies, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120843
Download citation
DOI: https://doi.org/10.1007/BFb0120843
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00797-2
Online ISBN: 978-3-642-00798-9
eBook Packages: Springer Book Archive