Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators

Cites Work

Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications
Semi-infinite optimization under convex function perturbations: Lipschitz stability
Convexifactors, generalized convexity, and optimality conditions
Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
On approximate efficiency in multiobjective programming
\(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
Epsilon efficiency
A generalized derivative for calm and stable functions
Nonsmooth calculus, minimality, and monotonicity of convexificators
Hunting for a smaller convex subdifferential
Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
How to solve a semi-infinite optimization problem
Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications
Constraint Qualifications in Semi-Infinite Systems and Their Applications in Nonsmooth Semi-Infinite Problems with Mixed Constraints
Subdifferentials of Marginal Functions in Semi-infinite Programming
Optimization and nonsmooth analysis
Approximate subdifferentials and applications II
Necessary conditions for ε-optimality
Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C¹-Optimization
A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
Calmness Modulus of Linear Semi-infinite Programs
Optimality and duality for nonsmooth minimax programming problems using convexifactor
Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications
New Farkas-type constraint qualifications in convex infinite programming
Convex Analysis
Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item