Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1013.49005
Yamada, Isao
The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings. (English)
[A] Butnariu, Dan (ed.) et al., Inherently parallel algorithms in feasibility and optimization and their applications. Research workshop, Haifa, Israel, March 13-16, 2000. Amsterdam: North-Holland/ Elsevier. Stud. Comput. Math. 8, 473-504 (2001). ISBN 0-444-50595-4/hbk

This paper presents a simple algorithmic solution to the variational inequality problem defined over the nonempty intersection of multiple fixed point sets of nonexpansive mappings in a real Hilbert space. The algorithmic solution is named the hybrid steepest descent method and generates a sequence strongly convergent to the solution of the problem. \par The applicability of this method to the convexly constrained generalized pseudoinverse problem as well as to the convex feasibility problem is demonstrated by constructing nonexpansive mappings whose fixed point sets are the feasible sets of the problem.
[Ruxandra Stavre (Bucureşti)]

MSC 2000:: *49J40 Variational methods including variational inequalities
47H10 Fixed point theorems for nonlinear operators on topol.linear spaces
47J20 Inequalities involving nonlinear operators
65K10 Optimization techniques (numerical methods)
47H09 Mappings defined by "shrinking" properties

Keywords: variational inequality; fixed point set; hybrid steepest descent method

Cited in: Zbl 1214.49009 Zbl 1158.47050

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]