Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems

DOI10.1007/s10898-011-9828-5zbMath1300.90056MaRDI QIDQ2392776

Nader Kanzi

Publication date: 2 August 2013

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-011-9828-5

zbMATH Keywords

optimality conditions; semi-infinite programming; constraint qualification; DC optimization

Mathematics Subject Classification ID

49J52: Nonsmooth analysis

90C34: Semi-infinite programming

90C40: Markov and semi-Markov decision processes

Related Items

Unnamed Item, Higher-order Karush–Kuhn–Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming, Optimality conditions for nonsmooth generalized semi-infinite programs, Non-convex semi-infinite min-max optimization with noncompact sets, Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming, Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On functions representable as a difference of convex functions
• First order optimality conditions for generalized semi-infinite programming problems
• On the minimization of difference functions
• Generalized semi-infinite optimization: A first order optimality condition and examples
• First-order optimality conditions in generalized semi-infinite programming
• Asymptotic dual conditions characterizing optimality for infinite convex programs
• Bi-level strategies in semi-infinite programming.
• DC programming: overview.
• Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
• First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization
• Optimality conditions for non-smooth semi-infinite programming
• General Semi-Infinite Programming: Symmetric Mangasarian–Fromovitz Constraint Qualification and the Closure of the Feasible Set
• A closedness condition and its applications to DC programs with convex constraints
• Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
• New Farkas-type constraint qualifications in convex infinite programming
• Convex analysis and global optimization