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
Gig Work Is Invading Nursing Homes. The Risks Can Be Deadly
0Wired
4 Request-Validation Gotchas When Migrating OpenAI Clients to GPT-6.2 Reasoning Models
0dev.to
Razorpay webhook not verified: anyone can fake a payment
0dev.to
From FAQPage Schema to Answerable AI Documentation
0dev.to
Wiring Android's MediaPipe LLM Inference API to a Multi-Turn Conversation Engine
0dev.to
What Is LLM Throughput? Tokens per Second, Concurrency, and Batching
0dev.to