Results 21 to 30 of about 8,709,898 (283)

On independent cliques and linear complementarity problems [PDF]

open access: yesIndian Journal of Pure and Applied Mathematics, 2022
Submitted to the SIAM Journal on Discrete ...
Karan N. Chadha, Ankur A. Kulkarni
openaire   +3 more sources

A note on fixed point method and linear complementarity problem

open access: yesJournal of Numerical Analysis and Approximation Theory, 2023
In this article, we present a general form of the fixed point method for processing the large and sparse linear complementarity problem, as well as a general condition for the method's convergence when the system matrix is a \(P\)-matrix and some ...
Bharat Kumar, Deepmala, Arup K Das
doaj   +1 more source

The Monomial Preconditioned SSOR Method for Linear Complementarity Problem

open access: yesIEEE Access, 2019
This paper aims to show that the existing preconditioned symmetric successive over-relaxation (SSOR) approach to solving the linear complementarity problem (LCP) is not valid.
Xinna Mao   +3 more
doaj   +1 more source

Analysis of the implicit Euler time-discretization of passive linear descriptor complementarity systems [PDF]

open access: yesJournal of Nonsmooth Analysis and Optimization, 2022
This article is largely concerned with the time-discretization of descriptor-variable systems coupled to with complementarity constraints. They are named descriptor-variable linear complementarity systems (DVLCS).
Bernard Brogliato, Alexandre Rocca
doaj   +1 more source

The Block Principal Pivoting Algorithm for the Linear Complementarity Problem with an M-Matrix

open access: yesAdvances in Mathematical Physics, 2019
The principal pivoting algorithm is a popular direct algorithm in solving the linear complementarity problem, and its block forms had also been studied by many authors.
Xi-Ming Fang   +2 more
doaj   +1 more source

The Distributionally Robust Optimization Reformulation for Stochastic Complementarity Problems

open access: yesAbstract and Applied Analysis, 2014
We investigate the stochastic linear complementarity problem affinely affected by the uncertain parameters. Assuming that we have only limited information about the uncertain parameters, such as the first two moments or the first two moments as well as ...
Liyan Xu, Bo Yu, Wei Liu
doaj   +1 more source

A Preconditioned Multisplitting and Schwarz Method for Linear Complementarity Problem

open access: yesJournal of Applied Mathematics, 2014
The preconditioner presented by Hadjidimos et al. (2003) can improve on the convergence rate of the classical iterative methods to solve linear systems.
Cuiyu Liu, Chen-liang Li
doaj   +1 more source

An infeasible interior-point method for the $P_*$-matrix linear complementarity‎ ‎problem based on a trigonometric kernel function with full-Newton‎ ‎step

open access: yesCommunications in Combinatorics and Optimization, 2018
An infeasible interior-point algorithm for solving the‎ ‎$P_*$-matrix linear complementarity problem based on a kernel‎ ‎function with trigonometric barrier term is analyzed‎.
B‎. ‎Kheirfam, M‎. ‎Haghighi
doaj   +1 more source

A new search direction of IPM for horizontal linear complementarity problems

open access: yesFrontiers in Energy Research, 2023
This study presents a new search direction for the horizontal linear complementarity problem. A vector-valued function is applied to the system of xy=μe, which defines the central path.
Xiaoyu Gong   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy