Error bounds and a condition number for the absolute value equations
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F23%3A10472175" target="_blank" >RIV/00216208:11320/23:10472175 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=J3Kwo21Pm3" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=J3Kwo21Pm3</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10107-021-01756-6" target="_blank" >10.1007/s10107-021-01756-6</a>
Alternative languages
Result language
angličtina
Original language name
Error bounds and a condition number for the absolute value equations
Original language description
Due to their relation to the linear complementarity problem, absolute value equations have been intensively studied recently. In this paper, we present error bound conditions for absolute value equations. Along with the error bounds, we introduce a condition number. We consider general scaled matrix p-norms, as well as particular p-norms. We discuss basic properties of the condition number, including its computational complexity. We present various bounds on the condition number, and we give exact formulae for special classes of matrices. Moreover, we consider matrices that appear based on the transformation from the linear complementarity problem. Finally, we apply the error bound to convergence analysis of two methods for solving absolute value equations.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA18-04735S" target="_blank" >GA18-04735S: Novel approaches for relaxation and approximation techniques in deterministic global optimization</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Mathematical Programming, Series A
ISSN
0025-5610
e-ISSN
1436-4646
Volume of the periodical
198
Issue of the periodical within the volume
1
Country of publishing house
DE - GERMANY
Number of pages
29
Pages from-to
85-113
UT code for WoS article
000749079300002
EID of the result in the Scopus database
2-s2.0-85123864243