An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...

‎Many optimization problems can be reduced to a problem with an increasing and co-radiant objective function by a suitable transformation of variables. Functions, which are increasing and co-radiant, have found many applications in microeconomic analysis. In this paper, the abstract convexity of positive valued affine increasing and co-radiant (ICR) functions are discussed. Moreover, the ...

interval-valued intuitionistic fuzzy sets (ivifss) are widely used to handle uncertainty and imprecision in decision making. however, in more complicated environment, it is difficult to express the uncertain information by an ivifs with considering the decision-making preference. hence, this paper proposes a group generalized interval-valued intuitionistic fuzzy soft set (g-givifss) which conta...

Existence theorems of generalized variational inequalities and generalized complementarity problems are obtained in topological vector spaces for demi operators which are upper hemicontinuous along line segments in a convex set X . Fixed point theorems are also given in Hilbert spaces for set-valued operators T which are upper hemicontinuous along line segments in X such that I − T are demi ope...

In this paper we consider a elastic vector-valued Allen-Cahn MPCC (Mathematical Programs with Complementarity Constraints) problem. We use a regularization approach to get the optimality system for the subproblems. By passing to the limit in the optimality conditions for the regularized subproblems, we derive certain generalized first-order necessary optimality conditions for the original problem.