Many fundamental problems in the max-plus-algebraic system theory for discrete event systems — among which the minimal state space realization problem — can be solved using an Extended Linear Complementarity Problem (ELCP). We present some new, more efficient methods to solve the ELCP. We show that an ELCP with a bounded feasible set can be recast as a standard Linear Complementarity Problem (L...

The paper presents a semismooth inexact Newton-type method for solving optimal power flow (OPF) problem. By introducing the nonlinear complementarity problem (NCP) function, the Karush-KuhnTucker (KKT) conditions of OPF model are transformed equivalently into a set of semismooth nonlinear algebraic equations. Then the set of semismooth equations can be solved by an improved inexact LevenbergMar...

In some practical situations, we need to find the avoidance set, i.e., the set of all initial states for which the system never goes into the forbidden region. Algorithms are known for computing the avoidance set in several practically important cases. In this paper, we consider a general case, and we show that, in some reasonable sense, the corresponding general problem is always algorithmical...

This paper describes a novel method for the modeling of intermittent contact in multi-rigid-body problems. We use a complementarity based time-stepping scheme in Featherstone’s Divide and Conquer framework to efficiently model the unilateral and bilateral constraints in the system. The time-stepping scheme relies on impulse-based equations and does not require explicit collision detection. A se...

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...

We study Ε-Henig saddle points and duality of set-valued optimization problems in the setting of real linear spaces. Firstly, an equivalent characterization of Ε-Henig saddle point of the Lagrangian set-valued map is obtained. Secondly, under the assumption of the generalized cone subconvexlikeness of set-valued maps, the relationship between the Ε-Henig saddle point of the Lagrangian set-value...

A general nonlinear framework for an Ishikawa-hybrid proximal point algorithm using the notion of A, η -accretive is developed. Convergence analysis for the algorithm of solving a nonlinear set-valued inclusions problem and existence analysis of solution for the nonlinear set-valued inclusions problem are explored along with some results on the resolvent operator corresponding to A, η -accretiv...

An extension of the linear complementarity problem (LCP) of mathematical programming is the so-called rational complementarity problem (RCP). This problem occurs if complementarity conditions are imposed on input and output variables of linear dynamical input/state/output systems. The resulting dynamical systems are called linear complementarity systems. Since the RCP is crucial both in issues ...

In this paper, firstly, a generalized subconvexlike set-valued map involving the relative algebraic interior is introduced in ordered linear spaces. Secondly, some properties of a generalized subconvexlike set-valued map are investigated. Finally, the optimality conditions of set-valued optimization problem are established.