Duality in nondifferentiable minimax fractional programming with
In this article, we are concerned with a nondifferentiable minimax fractional programming problem. We derive the sufficient condition for an optimal solution to the problem and then establish weak, strong, and strict converse duality theorems for the ...
Kailey N +3 more
doaj
Optimization problems and second order approximated optimization problems
In this paper, a so-called second order approximated optimization problem associated to an optimization problem is considered. The equivalence between the saddle points of the lagrangian of the second order approximated optimization problem and optimal ...
Eugenia Duca, Dorel I. Duca
doaj +2 more sources
Longitudinal prospective cohort study evaluating prognosis in idiopathic intracranial hypertension patients with and without comorbid polycystic ovarian syndrome. [PDF]
Thaller M +4 more
europepmc +1 more source
Higher-order duality for multiobjective programming problem involving (Φ,ρ)-invex functions [PDF]
In the present article, we formulate two different kinds of higher-order dual models related to the multi-objective programming problem containing arbitrary norms.
Jayswal, Anurag, Kummari, Krishna
core +1 more source
Optimality Conditions in Nondifferentiable G-Invex Multiobjective Programming [PDF]
We consider a class of nondifferentiable multiobjective programs with inequality and equality constraints in which each component of the objective function contains a term involving the support function of a compact convex set.
Ho Jung Kim +8 more
core +1 more source
Some Characterizations of General Preinvex Functions
In this paper, we consider a new class of general preinvex functions involving an arbitrary function. We show that the optimality condition for general preinvex functions on general invex set can be characterized by a class of variational-like inequality.
Muhammad Uzair Awan +3 more
doaj +2 more sources
Generalized Minimax Programming with Nondifferentiable (G, β)-Invexity
We consider the generalized minimax programming problem (P) in which functions are locally Lipschitz (G, β)-invex. Not only G-sufficient but also G-necessary optimality conditions are established for problem (P ...
D. H. Yuan, X. L. Liu
doaj +1 more source
A one-layer recurrent neural network for constrained nonsmooth invex optimization [PDF]
Invexity is an important notion in nonconvex optimization. In this paper, a one-layer recurrent neural network is proposed for solving constrained nonsmooth invex optimization problems, designed based on an exact penalty function method.
Wang, J, Yan, Z, Li, G
core +1 more source
Semi-E-Preinvex Functions [PDF]
A class of functions called semi--preinvex functions is defined as a generalization of semi--convex functions. Similarly, the concept of semi--quasiconvex functions is also generalized to semi--prequasiinvex functions.
E. Stanley Lee, Yu-Ru Syau
core +1 more source
Invex Nonsmooth Alternative Theorem And Applications [PDF]
An invex constrained nonsmooth optimization problem is considered, in which the presence of an abstract constraint set is possibly allowed. Necessary and sufficient conditions of optimality are provided and weak and strong duality results established ...
Rojas-Medar M.A. +2 more
core

