Abstract
In this paper we approach the stability analysis of the feasible set mapping in convex semi-infinite programming for an arbitrary index set. More precisely, we establish its closedness and study the semicontinuity, in the sense of Berge, of this multivalued mapping- A certain metric is proposed in order to measure the distance between nominal and perturbed problems. Since we do not require any structure to the index set, our results cover the ordinary convex programming problem.
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
M. Canovas, M. Lopez, J. Parra and M. Todorov. Stability and well-posedness in linear semi-infinite programming, SIAM Journal on Optimization, 10:82–98, 1999.
M. Goberna and M. Lopez. Topological stability of linear semi-infinite inequality systems, Journal of Optimization Theory and its Applications, 89:227–236, 1996.
M. Goberna and M. Lopez. Linear Semi-Infinite Optimization, Wiley, 1998.
M. Goberna, M. Lopez and M. Todorov. Stability theory for linear inequality systems, SIAM Journal on Matrix Analysis and Applications, 17:730–743, 1996.
M. Goberna, M. López and M. Todorov. Stability theory for linear inequality systems II: Upper semicontinuity of the solution set mapping, SI AM Journal on Optimization, 7:1138–1151, 1997.
W. Li, C. Nahak and I. Singer. Constraint qualifications for semi-infinite systems of convex inequalities, SIAM Journal on Optimization, 11:31–52, 2000.
S. Robinson. Stability theory for systems of inequalities. Part I: Linear systems, SIAM Journal on Numerical Analysis, 12:754–769, 1975.
R. Rockafellar. Convex Analysis, Princeton University Press, 1970.
R. Rockafellar and R. B. Wets. Variational Analysis, Springer-Verlag, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
López, M.A., de Serio, V.N.V. (2001). Stability of the Feasible Set Mapping in Convex Semi-Infinite Programming. In: Goberna, M.Á., López, M.A. (eds) Semi-Infinite Programming. Nonconvex Optimization and Its Applications, vol 57. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3403-4_5
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3403-4_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5204-2
Online ISBN: 978-1-4757-3403-4
eBook Packages: Springer Book Archive