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