2000 character limit reached
The perturbation bound of the extended vertical linear complementarity problem
Published 3 Oct 2022 in math.NA and cs.NA | (2210.01268v1)
Abstract: In this paper, we discuss the perturbation analysis of the extended vertical linear complementarity problem (EVLCP). Under the assumption of the row $\mathcal{W}$-property, several absolute and relative perturbation bounds of EVLCP are given, which can be reduced to some existing results. Some numerical examples are given to show the proposed bounds.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.