• No results found

linear complementarity

Solution of Bimatrix Games with Interval Data Using Linear Complementarity Problem

Solution of Bimatrix Games with Interval Data Using Linear Complementarity Problem

... Games that are not zero-sum games are called non-zero-sum games or bimatrix games. In bimatrix games it is difficult to define an optimum strategy. However, in this case, an equilibrium pair of strategies can be defined ...

9

The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems

The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems

... for linear complementarity problems with sufficient matrices, using s -monotone pivot ...of linear complementarity problems [13] and with its EP theorem form ...

37

An alternative error bound for linear complementarity problems involving \(B^{S}\) matrices

An alternative error bound for linear complementarity problems involving \(B^{S}\) matrices

... The Linear Complementarity ...K.G.: Linear Complementarity, Linear and Nonlinear ...P-matrix linear complementarity ...

9

Kernel function based interior point methods for horizontal linear complementarity problems

Kernel function based interior point methods for horizontal linear complementarity problems

... It is well known that each kernel function defines an interior-point algorithm. In this paper we propose new classes of kernel functions whose form is different from known kernel functions and define interior-point methods ...

15

A New Conjugate Gradient Projection Method for Solving Stochastic Generalized Linear Complementarity Problems

A New Conjugate Gradient Projection Method for Solving Stochastic Generalized Linear Complementarity Problems

... In this paper, a class of the stochastic generalized linear complementarity problems with finitely many elements is proposed for the first time. Based on the Fischer-Burmeister function, a new conjugate ...

8

Modulus Based Matrix Splitting Iteration Methods for a Class of Stochastic Linear Complementarity Problem

Modulus Based Matrix Splitting Iteration Methods for a Class of Stochastic Linear Complementarity Problem

... stochastic linear complementarity prob- lem (SLCP) in finite sample space into a constrained minimization problem, and solved it with the Feasible Semi-smooth Newton ...

10

Error bounds for linear complementarity problems of weakly chained diagonally dominant B matrices

Error bounds for linear complementarity problems of weakly chained diagonally dominant B matrices

... In this paper, new error bounds for the linear complementarity problem are obtained when the involved matrix is a weakly chained diagonally dominant B-matrix. The proposed error bounds are better than some ...

8

An active set algorithm for a class of linear complementarity problems arising from rigid body dynamics

An active set algorithm for a class of linear complementarity problems arising from rigid body dynamics

... An active set algorithm is introduced for positive definite and positive semi definite linear complementarity problems. The proposed algorithm is composed of two phases. Phase 1, the feasibility phase and ...

14

Multisplitting Iterative Methods with General Weighting Matrices for Solving Symmetric Positive Linear Complementarity Problem

Multisplitting Iterative Methods with General Weighting Matrices for Solving Symmetric Positive Linear Complementarity Problem

... Abstract. In this paper, by making use of optimal models, we study the weighting matrices of the multisplitting parallel methods for solving the symmetric positive definite linear complementarity problem, ...

5

A New Dimension Algorithmic Approach to Solve Fuzzy Linear Complementarity Problem with Interval Numbers Approach

A New Dimension Algorithmic Approach to Solve Fuzzy Linear Complementarity Problem with Interval Numbers Approach

... The linear Complementarity problem (LCP) is a well known mathematical programming and it has been studied by many ...a complementarity pivoting algorithm for solving linear ...

6

A generalized Newton method of high order convergence for solving the large scale linear complementarity problem

A generalized Newton method of high order convergence for solving the large scale linear complementarity problem

... the complementarity problem, the nonlinear programming problem, the variational inequality problem, the discretization problem of partial differential equations, the maximal monotone operator problem, ...

12

On complexity of a new Mehrotra type interior point algorithm for \(P {*}(\kappa )\) linear complementarity problems

On complexity of a new Mehrotra type interior point algorithm for \(P {*}(\kappa )\) linear complementarity problems

... In this paper, a variant of Mehrotra-type predictor–corrector algorithm is proposed for P ∗ ( κ ) linear complementarity problems. In this algorithm, a safeguard step is used to avoid small step sizes and a ...

13

An Interval Matrix Based Generalized Newton Method for Linear Complementarity Problems

An Interval Matrix Based Generalized Newton Method for Linear Complementarity Problems

... Although the studies solving for the linear complementarity problem based on the nonlinear penalized equa- tion have good results. But there is no method that is given for solving the nonlinear penalized ...

7

An improved error bound for linear complementarity problems for B matrices

An improved error bound for linear complementarity problems for B matrices

... The Linear Complementarity ...KG: Linear Complementarity, Linear and Nonlinear ...P-matrix linear complementarity ...

10

On the preconditioned GAOR method for a linear complementarity problem with an M matrix

On the preconditioned GAOR method for a linear complementarity problem with an M matrix

... Recently, based on the Hadjidimos preconditioner, a preconditioned GAOR method was proposed for solving the linear complementarity problem (Liu and Li in East Asian J. Appl. Math. 2:94–107, 2012). In this ...

12

New global error bound for extended linear complementarity problems

New global error bound for extended linear complementarity problems

... extended linear complementarity problem (ELCP), by virtue of a new residual function, we establish a new type of global error bound under weaker ...vertical linear complementarity problem and ...

16

A Singular Values Based Newton Method for Linear Complementarity Problems

A Singular Values Based Newton Method for Linear Complementarity Problems

... the linear complementarity ...the linear complementarity problem when the singular values of A exceed 1 and Han [15] the interval matrix [ A A , + λ k I ] is ...

6

Large update interior point algorithm for P∗ linear complementarity problem

Large update interior point algorithm for P∗ linear complementarity problem

... It is well known that each barrier function defines an interior point algorithm and each barrier function is determined by its univariate kernel function. In this paper we present a new large-update primal-dual interior ...

12

Multigrid Method for Linear Complementarity Problem and Its Implementation on GPU

Multigrid Method for Linear Complementarity Problem and Its Implementation on GPU

... Abstract—We present the CUDA implementation of the par- allel multigrid solver for the linear complementarity problem. As a smoother, the Projected SOR method is used. We describe implementation of all ...

5

The   Dynamics of Rigid-Viscoplastic Structures as a Linear Complementarity Problem

The Dynamics of Rigid-Viscoplastic Structures as a Linear Complementarity Problem

... It is shown the importance of introducing viscoplasticity effects in the rigid-plastic dynamic analysis since the strain rate sensitivity reduces considerably the dur[r] ...

8

Show all 10000 documents...

Related subjects