Nonsmooth semi-infinite programming problems with mixed constraints
From MaRDI portal
Publication:2518285
DOI10.1016/j.jmaa.2008.10.009zbMath1172.90019OpenAlexW2056604947MaRDI QIDQ2518285
Nader Kanzi, Soghra Nobakhtian
Publication date: 15 January 2009
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2008.10.009
Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items (17)
Saddle point criteria in nonsmooth semi-infinite minimax fractional programming problems ⋮ Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints ⋮ Constraint qualifications in nonsmooth optimization: Classification and inter-relations ⋮ Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems ⋮ Unnamed Item ⋮ Nonsmooth semi-infinite programming problem using limiting subdifferentials ⋮ Optimality conditions for nonsmooth semi-infinite multiobjective programming ⋮ Optimality conditions for semi-infinite programming problems involving generalized convexity ⋮ On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data ⋮ Nonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexity ⋮ Duality for nonsmooth semi-infinite programming problems ⋮ How to solve a semi-infinite optimization problem ⋮ Necessary optimality conditions for nonsmooth semi-infinite programming problems ⋮ Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems ⋮ Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming ⋮ Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems
Cites Work
- Semi-infinite programming
- A generalized derivative for calm and stable functions
- Locally Farkas-Minkowski linear inequality systems
- Recent contributions to linear semi-infinite optimization
- Locally Farkas-Minkowski systems in convex semi-infinite programming
- Qualitative properties of trajectories of control systems: a survey
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- Optimality conditions for nondifferentiable convex semi-infinite programming
- An overview of semi-infinite programming theory and related topics through a generalization of the alternative theorems
- Variational Analysis
- Convergence Conditions for Nonlinear Programming Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Nonsmooth semi-infinite programming problems with mixed constraints
