Please use this identifier to cite or link to this item:
http://repositorio.unicamp.br/jspui/handle/REPOSIP/80381
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.CRUESP | Universidade Estadual de Campinas | pt_BR |
dc.type | Artigo de periódico | pt_BR |
dc.title | Reformulation of variational inequalities on a simplex and compactification of complementarity problems | pt_BR |
dc.contributor.author | Andreani, R | pt_BR |
dc.contributor.author | Martinez, JM | pt_BR |
unicamp.author.email | andreani@nimitz.dcce.ibilce.unesp.br | pt_BR |
unicamp.author.email | martinez@ime.unicamp.br | pt_BR |
unicamp.author | UNESP, 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, Brazil | pt_BR |
dc.subject | variational inequalities | pt_BR |
dc.subject | complementarity | pt_BR |
dc.subject | minimization algorithms | pt_BR |
dc.subject | reformulation | pt_BR |
dc.subject.wos | Bound Constrained Optimization | pt_BR |
dc.subject.wos | Convex Minimization Problems | pt_BR |
dc.subject.wos | Nonlinear Complementarity | pt_BR |
dc.subject.wos | Newton Method | pt_BR |
dc.subject.wos | Algorithm | pt_BR |
dc.subject.wos | Systems | pt_BR |
dc.description.abstract | Many 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.ispartof | Siam Journal On Optimization | pt_BR |
dc.relation.ispartofabbreviation | SIAM J. Optim. | pt_BR |
dc.publisher.city | Philadelphia | pt_BR |
dc.publisher.country | EUA | pt_BR |
dc.publisher | Siam Publications | pt_BR |
dc.date.issued | 2000 | pt_BR |
dc.date.monthofcirculation | 38869 | pt_BR |
dc.identifier.citation | Siam Journal On Optimization. Siam Publications, v. 10, n. 3, n. 878, n. 895, 2000. | pt_BR |
dc.language.iso | en | pt_BR |
dc.description.volume | 10 | pt_BR |
dc.description.issuenumber | 3 | pt_BR |
dc.description.firstpage | 878 | pt_BR |
dc.description.lastpage | 895 | pt_BR |
dc.rights | aberto | pt_BR |
dc.source | Web of Science | pt_BR |
unicamp.cruesp | UNESP | pt_BR |
dc.identifier.issn | 1052-6234 | pt_BR |
dc.identifier.wosid | WOS:000087452000013 | pt_BR |
dc.identifier.doi | 10.1137/S1052623499352826 | pt_BR |
dc.date.available | 2014-08-01T18:32:12Z | |
dc.date.available | 2015-11-26T17:01:46Z | - |
dc.date.accessioned | 2014-08-01T18:32:12Z | |
dc.date.accessioned | 2015-11-26T17:01:46Z | - |
dc.description.provenance | Made available in DSpace on 2014-08-01T18:32:12Z (GMT). No. of bitstreams: 0 Previous issue date: 2000 | en |
dc.description.provenance | Made available in DSpace on 2015-11-26T17:01:46Z (GMT). No. of bitstreams: 0 Previous issue date: 2000 | en |
dc.identifier.uri | http://www.repositorio.unicamp.br/jspui/handle/REPOSIP/80381 | |
dc.identifier.uri | http://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.