| dc.creator | Andreani, R | |
| dc.creator | Castro, SLC | |
| dc.creator | Chela, JL | |
| dc.creator | Friedlander, A | |
| dc.creator | Santos, SA | |
| dc.date | 2009 | |
| dc.date | JUL | |
| dc.date | 2014-11-18T20:18:58Z | |
| dc.date | 2015-11-26T16:58:32Z | |
| dc.date | 2014-11-18T20:18:58Z | |
| dc.date | 2015-11-26T16:58:32Z | |
| dc.date.accessioned | 2018-03-28T23:46:08Z | |
| dc.date.available | 2018-03-28T23:46:08Z | |
| dc.identifier | Computational Optimization And Applications. Springer, v. 43, n. 3, n. 307, n. 328, 2009. | |
| dc.identifier | 0926-6003 | |
| dc.identifier | WOS:000267218100001 | |
| dc.identifier | 10.1007/s10589-007-9147-4 | |
| dc.identifier | http://www.repositorio.unicamp.br/jspui/handle/REPOSIP/54434 | |
| dc.identifier | http://www.repositorio.unicamp.br/handle/REPOSIP/54434 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/54434 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1277948 | |
| dc.description | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
| dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
| dc.description | We present a new algorithm for solving bilevel programming problems without reformulating them as single-level nonlinear programming problems. This strategy allows one to take profit of the structure of the lower level optimization problems without using non-differentiable methods. The algorithm is based on the inexact-restoration technique. Under some assumptions on the problem we prove global convergence to feasible points that satisfy the approximate gradient projection (AGP) optimality condition. Computational experiments are presented that encourage the use of this method for general bilevel problems. | |
| dc.description | 43 | |
| dc.description | 3 | |
| dc.description | 307 | |
| dc.description | 328 | |
| dc.description | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
| dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
| dc.description | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
| dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
| dc.description | CNPq [PRONEX-CNPq/FAPERJ E-26/171.164/2003-APQ1] | |
| dc.description | FAPESP [06/53768-0, 05-56773-1] | |
| dc.language | en | |
| dc.publisher | Springer | |
| dc.publisher | New York | |
| dc.publisher | EUA | |
| dc.relation | Computational Optimization And Applications | |
| dc.relation | Comput. Optim. Appl. | |
| dc.rights | fechado | |
| dc.rights | http://www.springer.com/open+access/authors+rights?SGWID=0-176704-12-683201-0 | |
| dc.source | Web of Science | |
| dc.subject | Bilevel programming | |
| dc.subject | Inexact-restoration | |
| dc.subject | Optimization | |
| dc.subject | Equilibrium Constraints | |
| dc.subject | Mathematical Programs | |
| dc.subject | Optimization | |
| dc.subject | Algorithm | |
| dc.subject | Convergence | |
| dc.title | An inexact-restoration method for nonlinear bilevel programming problems | |
| dc.type | Artículos de revistas | |
