Advanced Search

Query:

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

Format:

Display: entries per page entries

Zbl 1056.49018
Yang, Qingzhi
On variable-step relaxed projection algorithm for variational inequalities. (English)
[J] J. Math. Anal. Appl. 302, No. 1, 166-179 (2005). ISSN 0022-247X

Summary: Projection algorithms are practically useful for solving variational inequalities (VI). However some among them require the knowledge related to VI in advance, such as Lipschitz constant. Usually it is impossible in practice. This paper studies the variable-step basic projection algorithm and its relaxed version under a weak co-coercivity condition. The algorithms discussed need not know constant/function associated with the co-coercivity or weak co-coercivity and the step-size is varied from one iteration to the next. Under certain conditions the convergence of the variable-step basic projection algorithm is established. For the practical consideration, we also give the relaxed version of this algorithm, in which the projection onto a closed convex set is replaced by another projection at each iteration and the latter is easy to calculate. The convergence of the relaxed scheme is also obtained under certain assumptions. Finally, we apply these two algorithms to the Split Feasibility Problem (SFP).

MSC 2000:: *49J40 Variational methods including variational inequalities
65K10 Optimization techniques (numerical methods)

Keywords: variational inequality; weak co-coercivity; projection; relaxation; SFP; split feasibility problem

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

	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]