Results 31 to 40 of about 192,429 (283)
Generalized AOR Algorithms for Linear Complementarity Problem
Journal of Algorithms & Computational Technology, 2007 In this paper, we propose a class of generalized accelerated overrelaxation (GAOR) methods, in which one special case reduces to the generalized successive overrelaxation(GSOR) methods, for solving a linear complementarity problem LCP ( M, q ...
Dongjin Yuan, Hui Zhang
doaj +1 more source
The Extended Linear Complementarity Problem [PDF]
SIAM Journal on Matrix Analysis and Applications, 1995 Summary: We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the bilinear objective function under a monotonicity ...
Mangasarian, O. L., Pang, J. S.
openaire +1 more source
Cell wall target fragment discovery using a low‐cost, minimal fragment library
FEBS Letters, EarlyView.LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan +5 more
wiley +1 more source
Molecular Oncology, EarlyView.Combining PTEN protein assessment and transcriptomic profiling of prostate tumors, we uncovered a network enriched in senescence and extracellular matrix (ECM) programs associated with PTEN loss and conserved in a mouse model. We show that PTEN‐deficient cells trigger paracrine remodeling of the surrounding stroma and this information could help ...
Ivana Rondon‐Lorefice +16 more
wiley +1 more source
A local Jacobian smoothing method for solving Nonlinear Complementarity Problems
Universitas Scientiarum, 2020 In this paper, we present a smoothing of a family of nonlinear complementarity functions and use its properties in combination with the smooth Jacobian strategy to present a new generalized Newton-type algorithm to solve a nonsmooth system of ...
Favián Arenas, Héctor Jairo Martínez, Rosana Pérez
doaj +1 more source
A note on fixed point method and linear complementarity problem
Journal 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
Strong Stationarity Conditions for Optimal Control of Hybrid Systems
, 2016 We present necessary and sufficient optimality conditions for finite time optimal control problems for a class of hybrid systems described by linear complementarity models.
Goulart, Paul +2 more
core +1 more source
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
The Block Principal Pivoting Algorithm for the Linear Complementarity Problem with an M-Matrix
Advances 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
Novel Global Harmony Search Algorithm for General Linear Complementarity Problem
Axioms, 2022 Linear complementarity problem (LCP) is studied. After reforming general LCP as the system of nonlinear equations by NCP-function, LCP is equivalent to solving an unconstrained optimization model, which can be solved by a recently proposed algorithm ...
Longquan Yong
doaj +1 more source