Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/80381
Full metadata record
DC FieldValueLanguage
dc.contributor.CRUESPUniversidade Estadual de Campinaspt_BR
dc.typeArtigo de periódicopt_BR
dc.titleReformulation of variational inequalities on a simplex and compactification of complementarity problemspt_BR
dc.contributor.authorAndreani, Rpt_BR
dc.contributor.authorMartinez, JMpt_BR
unicamp.author.emailandreani@nimitz.dcce.ibilce.unesp.brpt_BR
unicamp.author.emailmartinez@ime.unicamp.brpt_BR
unicamp.authorUNESP, Dept Comp Sci & Stat, BR-15054000 Sao Jose do Rio Preto, SP, Brazil Univ Estadual Campinas, UNICAMP, IMECC, Dept Appl Math, BR-13081970 Campinas, SP, Brazilpt_BR
dc.subjectvariational inequalitiespt_BR
dc.subjectcomplementaritypt_BR
dc.subjectminimization algorithmspt_BR
dc.subjectreformulationpt_BR
dc.subject.wosBound Constrained Optimizationpt_BR
dc.subject.wosConvex Minimization Problemspt_BR
dc.subject.wosNonlinear Complementaritypt_BR
dc.subject.wosNewton Methodpt_BR
dc.subject.wosAlgorithmpt_BR
dc.subject.wosSystemspt_BR
dc.description.abstractMany variational inequality problems (VIPs) can be reduced, by a compactification procedure, to a VIP on the canonical simplex. Reformulations of this problem are studied, including smooth reformulations with simple constraints and unconstrained reformulations based on the penalized Fischer-Burmeister function. It is proved that bounded level set results hold for these reformulations under quite general assumptions on the operator. Therefore, it can be guaranteed that minimization algorithms generate bounded sequences and, under monotonicity conditions, these algorithms necessarily nd solutions of the original problem. Some numerical experiments are presented.pt
dc.relation.ispartofSiam Journal On Optimizationpt_BR
dc.relation.ispartofabbreviationSIAM J. Optim.pt_BR
dc.publisher.cityPhiladelphiapt_BR
dc.publisher.countryEUApt_BR
dc.publisherSiam Publicationspt_BR
dc.date.issued2000pt_BR
dc.date.monthofcirculation38869pt_BR
dc.identifier.citationSiam Journal On Optimization. Siam Publications, v. 10, n. 3, n. 878, n. 895, 2000.pt_BR
dc.language.isoenpt_BR
dc.description.volume10pt_BR
dc.description.issuenumber3pt_BR
dc.description.firstpage878pt_BR
dc.description.lastpage895pt_BR
dc.rightsabertopt_BR
dc.sourceWeb of Sciencept_BR
unicamp.cruespUNESPpt_BR
dc.identifier.issn1052-6234pt_BR
dc.identifier.wosidWOS:000087452000013pt_BR
dc.identifier.doi10.1137/S1052623499352826pt_BR
dc.date.available2014-08-01T18:32:12Z
dc.date.available2015-11-26T17:01:46Z-
dc.date.accessioned2014-08-01T18:32:12Z
dc.date.accessioned2015-11-26T17:01:46Z-
dc.description.provenanceMade available in DSpace on 2014-08-01T18:32:12Z (GMT). No. of bitstreams: 0 Previous issue date: 2000en
dc.description.provenanceMade available in DSpace on 2015-11-26T17:01:46Z (GMT). No. of bitstreams: 0 Previous issue date: 2000en
dc.identifier.urihttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/80381
dc.identifier.urihttp://repositorio.unicamp.br/jspui/handle/REPOSIP/80381-
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
There are no files associated with this item.


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