Results 261 to 270 of about 5,034,416 (318)
Some of the next articles are maybe not open access.

Linear complementarity problems and bi-linear games

Applications of Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sengodan, Gokulraj   +1 more
openaire   +2 more sources

A simple linear complementarity approach for sliding cable modeling considering friction

Mechanical systems and signal processing, 2019
Sliding cable system with friction is encountered in many engineering applications. This system is typically characterized by existence of complex and diverse motion states of sliding nodes (pulleys), which leads to significant difficulties for analysis.
Ziyun Kan, Haijun Peng, B. Chen
semanticscholar   +1 more source

A preconditioned two-step modulus-based matrix splitting iteration method for linear complementarity problem

Applied Mathematics and Computation, 2019
In this paper, a preconditioned two-step modulus-based matrix splitting iteration method for linear complementarity problems associated with an M-matrix is proposed. The convergence analysis of the presented method is given.
Pingfan Dai   +3 more
semanticscholar   +1 more source

The Linear Order Complementarity Problem

Mathematics of Operations Research, 1989
The classical complementarity problem in Euclidean space can be viewed alternatively as a variational inequality or as a lattice orthogonality problem. Generalizations of the former have been extensively studied, but infinite-dimensional analogues of the latter have been largely ignored.
Jonathan M. Borwein, M. A. H. Dempster
openaire   +1 more source

Γ-robust linear complementarity problems

Optim. Methods Softw., 2019
Complementarity problems are often used to compute equilibria made up of specifically coordinated solutions of different optimization problems. Specific examples are game-theoretic settings like the bimatrix game or energy market models like for ...
Vanessa Krebs, Martin Schmidt
semanticscholar   +1 more source

Sparse Linear Complementarity Problems

2013
In this paper, we study the sparse linear complementarity problem, denoted by k-LCP: the coefficient matrix has at most k nonzero entries per row. It is known that 1-LCP is solvable in linear time, while 3-LCP is strongly NP-hard. We show that 2-LCP is strongly NP-hard, while it can be solved in O(n 3 logn) time if it is sign-balanced, i.e., each row ...
Hanna Sumita   +2 more
openaire   +1 more source

Convexification Techniques for Linear Complementarity Constraints

Journal of Global Optimization, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trang T. Nguyen   +2 more
openaire   +1 more source

The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra

Journal of Global Optimization, 2017
A weighted complementarity problem is to find a pair of vectors belonging to the intersection of a manifold and a cone such that the product of the vectors in a certain algebra equals a given weight vector.
Xiaoni Chi, M. Gowda, J. Tao
semanticscholar   +1 more source

The relaxation convergence of multisplitting AOR method for linear complementarity problem

Linear and multilinear algebra, 2018
In this paper, based on the previous work by Bai [On the convergence of the multisplitting methods for the linear complementarity problem. SIAM J Matrix Anal Appl. 1999;21:67–78] and by Zhang et al.
Lu-Bin Cui, Cuixia Li, Shiliang Wu
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy