Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
From MaRDI portal
Publication:976438
DOI10.1016/j.ejor.2009.12.025zbMath1188.90261OpenAlexW1973883268MaRDI QIDQ976438
Nader Kanzi, Soghra Nobakhtian
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.12.025
nonsmooth optimizationLagrangianoptimality conditionconstraint qualificationgeneralized semi-infinite programmingmordukhovich subdifferential
Nonsmooth analysis (49J52) Semi-infinite programming (90C34) Markov and semi-Markov decision processes (90C40)
Related Items
How to solve a design centering problem ⋮ Non-convex semi-infinite min-max optimization with noncompact sets ⋮ An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition ⋮ Optimality conditions for nonsmooth semi-infinite multiobjective programming ⋮ Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications ⋮ How to solve a semi-infinite optimization problem ⋮ Optimality conditions for nonsmooth generalized semi-infinite programs ⋮ Unnamed Item ⋮ Levitin-Polyak well-posedness for generalized semi-infinite multiobjective programming problems ⋮ Lower level duality and the global solution of generalized semi-infinite programs ⋮ Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- First order optimality conditions for generalized semi-infinite programming problems
- Subgradients of marginal functions in parametric mathematical programming
- Generalized semi-infinite optimization: A first order optimality condition and examples
- First-order optimality conditions in generalized semi-infinite programming
- Bi-level strategies in semi-infinite programming.
- On optimality conditions for generalized semi-infinite programming problems
- Convex analysis and nonlinear optimization. Theory and examples
- Generalized semi-infinite programming: Theory and methods
- Nonsmooth semi-infinite programming problems with mixed constraints
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- On generalized semi-infinite optimization of genetic networks
- First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization
- An algorithm for solving two-level convex optimization problems
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Variational Analysis
- Solving generalized semi-infinite programs by reduction to simpler problems
- Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
- Variational Stability and Marginal Functions via Generalized Differentiation
- Generalized semi-infinite optimization : theory and applications in optimal control and discrete optimization
- Second-order optimality conditions in generalized semi-infinite programming