Abstract
This paper gives characterizations of optimal solutions to the nondifferentiable convex semi-infinite programming problem, which involve the notion of Lagrangian saddlepoint. With the aim of giving the necessary conditions for optimality, local and global constraint qualifications are established. These constraint qualifications are based on the property of Farkas-Minkowski, which plays an important role in relation to certain systems obtained by linearizing the feasible set. It is proved that Slater's qualification implies those qualifications.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
M.S. Bazaraa and C.M. Shetty,Foundations of optimization, Lecture notes in economics and mathematical systems 122 (Springer, Berlin, 1976).
A. Ben-Tal, L. Kerzner and S. Zlobec, “Optimality conditions for convex semi-infinite programming problems”,Naval Research Logistics Quarterly 27 (1980) 413–435.
A. Ben-Tal, E.E. Rosinger and A. Ben-Israel, “A Helly-type theorem and semi-infinite programming”, in: C.V. Coffman and G.J. Fix, eds.,Constructive approaches to mathematical models (Academic Press, New York, 1979) pp. 127–135.
A. Ben-Tal, M. Teboulle and J. Zowe, “Second order necessary optimality conditions for semi-infinite programming”, in: R.P. Hettich, ed.,Semi-infinite programming, Lecture notes in control and information sciences 15 (Springer, Berlin, 1979) pp. 17–30.
J.M. Borwein, “Direct theorems in semi-infinite convex programming”,Mathematical Programming 21 (1981) 301–318.
A. Charnes, W.W. Cooper and K.O. Kortanek, “On the theory of semi-infinite programming and a generalization of the Khun-Tucker saddle point theorem for arbitrary convex functions”,Naval Research Logistics Quarterly 16 (1969) 41–51.
R.J. Duffin, R.G. Jeroslow and L.A. Karlovitz “Duality in semi-infinite linear programming”, unpublished manuscript, Georgia Institute of Technology (Atlanta, Georgia, March 1981).
R.J. Duffin and L.A. Karlovitz, “An infinite linear program with a duality gap”,Management Science 12 (1965) 122–134.
I.I. Eremin and N.N. Astafiev,An introduction to the theory of linear and convex programming (in Russian) (Nauka, Moscow, 1976).
K. Fan, “On infinite systems of linear inequalities”,Journal of Mathematical Analysis and Applications 21 (1968) 475–478.
M.A. Goberna, M.A. López and J. Pastor, “Farkas-Minkowski systems in semi-infinite programming”,Applied Mathematics and Optimization 7 (1981) 295–308.
R.P. Hettich and H.Th. Jongen, “Semi-infinite programming: conditions of optimality and applications”, in: J. Stoer, ed.,Optimization techniques II, Lecture notes in control and information sciences 7 (Springer, Berlin, 1978) pp. 1–11.
K.H. Hoffman and H.J. Kornstaedt, “Higher-order necessary conditions in abstract mathematical programming”,Journal of Optimization Theory and Applications 26 (1978) 531–566.
A.D. Ioffe and V.M. Tihomirov,Theory of extremal problems (North-Holland, Amsterdam, 1979).
R.G. Jeroslow, “Uniform duality in semi-infinite convex optimization”,Mathematical Programming 27 (1983) to appear.
D.F. Karney, “Clark's theorem for semi-infinite convex programs”,Advances in Applied Mathematics 2 (1981) 7–12.
D.F. Karney, “Asymptotic convex programming”, unpublished manuscript, Georgia Institute of Technology (Atlanta, Georgia, 1981).
V. Klee, “The critical set of a convex body”,American Journal of Mathematics 75 (1953) 178–188.
H.J. Kornstaedt, “Necessary conditions of higher order for semi-infinite programming”, in: R.P. Hettich, ed.,Semi-infinite programming, Lecture notes in control and information sciences 15 (Springer, Berlin, 1979) pp. 31–50.
B.N. Pshenichnyi,Necessary conditions for an extremum (Dekker, New York, 1971).
R.T. Rockafellar,Convex analysis (Princeton University Press, Princeton, NJ, 1970).
M.M. Valadier, “Sous-differentiels d'une borne superieure et d'une somme continue de functions convexes”,Comptes Rendus Hebdomadaires des Séances de l'Académie des Sciences, Series A, 268 (1969) 39–42
H. Wolkowicz, “The abstract convex program and semi-infinite programming”, contributed paper, International symposium on semi-infinite programming and applications, University of Texas at Austin (Austin, Texas, September 1981).
H. Wolkowicz, “A strengthened test for optimality”,Journal of Optimization Theory and Applications 35 (1981) 497–515.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
López, M.A., Vercher, E. Optimality conditions for nondifferentiable convex semi-infinite programming. Mathematical Programming 27, 307–319 (1983). https://doi.org/10.1007/BF02591906
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02591906