Necessary conditions in generalized semi-infinite optimization with nondifferentiable convex data
From MaRDI portal
Publication:5094791
DOI10.30495/JME.V0I0.2182MaRDI QIDQ5094791FDOQ5094791
Authors: Hamed Soroush 
Publication date: 4 August 2022
Recommendations
- Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
- Fritz-John type necessary conditions for optimality of convex generalized semi-infinite optimization problems
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
- Optimality conditions for semi-infinite programming problems involving generalized convexity
- Generalized convexity in nondifferentiable programming
subdifferentialnecessary optimality conditionconstraint qualificationgeneralized semi-infinite programming
Nonsmooth analysis (49J52) Semi-infinite programming (90C34) Markov and semi-Markov decision processes (90C40)
Cites Work
- Convex Analysis
- Bi-level strategies in semi-infinite programming.
- Set-valued mappings and enlargement of monotone operators.
- Title not available (Why is that?)
- Generalized semi-infinite optimization: A first order optimality condition and examples
- First-order optimality conditions in generalized semi-infinite programming
- First-order optimality conditions for degenerate index sets in generalized semi-infinite optimi\-zation.
- Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
- On linear and linearized generalized semi-infinite optimization problems
- On optimality conditions for generalized semi-infinite programming problems
- On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
- An algorithm for solving two-level convex optimization problems
- On convex lower level problems in generalized semi-infinite optimization.
- Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
- Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
- On existence and uniqueness of stationary points in semi-infinite optimization
- Optimality, scalarization and duality in linear vector semi-infinite programming
- Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems
- Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems
- Karush-Kuhn-Tucker types optimality conditions for non-smooth semi-infinite vector optimization problems
- Fritz-John type necessary conditions for optimality of convex generalized semi-infinite optimization problems
Cited In (4)
- Upper level qualifications and optimality in multiobjective convex generalized semi-infinite problems
- Generalized convexity in nondifferentiable programming
- Necessary conditions for constrained optimization problems with semicontinuous and continuous data
- Fritz-John type necessary conditions for optimality of convex generalized semi-infinite optimization problems
This page was built for publication: Necessary conditions in generalized semi-infinite optimization with nondifferentiable convex data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094791)
