Method of alternating projections for the general absolute value equation
A novel approach for solving the general absolute value equation A x + B | x | = c where A , B ∈ I R m × n and c ∈ I R m is presented. We reformulate the equation as a nonconvex feasibility problem which we solve via the method of alternating projections (MAP). The fixed points set of the alternatin...
Gespeichert in:
| Veröffentlicht in: | Journal of fixed point theory and applications Jg. 25; H. 1 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Cham
Springer International Publishing
01.02.2023
|
| Schlagworte: | |
| ISSN: | 1661-7738, 1661-7746 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | A novel approach for solving the general absolute value equation
A
x
+
B
|
x
|
=
c
where
A
,
B
∈
I
R
m
×
n
and
c
∈
I
R
m
is presented. We reformulate the equation as a nonconvex feasibility problem which we solve via the method of alternating projections (MAP). The fixed points set of the alternating projections map is characterized under nondegeneracy conditions on
A
and
B
. Furthermore, we prove local linear convergence of the algorithm. Unlike most of the existing approaches in the literature, the algorithm presented here is capable of handling problems with
m
≠
n
, both theoretically and numerically. |
|---|---|
| ISSN: | 1661-7738 1661-7746 |
| DOI: | 10.1007/s11784-022-01026-8 |