Algorithms for the Split Variational Inequality Problem

We propose a prototypical Split Inverse Problem (SIP) and a new variational problem, called the Split Variational Inequality Problem (SVIP), which is a SIP. It entails finding a solution of one inverse problem (e.g., a Variational Inequality Problem (VIP)), the image of which under a given bounded l...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Numerical algorithms Ročník 59; číslo 2; s. 301 - 323
Hlavní autoři: Censor, Yair, Gibali, Aviv, Reich, Simeon
Médium: Journal Article
Jazyk:angličtina
Vydáno: Boston Springer US 01.02.2012
Springer Nature B.V
Témata:
Algebra
Algorithms
Computer Science
Euclidean geometry
Hilbert space
Inverse problems
Iterative algorithms
Linear transformations
Numeric Computing
Numerical Analysis
Original Paper
Theory of Computation
Metric projection
Split inverse problem
Inverse strongly monotone operator
Variational inequality problem
Iterative method
Hilbert space
Monotone operator
Product space
Constrained variational inequality problem
Split variational inequality problem
ISSN:1017-1398, 1572-9265
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We propose a prototypical Split Inverse Problem (SIP) and a new variational problem, called the Split Variational Inequality Problem (SVIP), which is a SIP. It entails finding a solution of one inverse problem (e.g., a Variational Inequality Problem (VIP)), the image of which under a given bounded linear transformation is a solution of another inverse problem such as a VIP. We construct iterative algorithms that solve such problems, under reasonable conditions, in Hilbert space and then discuss special cases, some of which are new even in Euclidean space.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1017-1398
1572-9265
DOI:10.1007/s11075-011-9490-5