Results 41 to 50 of about 278 (165)
Fractal and Fractional, 2023 In this study, we apply a recently developed idea of up and down fuzzy-ordered relations between two fuzzy numbers. Here, we consider fuzzy Riemann–Liouville fractional integrals to establish the Hermite–Hadamard-, Fejér-, and Pachpatte-type inequalities.
Muhammad Bilal Khan +3 more
doaj +1 more source
On locally Lipschitz vector-valued invex functions [PDF]
Bulletin of the Australian Mathematical Society, 1993 The four types of invexity for locally Lipschitz vector-valued functions recently introduced by T. W. Reiland are studied in more detail. It is shown that the class of restricted K-invex in the limit functions is too large to obtain desired optimisation theorems and the other three classes are contained in the class of functions which are invex 0 in ...
Yen, N. D., Sach, P. H.
openaire +2 more sources
Interval‐valued Caputo–Fabrizio fractional derivative in continuous programming
Asian Journal of Control, Volume 28, Issue 1, Page 497-514, January 2026.Abstract This study investigates a novel class of variational programming problems characterized by fractional interval values, formulated under the Caputo–Fabrizio fractional derivative with an exponential kernel. Invex and generalized invex functions are used to discuss the Mond–Weir‐type dual problem for the considered variational problem.
Krishna Kummari +2 more
wiley +1 more source
Journal of Mathematics, Volume 2026, Issue 1, 2026.This article develops new Hermite–Hadamard and Jensen‐type inequalities for the class of (α, m)‐convex functions. New product forms of Hermite–Hadamard inequalities are established, covering multiple distinct scenarios. Several nontrivial examples and remarks illustrate the sharpness of these results and demonstrate how earlier inequalities can be ...
Shama Firdous +5 more
wiley +1 more source
Invex functions and constrained local minima [PDF]
Bulletin of the Australian Mathematical Society, 1981 If a certain weakening of convexity holds for the objective and all constraint functions in a nonconvex constrained minimization problem, Hanson showed that the Kuhn-Tucker necessary conditions are sufficient for a minimum. This property is now generalized to a property, called K-invex, of a vector function in relation to a convex cone K.
openaire +2 more sources
Approximations of objective function and constraints in bi-criteria optimization problems
Journal of Numerical Analysis and Approximation Theory, 2018 In this paper we study approximation methods for solving bi-criteria optimization problems. Initial problem is approximated by a new one which has the components of the objective and the constraints are replaced by their approximation functions ...
Traian Ionut Luca, Dorel I. Duca
doaj +2 more sources
Minimax fractional programming involving generalised invex functions [PDF]
The ANZIAM Journal, 2003 AbstractThe convexity assumptions for a minimax fractional programming problem of variational type are relaxed to those of a generalised invexity situation. Sufficient optimality conditions are established under some specific assumptions. Employing the existence of a solution for the minimax variational fractional problem, three dual models, the Wolfe ...
Lai, H. C., Liu, J. C.
openaire +2 more sources
Analysis of the Whiplash gradient descent dynamics
Asian Journal of Control, Volume 27, Issue 1, Page 27-40, January 2025.Abstract In this paper, we propose the Whiplash inertial gradient dynamics, a closed‐loop optimization method that utilizes gradient information. We introduce the symplectic asymptotic convergence analysis for the Whiplash system for convex functions.
Subhransu S. Bhattacharjee +1 more
wiley +1 more source
Vector optimization problems and approximated vector optimization problems
Journal of Numerical Analysis and Approximation Theory, 2010 In this paper, a so-called approximated vector optimization problem associated to a vector optimization problem is considered. The equivalence between the efficient solutions of the approximated vector optimization problem and efficient solutions of the ...
Eugenia Duca, Dorel I. Duca
doaj +2 more sources
Journal of Function Spaces, Volume 2025, Issue 1, 2025.The connection between generalized convexity and analytic operators is deeply rooted in functional analysis and operator theory. To put the ideas of preinvexity and convexity even closer together, we might state that preinvex functions are extensions of convex functions. Integral inequalities are developed using different types of order relations, each
Zareen A. Khan +2 more
wiley +1 more source