AI & ML
The extended horizontal linear complementarity problem: iterative methods and error analysis
arXiv cs.NA0 views
arXiv:2509.14491v2 Announce Type: replace Abstract: To the best of our knowledge, since the extended horizontal linear complementarity problem (EHLCP) was first introduced and studied by Kaneko in 1977, no iterative methods or error analysis have been developed for it due to the interdependence of its multiple unknowns in a 'chain-like' structure. This paper aims to address these gaps by: (1) proposing an equivalent fixed-point formulation of the EHLCP by using a variable transformation technique with the max-min function; (2) developing efficient iterative methods for solving the EHLCP based on this fixed-point form, along with their convergence analysis; (3) deriving global error bounds and computable estimates for the EHLCP. Several numerical examples from applications such as multicommodity market equilibrium and bilateral obstacle problems are given to demonstrate the effectiveness of the proposed methods and bounds.
Source:https://arxiv.org/abs/2509.14491PreviousSynthetic Acceleration Preconditioners for Parametric Radiative Transfer Equations based on Trajectory-Aware Reduced-Order ModelsNextAn Efficient Projection Enhanced Interpolation Based Tensor Train Decomposition
Related posts
Generalizing self-normalized importance sampling with couplings
0arXiv stat.CO
Bayesian Computation of Copula-based Multivariate Models with an Application to Doping Detection
0arXiv stat.CO
WAIVES: Weak-form Asymptotically-unbiased Instrumental-Variable Estimation for SDEs
0arXiv stat.CO
Treat Your Honeypot Analysis Like Code: Git, Pull Requests and a Human Gate for AI [Guest Diary], (Wed, Nov 18th)
0SANS ISC
ISC Stormcast For Thursday, November 19th, 2026 https://isc.sans.edu/podcastdetail/10186, (Thu, Nov 19th)
0SANS ISC
Thống kê hiệu suất Al Ahli vs Al Nassr: Phép thử cực đại cho hàng công chủ nhà
0dev.to Data