‎in this paper‎, ‎generalized convex contractions on orthogonal metric spaces are stablished in whath might be called their definitive versions‎. ‎also, we show that‎ there are examples which show that our main theorems are genuine generalizations of theorem 3.1 and 3.2 of cite{r}‎[ m.a. miandaragh, m. postolache, s. rezapour, ‎textit{approximate fixed points of generalizedconvex contractions},...

Perception of contour polarity was investigated in five experiments in which observers had to judge the vertical position of a vertex. When the vertex was perceived as convex, the level of performance as measured by reaction time and errors was higher than when the same vertex was perceived as concave. I conclude that contour polarity affects how observers perceive shape, and in particular part...

In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...

using the fixed point theorem in a‎ ‎cone‎, ‎the existence and multiplicity of radial convex solutions of‎ ‎singular system of monge-amp`{e}re equations are established‎.‎

using the fixed point theorem in a‎ ‎cone‎, ‎the existence and multiplicity of radial convex solutions of‎ ‎singular system of monge-amp`{e}re equations are established‎.‎

In this paper, we study a nonconvex quadratic minimization problem with two constraints, one of which being convex. We introduce convex relaxations (CQRs) and discuss cases, where the is equivalent to exactly CQRs. Particularly, show that global optimal solution can be recovered from an Through equivalence, new conditions under enjoys strong Lagrangian duality, generalizing recent condition in ...

In this paper we determine a closed formula for the number of convex permutominoes of size n. We reach this goal by providing a recursive generation of all convex permutominoes of size n+1 from the objects of size n, according to the ECO method, and then translating this construction into a system of functional equations satisfied by the generating function of convex permutominoes. As a consequ...

In this paper, we first introduce the notion of $c$-affine functions for $c> 0$. Then we deal with some properties of strongly convex functions in real inner product spaces by using a quadratic support function at each point which is $c$-affine. Moreover, a Hyers–-Ulam stability result for strongly convex functions is shown.

‎In this paper‎, ‎we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP)‎, ‎where the constraints and the objective functions are convex‎. ‎We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points‎. ‎The proposed algorithm can be appl...

In this paper, we present some common fixed point theorems for two generalized nonexpansive multivalued mappings in CAT(0) spaces as well as in UCED Banach spaces. Moreover, we prove the existence of fixed points for generalized nonexpansive multivalued mappings in complete geodesic metric spaces with convex metric for which the asymptotic center of a bounded sequence in a bounded closed convex...