New double projection algorithm for solving variational inequalities (Q364484): 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: We propose a class of new double projection algorithms for solving variational inequality problem, which can be viewed as a framework of the method of Solodov and Svaiter by adopting a class of new hyperplanes. By the separation property of hyperplane, our method is proved to be globally convergent under very mild assumptions. In addition, we propose a modified version of our algorithm that finds a solution of variational inequality which is also a fixed point of a given nonexpansive mapping. If, in addition, a certain local error bound holds, we analyze the convergence rate of the iterative sequence. Numerical experiments prove that our algorithms are efficient. | |||
Property / review text: Summary: We propose a class of new double projection algorithms for solving variational inequality problem, which can be viewed as a framework of the method of Solodov and Svaiter by adopting a class of new hyperplanes. By the separation property of hyperplane, our method is proved to be globally convergent under very mild assumptions. In addition, we propose a modified version of our algorithm that finds a solution of variational inequality which is also a fixed point of a given nonexpansive mapping. If, in addition, a certain local error bound holds, we analyze the convergence rate of the iterative sequence. Numerical experiments prove that our algorithms are efficient. / 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: 47H10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 47J20 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6206844 / 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/714397 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2002807503 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59003947 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complementarity problems over cones with monotone and pseudomonotone maps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some recent advances in projection-type methods for variational inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4110807 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Modification of the extra-gradient method for solving variational inequalities and certain optimization problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Application Of Khobotov’s Algorithm To Variational Inequalities And Network Equilibrium Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A variant of korpelevich’s method for variational inequalities with a new search strategy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Projection Method for Variational Inequality Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Unified framework of extragradient-type methods for pseudomonotone variational inequalities. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new double projection algorithm for variational inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Weak convergence theorem by an extragradient method for nonexpansive mappings and monotone mappings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4533398 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new version of extragradient method for variational inequality problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A class of iterative methods for solving nonlinear projection equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: NE/SQP: A robust algorithm for the nonlinear complementarity problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 21:10, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | New double projection algorithm for solving variational inequalities |
scientific article |
Statements
New double projection algorithm for solving variational inequalities (English)
0 references
9 September 2013
0 references
Summary: We propose a class of new double projection algorithms for solving variational inequality problem, which can be viewed as a framework of the method of Solodov and Svaiter by adopting a class of new hyperplanes. By the separation property of hyperplane, our method is proved to be globally convergent under very mild assumptions. In addition, we propose a modified version of our algorithm that finds a solution of variational inequality which is also a fixed point of a given nonexpansive mapping. If, in addition, a certain local error bound holds, we analyze the convergence rate of the iterative sequence. Numerical experiments prove that our algorithms are efficient.
0 references
0 references
0 references
0 references
0 references
0 references