Abstract
In this paper, for a nonsmooth semi-infinite programming problem where the objective and constraint functions are locally Lipschitz, analogues of the Guignard, Kuhn-Tucker, and Cottle constraint qualifications are given. Pshenichnyi-Levin-Valadire property is introduced, and Karush-Kuhn-Tucker type necessary optimality conditions are derived.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bot R.I., Grad S.M., Wanka G.: On strong and total Lagrange duality for convex optimization problems. J. Math. Anal. Appl. 337, 1315–1325 (2008)
Clarke F.H.: Optimization and Nonsmooth Analysis. Wiley-Interscience, New York (1983)
DingZhu Du., Panos M., Pardalos P.M., Weili Wu.: Mathematical Theory of Optimization. Kluwer Academic Publishers, Dordrecht (2001)
Dinh N., Goberna M.A., López M.A., Son T.Q.: New farkash-type constraint qualifications in convex infinite programming. ESIAM: Control. Optim. Calc. Var. 13, 580–597 (2007)
Fajardo M.D., López M.A.: Locally farkas-minkowski systems in convex semi-infinite programming. J. Optim. Theory Appl. 103, 313–335 (1999)
Giorgi J., Gwirraggio A., Thierselder J.: Mathematics of Optimization; Smooth and Nonsmooth Cases. Elsivier, Amsterdam (2004)
Goberna M.A., López M.A.: Linear Semi-Infinite Optimazation. Wiley, Chichester (1998)
Gorberna M.A., López M.A., Pastor J.: Farkas-minkowski system in semi-infinite programming. Appl. Math. Optim. 7, 295–308 (1981)
Guerra-Vazquez, F., Jongen, H.Th., Shikhman, V.: General semi-infinite programming: symmetric Mangasarian-Fromovitz constraint qualification and the closure of the feasible set. SIAM J. Optim. (2010, to appear)
Hettich R., Haaren E., Ries M., Still G.: Accurate numerical approximations of eirenfrequencies and eigenfunctions of elliptic membranes. Z. Angew. Math. Mech. 67, 589–597 (1987)
Hiriart- Urruty J.B., Lemarechal C.: Convex Analysis and Minimization Algorithms. Springer, Berlin, Heidelberg (1991)
Horst R., Pardalos P.M.: Handbook of Global Optimization. Kluwer Academic Publishers, Dordrecht (1995)
Kanzi N., Nobakhtian S.: Optimality conditions for nonsmooth semi-infinite programming. Optimization 53, 717–727 (2008)
Kanzi N., Nobakhtian S.: Nonsmooth semi-infinite programming problems with mixed constraints. J. Math. Anal. Appl. 351, 170–181 (2008)
Kropat E., Pickl S., Rößler A., Weber G.-W.: A new algorithm from semi-infinite optimization for a problem of time-minimal control. J. Comput Technol 5 4, 43–81 (2000)
Li W., Nahak C., Singer I.: Constraint qualifications in semi-infinite systems of convex inequalities. SIAM J. Optim. 11, 31–52 (2000)
Li Ch., Nǵ K.F., Pong T.K.: Constraint qualifications for convex inequality systems with applications in constrained optimization. SIAM J. Optim. 19, 163–187 (2008)
López M.A., Vercher E.: Optimality conditions for nondifferentiable convex semi-infinite programming. Math. Program. 27, 307–319 (1983)
López M.A., Still G.: Semi-infinite programming. Eur. J. Opera. Res. 180, 491–518 (2007)
Puente R., VeraDe Serio V.N.: Locally farkas minkowski linear inequality systems. Top 7, 103–121 (1999)
Rockafellar R.T., Wets J.B.: Variational Analysis. Springer-Verlag, Berlin (1998)
Stein O.: On constraint qualifications in nonsmooth optimization. J. Optim. Theory. Apll. 121, 647–671 (2004)
Zheng X.Y., Yang X.: Lagrange multipliers in nonsmooth semi-infinite optimization problems. J. Oper. Res. 32, 168–181 (2007)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was in part supported by a grant from IPM (No. 88900026).
Rights and permissions
About this article
Cite this article
Kanzi, N. Necessary optimality conditions for nonsmooth semi-infinite programming problems. J Glob Optim 49, 713–725 (2011). https://doi.org/10.1007/s10898-010-9561-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-010-9561-5