Solving the variational inequality problem defined on intersection of finite level sets (Q370334): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 5 users not shown) | |||
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 | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58917778 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2013/942315 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2064958771 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5737280 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3344749 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A self-adaptive method for solving general mixed variational inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5665783 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3322631 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equilibrium problems: nonsmooth optimization and variational inequality models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3914338 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improvements of some projection methods for monotone nonlinear variational inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An approximate proximal-extragradient type method for monotone variational inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3406701 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Introduction to Variational Inequalities and Their Applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Variational inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convergence of hybrid steepest-descent methods for variational inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Viscosity approximation methods for nonexpansive mappings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2768033 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A relaxed projection method for variational inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mann-Type Steepest-Descent and Modified Hybrid Steepest-Descent Methods for Variational Inequalities in Banach Spaces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Weak convergence of an iterative method for pseudomonotone variational inequalities and fixed-point problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3998720 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Iterative Algorithms for Nonlinear Operators / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Hybrid Extragradient-Viscosity Method for Monotone Operators and Fixed Point Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Projection Algorithms for Solving Convex Feasibility Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The relaxed CQ algorithm solving the split feasibility problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving the split feasibility problem without prior knowledge of matrix norms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The subgradient extragradient method for solving variational inequalities in Hilbert space / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 21:08, 6 July 2024
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
0 references
0 references
0 references
0 references
0 references
0 references