Results 11 to 20 of about 791,497 (327)
Conformal Prediction Regions for Time Series using Linear Complementarity Programming [PDF]
Conformal prediction is a statistical tool for producing prediction regions of machine learning models that are valid with high probability. However, applying conformal prediction to time series data leads to conservative prediction regions.
Matthew Cleaveland +3 more
semanticscholar +1 more source
A smoothing Levenberg-Marquardt algorithm for linear weighted complementarity problem
In this paper, we consider the solution of linear weighted complementarity problem (denoted by LWCP). Firstly, we introduce a new class of weighted complementary functions and show that its continuously differentiable.
Panjie Tian, Zhensheng Yu , Yue Yuan
doaj +1 more source
General fixed-point method for solving the linear complementarity problem
In this paper, we consider numerical methods for the linear complementarity problem (LCP). By introducing a positive diagonal parameter matrix, the LCP is transformed into an equivalent fixed-point equation and the equivalence is proved.
Xi-Ming Fang
doaj +1 more source
This study proposes a method to analyse the motion of a multibody system with components subjected to large plastic deformations by contact and collision.
Shun Yamaguchi +2 more
doaj +1 more source
Novel Global Harmony Search Algorithm for General Linear Complementarity Problem
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
Affinely Adjustable Robust Linear Complementarity Problems [PDF]
Linear complementarity problems are a powerful tool for modeling many practically relevant situations such as market equilibria. They also connect many sub-areas of mathematics like game theory, optimization, and matrix theory. Despite their close relation to optimization, the protection of LCPs against uncertainties -- especially in the sense of ...
Christian Biefel +3 more
openaire +3 more sources
New error bound for linear complementarity problem of S-SDDS-B matrices
S-SDDS-B matrices is a subclass of P-matrices which contains B-matrices. New error bound of the linear complementarity problem for S-SDDS-B matrices is presented, which improves the corresponding result in [1].
Lanlan Liu , Pan Han, Feng Wang
doaj +1 more source
The parameter-Newton iteration for the second-order cone linear complementarity problem
In this paper, we propose the parameter-Newton (PN) method to solve the second-order linear complementarity problem (SOCLCP). The key idea of PN method is that we transfer the SOCLCP into a system of nonlinear equations by bringing in a parameter.
Peng Zhou, Teng Wang
doaj +1 more source
Multiparametric Linear Complementarity Problems [PDF]
The linear complementarity problem (LCP) is a general problem that unifies linear and quadratic programs and bimatrix games. In this paper, we present an efficient algorithm for the solution to multiparametric linear complementarity problems (pLCPs) that are defined by positive semi-definite matrices. This class of problems includes the multiparametric
Colin N. Jones, Manfred Morrari
openaire +1 more source
A note on fixed point method and linear complementarity problem
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

