E-convexity and its generalizations
From MaRDI portal
Publication:2885553
DOI10.1080/00207160.2011.589899zbMath1253.26017OpenAlexW1965773662MaRDI QIDQ2885553
Publication date: 23 May 2012
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2011.589899
multi-objective optimizationdirectional derivative\(E\)-convexity\(E\)-pseudoconvexity\(E\)-quasiconvexityslack 2-convex set
Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Convexity of real functions in one variable, generalizations (26A51) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items
Unnamed Item, On slack $2$-geodesic convex set and geodesic $E$-pseudoconvex function with application, On the exactness and the convergence of the \(l_1\) exact penalty \(E\)-function method for \(E\)-differentiable optimization problems, \(E\)-subdifferential of \(E\)-convex functions and its applications to minimization problem, Hermite–Hadamard type inequality for (E, F)-convex functions and geodesic (E, F)-convex functions, Optimality conditions for \(E\)-differentiable vector optimization problems with the multiple interval-valued objective function, (F, K, b)-vex sets and some related properties
Cites Work
- Unnamed Item
- Unnamed Item
- Some properties of semi-\(E\)-preinvex maps in Banach spaces
- Some properties of \(E\)-convex functions
- Generalized Minty vector variational-like inequalities and vector optimization problems
- Nonsmooth multiobjective optimization using limiting subdifferentials
- Multiple-objective programs in Banach spaces: sufficiency for (proper) optimality
- The gap function for optimization problems in Banach spaces
- On sufficiency of the Kuhn-Tucker conditions
- B-vex functions
- \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
- Some properties of semi-\(E\)-convex functions.
- Optimality criteria in \(E\)-convex programming
- On the \(E\)-epigraph of an \(E\)-convex function
- Infinite (semi-infinite) problems to characterize the optimality of nonlinear optimization problems
- A proof for Antczak's mean value theorem in invexity analysis
- Optimality for nonsmooth fractional multiple objective programming
- A mean value theorem in Asplund spaces
- Semilocal E-convexity and semilocal E-convex programming
- Variational Analysis and Generalized Differentiation I
- A characterization of quasiconvex vector-valued functions
- On optimality and duality for multiple-objective optimization under generalized type I univexity
- On \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
