First order optimality conditions for generalized semi-infinite programming problems

DOI10.1007/s10957-008-9352-zzbMath1152.90011OpenAlexW2026552356MaRDI QIDQ946193

Jane J. Ye, Soon-Yi Wu

Publication date: 22 September 2008

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-008-9352-z

zbMATH Keywords

necessary optimality conditionsnonsmooth analysisvalue functionconstraint qualificationsgeneralized semi-infinite programming problems

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)

Related Items

Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming ⋮ Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions ⋮ Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems ⋮ A smoothing Levenberg-Marquardt method for generalized semi-infinite programming ⋮ Non-convex semi-infinite min-max optimization with noncompact sets ⋮ Semi-infinite programming method for optimal power flow with transient stability and variable clearing time of faults ⋮ An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition ⋮ Unnamed Item ⋮ Generalized semi-infinite programming: a tutorial ⋮ Solving semi-infinite programs by smoothing projected gradient method ⋮ Nonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexity ⋮ Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity ⋮ ON FIRST-ORDER NECESSARY CONDITIONS FOR OPTIMALITY OF REGULAR GENERALIZED SEMI-INFINITE PROGRAMMING ⋮ How to solve a semi-infinite optimization problem ⋮ Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems ⋮ Bilevel Optimal Control Problems with Pure State Constraints and Finite-dimensional Lower Level ⋮ Levitin-Polyak well-posedness for generalized semi-infinite multiobjective programming problems ⋮ Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity ⋮ Constraint Qualifications and Optimality Conditions in Bilevel Optimization ⋮ On semi-infinite minmax programming with generalized invexity ⋮ Sufficient Optimality Conditions in Bilevel 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
• Unnamed Item
• Unnamed Item
• On constraint qualifications in nonsmooth optimization.
• Convexity and concavity properties of the optimal value function in parametric nonlinear programming
• Generalized semi-infinite programming: a tutorial
• Generalized semi-infinite optimization: A first order optimality condition and examples
• First-order optimality conditions in generalized semi-infinite programming
• Optimization. Algorithms and consistent approximations
• Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
• Bi-level strategies in semi-infinite programming.
• On optimality conditions for generalized semi-infinite programming problems
• On generalized semi-infinite optimization and bilevel optimization
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Generalized semi-infinite programming: numerical aspects
• First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization
• Semi-Infinite Programming: Theory, Methods, and Applications
• Optimization and nonsmooth analysis
• Differential properties of the marginal function in mathematical programming
• On level sets of marginal functions
• Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
• Convex Analysis
• Set-valued analysis
• On linear and linearized generalized semi-infinite optimization problems
• Semi-infinite programming. Recent advances