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

Recommendations

Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
scientific article; zbMATH DE number 7238249
Optimality Conditions for Approximate Solutions of Nonsmooth Semi-Infinite Vector Optimization Problems
Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems

Cites work

scientific article; zbMATH DE number 3662118 (Why is no real title available?)
scientific article; zbMATH DE number 1214046 (Why is no real title available?)
scientific article; zbMATH DE number 1070896 (Why is no real title available?)
scientific article; zbMATH DE number 823381 (Why is no real title available?)
A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
A generalized derivative for calm and stable functions
Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C¹-Optimization
Approximate quasi efficient solutions in multiobjective optimization
Approximate subdifferentials and applications II
Calmness modulus of linear semi-infinite programs
Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
Characterizations of solution sets of a class of nonconvex semi-infinite programming problems
Characterizations of the solution set for nonconvex semi-infinite programming problems
Constraint qualifications in semi-infinite systems and their applications in nonsmooth semi-infinite problems with mixed constraints
Convex Analysis
Convexifactors, generalized convexity, and optimality conditions
Epsilon efficiency
How to solve a semi-infinite optimization problem
Hunting for a smaller convex subdifferential
Necessary conditions for ε-optimality
New Farkas-type constraint qualifications in convex infinite programming
Nonsmooth calculus, minimality, and monotonicity of convexificators
On approximate efficiency in multiobjective programming
Optimality and duality for nonsmooth minimax programming problems using convexifactor
Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications
Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications
Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
Optimization and nonsmooth analysis
Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
Semi-infinite optimization under convex function perturbations: Lipschitz stability
Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
Subdifferentials of marginal functions in semi-infinite programming
Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
\(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints

Cited in

(9)

-optimal solutions in nonconvex semi-infinite programs with support functions
On approximate quasi Pareto solutions in nonsmooth semi-infinite interval-valued vector optimization problems
scientific article; zbMATH DE number 7238249 (Why is no real title available?)
Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l₁- and l_∞-norms
Approximate quasi-efficient solutions of nonsmooth multiobjective semi-infinite programming problems in terms of tangential subdifferentials
Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
Almost \(\varepsilon\)-quasi solutions for nonconvex semi-infinite optimization problems
Approximate optimality in semi infinite programming

This page was built for publication: Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using \(\varepsilon\)-upper semi-regular semi-convexificators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5865281)