Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs

DOI10.1007/s10107-013-0672-xzbMath1292.90283arXiv1103.3862MaRDI QIDQ353157

Tran T. A. Nghia, Boris S. Mordukhovich

Publication date: 12 July 2013

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.3862

zbMATH Keywords

optimality conditions; generalized differentiation; semi-infinite and infinite programming; variational analysis and parametric optimization

Mathematics Subject Classification ID

90C30: Nonlinear programming

Related Items

ϵ-Efficient solutions in semi-infinite multiobjective optimization, Optimality, scalarization and duality in linear vector semi-infinite programming, Isolated efficiency in nonsmooth semi-infinite multi-objective programming, The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces, On equivalent representations and properties of faces of the cone of copositive matrices, Constraint qualifications in nonsmooth optimization: Classification and inter-relations, Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty, Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials, Subdifferential Formulae for the Supremum of an Arbitrary Family of Functions, Generalized Differentiation of Probability Functions Acting on an Infinite System of Constraints, Convexity and Variational Analysis, Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings, Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization, Constraint qualification with Schauder basis for infinite programming problems, Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints, Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem, Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming, Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems, Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications, Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets, Optimality conditions for semi-infinite programming problems involving generalized convexity, Lagrange multiplier characterizations of constrained best approximation with infinite constraints, On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming, New extremal principles with applications to stochastic and semi-infinite programming, An improved bootstrap test for restricted stochastic dominance, Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization, Optimality conditions in convex multiobjective SIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
• Semi-infinite programming
• Nonsmooth analysis
• Normal cones to infinite intersections
• Generalized semi-infinite optimization: A first order optimality condition and examples
• Semi-infinite optimization: Structure and stability of the feasible set
• Bi-level strategies in semi-infinite programming.
• Qualification and optimality conditions for dc programs with infinite constraints
• On strong and total Lagrange duality for convex optimization problems
• Techniques of variational analysis
• Variational Analysis in Semi-Infinite and Infinite Programming, II: Necessary Optimality Conditions
• Semi-Infinite Programming: Theory, Methods, and Applications
• Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
• Subdifferentials of Marginal Functions in Semi-infinite Programming
• Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions
• Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
• Semi-infinite programming, duality, discretization and optimality conditions†
• Variational Analysis
• Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
• New Farkas-type constraint qualifications in convex infinite programming
• Semi-infinite programming. Recent advances