Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
From MaRDI portal
(Redirected from Publication:353157)
Abstract: 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.
Recommendations
- Optimality conditions for semi-infinite programming problems under relaxed quasiconvexity assumptions
- Optimality conditions for non-smooth semi-infinite programming
- Necessary optimality conditions in semi-infinite linear programming: constraint qualifications and properties of the feasible set
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
Cites work
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 4029251 (Why is no real title available?)
- scientific article; zbMATH DE number 1186920 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- Bi-level strategies in semi-infinite programming.
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- From linear to convex systems: consistency, Farkas' lemma and applications
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- New Farkas-type constraint qualifications in convex infinite programming
- Nonsmooth analysis
- Normal cones to infinite intersections
- On strong and total Lagrange duality for convex optimization problems
- Qualification and optimality conditions for dc programs with infinite constraints
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite optimization: Structure and stability of the feasible set
- Semi-infinite programming
- Semi-infinite programming, duality, discretization and optimality conditions†
- Semi-infinite programming. Recent advances
- Subdifferentials of marginal functions in semi-infinite programming
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Techniques of variational analysis
- Variational Analysis
- Variational analysis in semi-infinite and infinite programming. I: Stability of linear inequality systems of feasible solutions
- Variational analysis in semi-infinite and infinite programming. II: Necessary optimality conditions
Cited in
(45)- Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings
- An extension of the basic constraint qualification to nonconvex vector optimization problems
- Subdifferential formulae for the supremum of an arbitrary family of functions
- Variational analysis in semi-infinite and infinite programming. II: Necessary optimality conditions
- Subdifferentials of marginal functions in semi-infinite programming
- Optimality conditions for semi-infinite programming problems involving generalized convexity
- scientific article; zbMATH DE number 5662944 (Why is no real title available?)
- Convexity and variational analysis
- Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
- On equivalent representations and properties of faces of the cone of copositive matrices
- An improved bootstrap test for restricted stochastic dominance
- scientific article; zbMATH DE number 2158983 (Why is no real title available?)
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials
- Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints
- Isolated efficiency in nonsmooth semi-infinite multi-objective programming
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
- Optimality conditions for semi-infinite programming problems under relaxed quasiconvexity assumptions
- New constraint qualification and optimality for linear semi-infinite programming
- Generalizations of Slater's constraint qualification for infinite convex programs
- Constraint qualifications in nonsmooth optimization: Classification and inter-relations
- Mangasarian-Fromovitz and Zangwill conditions for non-smooth infinite optimization problems in Banach spaces
- ϵ-Efficient solutions in semi-infinite multiobjective optimization
- Composite semi-infinite optimization
- Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
- Best approximation with geometric constraints
- New Farkas-type constraint qualifications in convex infinite programming
- Lagrange multiplier characterizations of constrained best approximation with infinite constraints
- Optimality, scalarization and duality in linear vector semi-infinite programming
- Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem
- Constraint qualification with Schauder basis for infinite programming problems
- Infinite (semi-infinite) problems to characterize the optimality of nonlinear optimization problems
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- Non-convex semi-infinite min-max optimization with noncompact sets
- Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization
- New extremal principles with applications to stochastic and semi-infinite programming
- Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
- On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming
- scientific article; zbMATH DE number 6988801 (Why is no real title available?)
- Optimality conditions in convex multiobjective SIP
- Generalized differentiation of probability functions acting on an infinite system of constraints
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Necessary optimality conditions in semi-infinite linear programming: constraint qualifications and properties of the feasible set
This page was built for publication: Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q353157)
