Results 21 to 30 of about 565 (171)
Generalized (ρ,θ)-η Invariant Monotonicity and Generalized (ρ,θ)-η Invexity of Nondifferentiable Functions [PDF]
New concepts of generalized (ρ,θ)-η invex functions for non-differentiable functions and generalized (ρ,θ)-η invariant monotone operators for set-valued mappings are introduced.
Caiping Liu, Xinmin Yang
doaj +2 more sources
-invexity in multiobjective optimization
In this paper, a generalization of convexity is considered in the case of multiobjective optimization problems, where the functions involved are non-differentiable. Under d-rho-(eta, theta)-invexity assumptions on the functions involved, weak, strong and
C. Nahak, R.N. Mohapatra
core +3 more sources
On a Nonsmooth Vector Optimization Problem with Generalized Cone Invexity [PDF]
By using Clarke’s generalized gradients we consider a nonsmooth vector optimization problem with cone constraints and introduce some generalized cone-invex functions called K-α-generalized invex, K-α-nonsmooth invex, and other related functions.
Hehua Jiao, Sanyang Liu
doaj +2 more sources
Invex optimization revisited [PDF]
Given a non-convex optimization problem, we study conditions under which every Karush-Kuhn-Tucker (KKT) point is a global optimizer. This property is known as KT-invexity and allows to identify the subset of problems where an interior point method always converges to a global optimizer. In this work, we provide necessary conditions for KT-invexity in n-
Ksenia Bestuzheva, Hassan L. Hijazi
openaire +4 more sources
Global invexity is characterized by a condition which is independent of the scale function describing the invexity. Consequently, weak duality holds for the Wolfe, or Mond-Weir, dual problem when a sufficient invexity hypothesis is replaced by a suitable
Craven, Bruce Desmond
core +5 more sources
Invex optimisation problems [PDF]
In this paper we extend the concept of invexity to set-valued maps and study vector optimisation problems with invex set-valued data. Necessary and sufficient optimality conditions are established in terms of contingent derivatives. Wolfe type dual problems are constructed via two recently developed approaches which guarantee the zero-gap duality ...
Dinh The Luc, Malivert, C.
openaire +2 more sources
Sufficient conditions for invexity [PDF]
In this paper, we show that the Robinson, Nguyen–Strodiot–Mifflin and Jourani constraint qualifications are sufficient conditions for invexity of constrained functions with respect to the same scale function in Lipschitzian mathematical programmings. A Kuhn-Tucker necessary optimality condition is also given under the constraint qualification on the ...
Nguyen Xuan Ha, Do Van Luu
openaire +1 more source
On duality for nonsmooth Lipschitz optimization problems [PDF]
We present some duality theorems for a non-smooth Lipschitz vector optimization problem. Under generalized invexity assumptions on the functions the duality theorems do not require constraint qualifications.
Preda Vasile +2 more
doaj +1 more source
Sufficient optimality criteria and duality for multiobjective variational control problems with B-(p,r)-invex functions [PDF]
In this paper, we generalize the notion of \(B\)-\((p,r)\)-invexity introduced by Antczak in [A class of \(B\)-\((p; r)\)-invex functions and mathematical programming, J. Math. Anal. Appl. 286 (2003), 187-206] for scalar optimization problems to the case
Tadeusz Antczak, Manuel Arana Jiménez
doaj +1 more source
In this article, we extend the generalized invexity and duality results for multiobjective variational problems with fractional derivative pertaining to an exponential kernel by using the concept of weak minima.
Dubey Ved Prakash +4 more
doaj +1 more source

