Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
From MaRDI portal
Publication:353157
DOI10.1007/S10107-013-0672-XzbMATH Open1292.90283arXiv1103.3862OpenAlexW2130117043MaRDI QIDQ353157FDOQ353157
Authors: Boris S. Mordukhovich, T. T. A. Nghia 
Publication date: 12 July 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1103.3862
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
optimality conditionsgeneralized differentiationsemi-infinite and infinite programmingvariational analysis and parametric optimization
Cites Work
- Variational Analysis
- Techniques of variational analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Bi-level strategies in semi-infinite programming.
- Semi-Infinite Programming: Theory, Methods, and Applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semi-infinite programming. Recent advances
- Semi-infinite programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Nonsmooth analysis
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- Variational analysis in semi-infinite and infinite programming. I: Stability of linear inequality systems of feasible solutions
- New Farkas-type constraint qualifications in convex infinite programming
- On strong and total Lagrange duality for convex optimization problems
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Semi-infinite optimization: Structure and stability of the feasible set
- Qualification and optimality conditions for dc programs with infinite constraints
- Variational analysis in semi-infinite and infinite programming. II: Necessary optimality conditions
- From linear to convex systems: consistency, Farkas' lemma and applications
- Subdifferentials of marginal functions in semi-infinite programming
- Semi-infinite programming, duality, discretization and optimality conditions†
- Title not available (Why is that?)
- Normal cones to infinite intersections
Cited In (45)
- Optimality conditions for semi-infinite programming problems involving generalized convexity
- Title not available (Why is that?)
- Convexity and variational analysis
- On equivalent representations and properties of faces of the cone of copositive matrices
- Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
- Title not available (Why is that?)
- An improved bootstrap test for restricted stochastic dominance
- 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
- 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
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
- Isolated efficiency in nonsmooth semi-infinite multi-objective programming
- Optimality conditions for semi-infinite programming problems under relaxed quasiconvexity assumptions
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
- Constraint qualifications in nonsmooth optimization: Classification and inter-relations
- New constraint qualification and optimality for linear semi-infinite programming
- Generalizations of Slater's constraint qualification for infinite convex programs
- ϵ-Efficient solutions in semi-infinite multiobjective optimization
- Mangasarian-Fromovitz and Zangwill conditions for non-smooth infinite optimization problems in Banach spaces
- 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
- Constraint qualification with Schauder basis for infinite programming problems
- Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem
- 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
- Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
- Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization
- New extremal principles with applications to stochastic and semi-infinite programming
- Title not available (Why is that?)
- On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming
- Generalized differentiation of probability functions acting on an infinite system of constraints
- Optimality conditions in convex multiobjective SIP
- 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
- Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings
- Subdifferential formulae for the supremum of an arbitrary family of functions
- An extension of the basic constraint qualification to nonconvex vector optimization problems
- Variational analysis in semi-infinite and infinite programming. II: Necessary optimality conditions
- Subdifferentials of marginal functions in semi-infinite programming
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)
