Optimality conditions for non-smooth semi-infinite programming
From MaRDI portal
Publication:2786319
DOI10.1080/02331930802434823zbMath1195.90088OpenAlexW2044355818MaRDI QIDQ2786319
Soghra Nobakhtian, Nader Kanzi
Publication date: 21 September 2010
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930802434823
Nonsmooth analysis (49J52) Semi-infinite programming (90C34) Markov and semi-Markov decision processes (90C40)
Related Items (27)
Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ Solving vector interval-valued optimization problems with infinite interval constraints via integral-type penalty function ⋮ Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems ⋮ A Unified Study of Necessary and Sufficient Optimality Conditions for Minimax and Chebyshev Problems with Cone Constraints ⋮ Constraint qualifications in nonsmooth optimization: Classification and inter-relations ⋮ Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems ⋮ Stationarity and regularity of infinite collections of sets: applications to infinitely constrained optimization ⋮ Optimality conditions and duality for nonsmooth multiobjective semi-infinite programming problems on Hadamard manifolds ⋮ Optimality and duality analysis for multiobjective interval-valued semi-Infinite optimization problem having vanishing constraints ⋮ 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 ⋮ Optimality and duality for multiobjective semi-infinite variational problem using higher-order B-type I functions ⋮ Isolated efficiency in nonsmooth semi-infinite multi-objective programming ⋮ Nonsmooth semi-infinite multiobjective optimization problems ⋮ 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 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 ⋮ Multi-objective semi-infinite variational problem and generalized invexity ⋮ Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions ⋮ Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints ⋮ Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexity
Cites Work
- On constraint qualifications in nonsmooth optimization.
- Semi-infinite programming
- Constraint qualifications in nonsmooth multiobjective optimization
- A Lagrange multiplier rule with small convex-valued subdifferentials for nonsmooth problems of mathematical programming involving equality and nonfunctional constraints
- Strict lower semicontinuity of the level sets and invexity of a locally Lipschitz function
- Locally Farkas-Minkowski systems in convex semi-infinite programming
- On strong and total Lagrange duality for convex optimization problems
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- Optimality conditions for nondifferentiable convex semi-infinite programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Directionally Lipschitzian Functions and Subdifferential Calculus
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- New Farkas-type constraint qualifications in convex infinite programming
This page was built for publication: Optimality conditions for non-smooth semi-infinite programming
