Results 61 to 70 of about 5,034,416 (318)
This paper is concerned with solving linear complementarity problems (LCP) arising in many scientific and engineering fields. We propose an accelerated double-relaxation two-sweep modulus-based matrix splitting (ADRTMMS) iteration method by applying ...
Zhengge Huang, Jingjing Cui
doaj +1 more source
ABSTRACT Background Families of children with cancer experience significant financial strain, even with universal healthcare. Indirect costs, such as productivity losses and non‐medical expenses, are rarely included in economic evaluations, and little is known about how effectively financial aid programmes alleviate this burden. Childhood brain tumours
Megumi Lim +8 more
wiley +1 more source
By using a new search direction, we propose an infeasible interior-point method for monotone linear complementarity problem. The algorithm uses only one feasibility step in each iteration, and we prove that it suffices in order to obtain a polynomial ...
Nezameddin Mahdavi-Amiri +1 more
doaj
A class of singular Ro-matrices and extensions to semidefinite linear complementarity problems [PDF]
For ARnxn and qRn, the linear complementarity problem LCP(A, q) is to determine if there is xRn such that x ≥ 0; y = Ax + q ≥ 0 and xT y = 0. Such an x is called a solution of LCP(A,q).
Sivakumar K.C.
doaj +1 more source
ABSTRACT Background Survivors of childhood acute lymphoblastic leukemia (ALL) often exhibit early deficits in muscle and movement competence, which can compromise long‐term health. Integrative neuromuscular training (INT), a multifaceted approach combining fundamental movement activities with strength exercises, may help address these deficits during ...
Anna Maria Markarian +7 more
wiley +1 more source
The Monomial Preconditioned SSOR Method for Linear Complementarity Problem
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
An enumerative method for the solution of linear complementarity problems [PDF]
In this report an enumerative method for the solution of the Linear Complementarity Problem (LCP) is presented. This algorithm completely processes the LCP, and does not require any particular property of the LCP to apply.
Judice, JJ, Mitra, G
core +1 more source
Infimum of error bounds for linear complementarity problems of Σ-SDD and Σ1-SSD matrices
In (2013) [18] , Garcia-Esnaola and Pena presented error bounds for the linear complementarity problems of Σ-SDD and Σ 1 -SSD matrices respectively. These bounds all involve a parameter on an open interval.
Zhifeng Wang, Chaoqian Li, Yaotang Li
semanticscholar +1 more source
ABSTRACT Background An internal tandem duplication in the gene encoding Fms‐like tyrosine kinase 3 (FLT3‐ITD) is associated with high relapse risk and poor prognosis in acute myeloid leukemia (AML) and plays a crucial role in treatment decisions. Measurable residual disease (MRD) analysis of FLT3‐ITD during and after treatment has shown prognostic ...
Sofie Johansson Alm +11 more
wiley +1 more source
Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems
We present an Infeasible Interior-Point Method for monotone Linear Complementarity Problem (LCP) which is an improved version of the algorithm given in [13]. In the earlier version, each iteration consisted of one feasibility step and few centering steps.
Goran Lešaja, Mustafa Ozen
doaj +1 more source

