Solving the variational inequality problem defined on intersection of finite level sets (Q370334): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
Summary: Consider the variational inequality \(\text{VI}(C, F)\) of finding a point \(x^\ast \in C\) satisfying the property \(\langle Fx^\ast, x - x^\ast \rangle \geq 0\), for all \(x \in C\), where \(C\) is the intersection of finite level sets of convex functions defined on a real Hilbert space \(H\) and \(F : H \to H\) is an \(L\)-Lipschitzian and \(\eta\)-strongly monotone operator. Relaxed and self-adaptive iterative algorithms are devised for computing the unique solution of \(\text{VI}(C, F)\). Since our algorithm avoids calculating the projection \(P_C\) (calculating \(P_C\) by computing several sequences of projections onto half-spaces containing the original domain \(C\)) directly and has no need to know any information of the constants \(L\) and \(\eta\), the implementation of our algorithm is very easy. To prove strong convergence, a new lemma is established, which can be used as a fundamental tool for solving some nonlinear problems. | |||
Property / review text: Summary: Consider the variational inequality \(\text{VI}(C, F)\) of finding a point \(x^\ast \in C\) satisfying the property \(\langle Fx^\ast, x - x^\ast \rangle \geq 0\), for all \(x \in C\), where \(C\) is the intersection of finite level sets of convex functions defined on a real Hilbert space \(H\) and \(F : H \to H\) is an \(L\)-Lipschitzian and \(\eta\)-strongly monotone operator. Relaxed and self-adaptive iterative algorithms are devised for computing the unique solution of \(\text{VI}(C, F)\). Since our algorithm avoids calculating the projection \(P_C\) (calculating \(P_C\) by computing several sequences of projections onto half-spaces containing the original domain \(C\)) directly and has no need to know any information of the constants \(L\) and \(\eta\), the implementation of our algorithm is very easy. To prove strong convergence, a new lemma is established, which can be used as a fundamental tool for solving some nonlinear problems. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 47J20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 49J40 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65J15 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6209506 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
variational inequality | |||
Property / zbMATH Keywords: variational inequality / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
relaxed self-adaptive iterative algorithms | |||
Property / zbMATH Keywords: relaxed self-adaptive iterative algorithms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
strong convergence | |||
Property / zbMATH Keywords: strong convergence / rank | |||
Normal rank |
Revision as of 12:39, 28 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solving the variational inequality problem defined on intersection of finite level sets |
scientific article |
Statements
Solving the variational inequality problem defined on intersection of finite level sets (English)
0 references
19 September 2013
0 references
Summary: Consider the variational inequality \(\text{VI}(C, F)\) of finding a point \(x^\ast \in C\) satisfying the property \(\langle Fx^\ast, x - x^\ast \rangle \geq 0\), for all \(x \in C\), where \(C\) is the intersection of finite level sets of convex functions defined on a real Hilbert space \(H\) and \(F : H \to H\) is an \(L\)-Lipschitzian and \(\eta\)-strongly monotone operator. Relaxed and self-adaptive iterative algorithms are devised for computing the unique solution of \(\text{VI}(C, F)\). Since our algorithm avoids calculating the projection \(P_C\) (calculating \(P_C\) by computing several sequences of projections onto half-spaces containing the original domain \(C\)) directly and has no need to know any information of the constants \(L\) and \(\eta\), the implementation of our algorithm is very easy. To prove strong convergence, a new lemma is established, which can be used as a fundamental tool for solving some nonlinear problems.
0 references
variational inequality
0 references
relaxed self-adaptive iterative algorithms
0 references
strong convergence
0 references