Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/6104
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Applied Mathematics-
dc.creatorQi, HD-
dc.creatorQi, L-
dc.creatorSun, D-
dc.date.accessioned2014-12-11T08:28:20Z-
dc.date.available2014-12-11T08:28:20Z-
dc.identifier.issn1052-6234-
dc.identifier.urihttp://hdl.handle.net/10397/6104-
dc.language.isoenen_US
dc.publisherSociety for Industrial and Applied Mathematicsen_US
dc.rights© 2003 Society for Industrial and Applied Mathematicsen_US
dc.subjectVariational inequality problemen_US
dc.subjectConstrained optimizationen_US
dc.subjectSemismooth equationen_US
dc.subjectTrust region methoden_US
dc.subjectTruncated conjugate gradient methoden_US
dc.subjectGlobal and superlinear convergenceen_US
dc.titleSolving Karush--Kuhn--Tucker Systems via the trust region and the conjugate gradient methodsen_US
dc.typeJournal/Magazine Articleen_US
dc.description.otherinformationAuthor name used in this publication: Houduo Qien_US
dc.identifier.spage439-
dc.identifier.epage463-
dc.identifier.volume14-
dc.identifier.issue2-
dc.identifier.doi10.1137/S105262340038256X-
dcterms.abstractA popular approach to solving the Karush-Kuhn-Tucker (KKT) system, mainly arising from the variational inequality problem, is to reformulate it as a constrained minimization problem with simple bounds. In this paper, we propose a trust region method for solving the reformulation problem with the trust region subproblems being solved by the truncated conjugate gradient (CG) method, which is cost effective. Other advantages of the proposed method over existing ones include the fact that a good approximated solution to the trust region subproblem can be found by the truncated CG method and is judged in a simple way; also, the working matrix in each iteration is H, instead of the condensed H[sup T]H, where H is a matrix element of the generalized Jacobian of the function used in the reformulation. As a matter of fact, the matrix used is of reduced dimension. We pay extra attention to ensure the success of the truncated CG method as well as the feasibility of the iterates with respect to the simple constraints. Another feature of the proposed method is that we allow the merit function value to be increased at some iterations to speed up the convergence. Global and superlinear/quadratic convergence is shown under standard assumptions. Numerical results are reported on a subset of problems from the MCPLIB collection [S. P. Dirkse and M. C. Ferris, Optim. Methods Softw., 5 (1995), pp. 319-345].-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationSIAM journal on optimization, 2003, v. 14, no. 2, p. 439-463-
dcterms.isPartOfSIAM journal on optimization-
dcterms.issued2003-
dc.identifier.isiWOS:000187742000007-
dc.identifier.scopus2-s2.0-2442467064-
dc.identifier.eissn1095-7189-
dc.identifier.rosgroupidr19908-
dc.description.ros2003-2004 > 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 
Qi_Solving_Karush_Kuhn.pdf269.46 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

87
Last Week
0
Last month
Citations as of Oct 1, 2023

Downloads

209
Citations as of Oct 1, 2023

SCOPUSTM   
Citations

15
Last Week
0
Last month
0
Citations as of Sep 28, 2023

WEB OF SCIENCETM
Citations

16
Last Week
0
Last month
0
Citations as of Sep 28, 2023

Google ScholarTM

Check

Altmetric


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