On general variable-step relaxed projection method for strongly quasivariational inequalities

Authors: Ceng, Lu-Chuan1; Wang, Chang-Yu2; Yao, Jen-Chih3

Source: Optimization, Volume 57, Number 5, January 2008 , pp. 607-620(14)

Publisher: Taylor and Francis Ltd

Purchase options

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$42.75 plus tax      Refund Policy

OR

 
More like this?
Content Key:
Free Content - Free
New Content - New
Open Access Content - Open Access
Subscribed Content - Subscribed
Free Trial Content - Free Trial

Abstract:

In this article, a general variable-step basic projection algorithm for solving strongly quasivariational inequalities is proposed. Under certain conditions, the convergence of the general 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 which is easy to calculate. The convergence of relaxed scheme is also obtained under certain assumptions.

Keywords: strongly quasivariational inequality; (g - m)-weakly co-coercive mapping; projection; relaxation; algorithm; convergence

Document Type: Research article

DOI: 10.1080/02331930802355473

Affiliations: 1: Department of Mathematics, Shanghai Normal University, Shanghai, China 2: Institute of Operations Research, Qufu Normal University, Qufu, China 3: Department of Applied Mathematics, National Sun Yat-Sen University, Kaohsiung, Taiwan

Back to top

Content Key:
Free Content - Free
New Content - New
Open Access Content - Open Access
Subscribed Content - Subscribed
Free Trial Content - Free Trial
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in
Need to register?
Sign up here
Text size: A | A | A | A