The perturbation bound of the extended vertical linear complementarity problem
Shiliang Wu, Wen Li, Hehui Wang
TL;DR
This paper analyzes how small changes affect solutions to the extended vertical linear complementarity problem (EVLCP), providing bounds under certain conditions and illustrating them with numerical examples.
Contribution
It introduces new perturbation bounds for EVLCP under the row W-property, extending and connecting to existing results.
Findings
Derived absolute and relative perturbation bounds for EVLCP
Bounds can be simplified to existing results in special cases
Numerical examples validate the proposed bounds
Abstract
In this paper, we discuss the perturbation analysis of the extended vertical linear complementarity problem (EVLCP). Under the assumption of the row -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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Optimization and Variational Analysis · Composite Structure Analysis and Optimization