In this paper, the concepts of $L$-concave structures, concave $L$-interior operators and concave $L$-neighborhood systems are introduced. It is shown that the category of $L$-concave spaces and the category of concave $L$-interior spaces are isomorphic, and they are both isomorphic to the category of concave $L$-neighborhood systems whenever $L$ is a completely distributive lattice. Also, it i...

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 the field of nonlinear programming (in continuous variables) convex analysis [22, 23] plays a pivotal role both in theory and in practice. An analogous theory for discrete optimization (nonlinear integer programming), called " discrete convex analysis " [18, 17], is developed for L-convex and M-convex functions by adapting the ideas in convex analysis and generalizing the results in matroid ...

in this paper, we describe our implementation of an interior point algorithm for large scale systems. first we identify system with small and medium methods convex optimization, then we use interior point method for identification. finally we offer an interior point method that uses nonlinear cost function and see that we achieve a good trade-off between error and cpu time. actually, in this pa...

In the frame of fractional calculus, term convexity is primarily utilized to address several challenges in both pure and applied research. The main focus objective this review paper present Hermite–Hadamard (H-H)-type inequalities involving a variety classes convexities pertaining integral operators. Included various are classical convex functions, m-convex r-convex (α,m)-convex (α,m)-geometric...

In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibil...

In this paper, we define the almost uniform convergence and the almost everywhere convergence for cone-valued functions with respect to an operator valued measure. We prove the Egoroff theorem for Pvalued functions and operator valued measure θ : R → L(P, Q), where R is a σ-ring of subsets of X≠ ∅, (P, V) is a quasi-full locally convex cone and (Q, W) is a locally ...

We define a class of L-convex-concave subsets of RP n , where L is a projective sub-space of dimension l in RP n. These are sets whose sections by any (l+1)-dimensional space L ′ containing L are convex and concavely depend on L ′. We introduce an L-duality for these sets, and prove that the L-dual to an L-convex-concave set is an L *-convex-concave subset of (RP n) *. We discuss a version of A...