Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/33987
Title: Levitin-polyak well-posedness of vector variational inequality problems with functional constraints
Authors: Huang, XX
Yang, XQ 
Keywords: Approximating solution sequence
Cone-coercivity
Cone-monotonicity
Generalized Levitin-Polyak well-posedness
Vector variational inequality with functional constraints
Issue Date: 2010
Publisher: Taylor & Francis
Source: Numerical functional analysis and optimization, 2010, v. 31, no. 4, p. 440-459 How to cite?
Journal: Numerical functional analysis and optimization 
Abstract: The Levitin-Polyak well-posedness for a constrained problem guarantees that, for an approximating solution sequence, there is a subsequence which converges to a solution of the problem. In this article, we introduce several types of (generalized) Levitin-Polyak well-posednesses for a vector variational inequality problem with both abstract and functional constraints. Various criteria and characterizations for these types of well-posednesses are given. Relations among these types of well-posednesses are presented.
URI: http://hdl.handle.net/10397/33987
ISSN: 0163-0563
DOI: 10.1080/01630563.2010.485296
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

8
Last Week
0
Last month
0
Citations as of Aug 11, 2017

WEB OF SCIENCETM
Citations

6
Last Week
0
Last month
0
Citations as of Aug 1, 2017

Page view(s)

55
Last Week
4
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.