Existence theorem and optimality conditions for a class of convex semi-infinite problems with noncompact index sets (original) (raw)
Related papers
Statistics, Optimization & Information Computing, 2017
We consider a special Nonlinear Programming problem depending on integer parameters. For some values of these parameters (the "right" ones), this problem satisfies certain properties used in study of differential properties of optimal solutions in parametric Semi-Infinite Programming. We deduce the conditions guaranteing the existence of the "right" parameters values, and propose an algorithm for their determination. The conditions and the algorithm are essentially based on properties of a related linear-quadratic semi-infinite problem.
Optimality conditions for semi-infinite programming problems involving generalized convexity
Optimization Letters, 2018
We apply some advanced tools of quasiconvex analysis to establish Karush-Kuhn-Tucker type necessary and sufficient optimality conditions for nondifferentiable semi-infinite programming problems. In addition, we propose a linear characterization of optimality for the mentioned problems. Examples are also designed to analyze and illustrate the results obtained.
Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
2012
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality conditions for the problem.
Optimality conditions for convex semi-infinite programming problems
Naval Research Logistics Quarterly, 1980
This paper gives characterizations of optilDal soiutions for convex I semi-infinite programming problems. These characterizations are free of I' theories, which give only necessary or sufficient conditions for optimality, but not both•. An a~plieation to the problem of best iinear Chebyshev approxiaation with constraints is delDOll8trated.
Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
European Journal of Operational Research, 2010
This paper is devoted to the study of nonsmooth generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be locally Lipschitz. We introduce a constraint qualification which is based on the Mordukhovich subdifferential. Then, we derive a Fritz-John type necessary optimality condition. Finally, interrelations between the new and the existing constraint qualifications such as the Mangasarian-Fromovitz, linear independent, and the Slater are investigated.
Optimality conditions for non-smooth semi-infinite programming
Optimization, 2010
In this paper we study optimization problems with infinity many inequality constraints on a Banach space where the objective function and the binding constraints are Lipschitz near the optimal solution. Necessary optimality conditions and constraint qualifications in terms of Michel-Penot subdifferential are given.
Necessary conditions and duality for inexact nonlinear semi-infinite programming problems
Mathematical Methods of Operations Research, 2007
First order necessary conditions and duality results for general inexact nonlinear programming problems formulated in nonreflexive spaces are obtained. The Dubovitskii-Milyutin approach is the main tool used. Particular cases of linear and convex programs are also analyzed and some comments about a comparison of the obtained results with those existing in the literature are given.
Mathematical Programming, 2013
The paper concerns the study of new classes of nonlinear and nonconvex optimization problems of the so-called infinite programming that are generally defined on infinite-dimensional spaces of decision variables and contain infinitely many of equality and inequality constraints with arbitrary (may not be compact) index sets. These problems reduce to semi-infinite programs in the case of finite-dimensional spaces of decision variables. We extend the classical Mangasarian-Fromovitz and Farkas-Minkowski constraint qualifications to such infinite and semi-infinite programs. The new qualification conditions are used for efficient computing the appropriate normal cones to sets of feasible solutions for these programs by employing advanced tools of variational analysis and generalized differentiation. In the further development we derive first-order necessary optimality conditions for infinite and semi-infinite programs, which are new in both finite-dimensional and infinite-dimensional settings.