Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/7013
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Applied Mathematics-
dc.creatorChen, X-
dc.creatorWang, Z-
dc.date.accessioned2014-12-11T08:26:56Z-
dc.date.available2014-12-11T08:26:56Z-
dc.identifier.issn1052-6234-
dc.identifier.urihttp://hdl.handle.net/10397/7013-
dc.language.isoenen_US
dc.publisherSociety for Industrial and Applied Mathematicsen_US
dc.rights© 2013 Society for Industrial and Applied Mathematicsen_US
dc.subjectDifferential variational inequalitiesen_US
dc.subjectP₀-functionen_US
dc.subjectTikhonov regularizationen_US
dc.subjectEpi-convergenceen_US
dc.titleConvergence of regularized time-stepping methods for differential variational inequalitiesen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage1647-
dc.identifier.epage1671-
dc.identifier.volume23-
dc.identifier.issue3-
dc.identifier.doi10.1137/120875223-
dcterms.abstractThis paper provides convergence analysis of regularized time-stepping methods for the differential variational inequality (DVI), which consists of a system of ordinary differential equations and a parametric variational inequality (PVI) as the constraint. The PVI often has multiple solutions at each step of a time-stepping method, and it is hard to choose an appropriate solution for guaranteeing the convergence. In [L. Han, A. Tiwari, M. K. Camlibel and J.-S. Pang, SIAM J. Numer. Anal., 47 (2009) pp. 3768--3796], the authors proposed to use “least-norm solutions” of parametric linear complementarity problems at each step of the time-stepping method for the monotone linear complementarity system and showed the novelty and advantages of the use of the least-norm solutions. However, in numerical implementation, when the PVI is not monotone and its solution set is not convex, finding a least-norm solution is difficult. This paper extends the Tikhonov regularization approximation to the P$_0$-function DVI, which ensures that the PVI has a unique solution at each step of the regularized time-stepping method. We show the convergence of the regularized time-stepping method to a weak solution of the DVI and present numerical examples to illustrate the convergence theorems.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationSIAM journal on optimization, 2013, v. 23, no. 3, p. 1647–1671-
dcterms.isPartOfSIAM journal on optimization-
dcterms.issued2013-
dc.identifier.isiWOS:000325094000012-
dc.identifier.scopus2-s2.0-84886285453-
dc.identifier.eissn1095-7189-
dc.identifier.rosgroupidr67747-
dc.description.ros2013-2014 > Academic research: refereed > Publication in refereed journal-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Chen_Convergence_Regularized_Time-stepping.pdf467.57 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

139
Last Week
2
Last month
Citations as of Apr 21, 2024

Downloads

226
Citations as of Apr 21, 2024

SCOPUSTM   
Citations

50
Last Week
0
Last month
0
Citations as of Apr 19, 2024

WEB OF SCIENCETM
Citations

50
Last Week
0
Last month
0
Citations as of Apr 18, 2024

Google ScholarTM

Check

Altmetric


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