Abstract
The validity of Zangwill’s general algorithm for finding a point of a subset of a set is given here with weakened hypotheses. In particular the closedness of the point-to-set map used in the algorithm is not needed.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
F. Cordellier and J.C. Fiorot, “On the Fermat-Weber problem with convex cost function”, Mathematical Programming, 14 (1978).
J.C. Fiorot and P. Huard, “Une approche théorique du problème de linéarisation en programmation mathématique convexe”, Publication No. 42 du Laboratoire de Calcul (Université de Lille, 1974).
P. Huard, “Optimisation dans R n”, Cours de 3ème cycle, Laboratoire de Calcul (Université de Lille, 1971).
G.G.L. Meyer, “Convergence conditions for a type of algorithm model”, SIAM Journal on Control and Optimization 15 (1977) 779–784.
E. Polak, “On the implementation of conceptual algorithm”, in: O.L. Mangasarian, K. Ritter and J.B. Rosen, eds., Nonlinear programming (Academic Press, New York, 1970) 275–291.
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
Huard, P. (1979). Extensions of Zangwill’s theorem. In: Huard, P. (eds) Point-to-Set Maps and Mathematical Programming. Mathematical Programming Studies, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120846
Download citation
DOI: https://doi.org/10.1007/BFb0120846
Received:
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