Abstract: Our purpose of this paper is to solve a class of stochastic linear complementarity problems (SLCP) with finitely many elements. Based on a new stochastic linear complementarity problem function, a new semi-smooth least squares reformulation of the stochastic linear complementarity problem is introduced. For solving the semi-smooth least squares reformulation, we propose a feasible non...

We present a new training rule for a single-layered linear network with complex valued weights and activation levels. This novel network can be used to extract the principal components of a complex valued data set. We also introduce a new training method that reduces the training time of the complex valued as well as of the real valued network. The use of the new network and training algorithm ...

Two results on the second-order-cone complementarity problem are presented. We show that the squared smoothing function is strongly semismooth. Under monotonicity and strict feasibility we provide a new proof, based on a penalized natural complementarity function, for the solution set of the second-order-cone complementarity problem being bounded. Numerical results of squared smoothing Newton a...

The aim of the present paper is to introduce the concept of joint common limit range property ((JCLR) property) for single-valued and set-valued maps in non-Archimedean fuzzy metric spaces. We also list some examples to show the difference between (CLR) property and (JCLR) property. Further, we establish common fixed point theorems using implicit relation with integral contractive condition. Se...

Several papers have appeared recently establishing the analyticity of the central path at the boundary point for both linear programming (LP) and linear complementarity problems (LCP). While the proofs for LP are long, proceeding from limiting properties of the corresponding derivatives, the proofs for LCP are very simple, consisting of an application of the implicit function theorem to a certa...

In this paper, the generalized complementarity problem is formulated as an uncon-strained optimization problem. Our results generalize the results of 9]. The dimen-sionality of the unconstrained problem is the same as that of the original problem. If the mapping of generalized complementarity problem is diierentiable, the objective function of the unconstrained problem is also diierentiable. Al...

T paper shows how many types of combinatorial problems can be embedded in continuous space and solved as nonconvex optimization problems. If the objective function and the constraints are linear, problems of this kind can be formulated as linear complementarity problems. An algorithm is presented to solve this type of problem and indicate its convergence properties. Computational comparisons ar...

A simple and uniied analysis is provided on the rate of local convergence for a class of high-order-infeasible-path-following algorithms for the P-linear complementarity problem (P-LCP). It is shown that the rate of local convergence of a-order algorithm with a centering step is + 1 if there is a strictly complementary solution and (+ 1)=2 otherwise. For the-order algorithm without the centerin...

Several query mapping algorithms have been proposed to translate XML queries into SQL queries for a schema-based relational XML storage. However, existing query mapping algorithms only support single-valued mapping schemes, in which each XML element type is mapped to exactly one relation, and do not support multi-valued mapping schemes, in which each XML element type can be mapped to multiple r...