Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
From MaRDI portal
Publication:976438
DOI10.1016/J.EJOR.2009.12.025zbMATH Open1188.90261OpenAlexW1973883268MaRDI QIDQ976438FDOQ976438
Authors: Nader Kanzi, S. 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
Recommendations
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- Optimality conditions for non-smooth semi-infinite programming
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
- Optimality conditions for nonsmooth semi-infinite multiobjective programming
- Optimality conditions for nonsmooth generalized semi-infinite programs
nonsmooth optimizationoptimality conditionLagrangianconstraint qualificationgeneralized semi-infinite programmingmordukhovich subdifferential
Nonsmooth analysis (49J52) Semi-infinite programming (90C34) Markov and semi-Markov decision processes (90C40)
Cites Work
- Variational Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Title not available (Why is that?)
- Variational Stability and Marginal Functions via Generalized Differentiation
- Subgradients of marginal functions in parametric mathematical programming
- Bi-level strategies in semi-infinite programming.
- On generalized semi-infinite optimization of genetic networks
- Title not available (Why is that?)
- Generalized semi-infinite optimization : theory and applications in optimal control and discrete optimization
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Title not available (Why is that?)
- Convex analysis and nonlinear optimization. Theory and examples
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Nonsmooth semi-infinite programming problems with mixed constraints
- First-order optimality conditions in generalized semi-infinite programming
- Generalized semi-infinite programming: Theory and methods
- First-order optimality conditions for degenerate index sets in generalized semi-infinite optimi\-zation.
- First order optimality conditions for generalized semi-infinite programming problems
- Solving generalized semi-infinite programs by reduction to simpler problems
- Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
- Second-order optimality conditions in generalized semi-infinite programming
- On optimality conditions for generalized semi-infinite programming problems
- An algorithm for solving two-level convex optimization problems
- On convex lower level problems in generalized semi-infinite optimization.
Cited In (21)
- Optimality conditions for nonsmooth semi-infinite multiobjective programming
- Necessary and sufficient conditions in smooth programming with generalized convexity
- Upper level qualifications and optimality in multiobjective convex generalized semi-infinite problems
- Optimality conditions for nonsmooth generalized semi-infinite programs
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- Necessary conditions and duality for inexact nonlinear semi-infinite programming problems
- Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
- Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition
- Fritz-John type necessary conditions for optimality of convex generalized semi-infinite optimization problems
- Non-convex semi-infinite min-max optimization with noncompact sets
- How to solve a semi-infinite optimization problem
- How to solve a design centering problem
- Optimality conditions for non-smooth semi-infinite programming
- Lower level duality and the global solution of generalized semi-infinite programs
- Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems
- Title not available (Why is that?)
- On first-order necessary conditions for optimality of regular generalized semi-infinite programming
- Levitin-Polyak well-posedness for generalized semi-infinite multiobjective programming problems
This page was built for publication: Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976438)
