| dc.creator | Martinez, JM | |
| dc.date | 1999 | |
| dc.date | 2014-12-02T16:27:56Z | |
| dc.date | 2015-11-26T16:35:29Z | |
| dc.date | 2014-12-02T16:27:56Z | |
| dc.date | 2015-11-26T16:35:29Z | |
| dc.date.accessioned | 2018-03-28T23:17:58Z | |
| dc.date.available | 2018-03-28T23:17:58Z | |
| dc.identifier | Zeitschrift Fur Angewandte Mathematik Und Mechanik. Wiley-v C H Verlag Gmbh, v. 79, n. 4, n. 267, n. 276, 1999. | |
| dc.identifier | 0044-2267 | |
| dc.identifier | WOS:000079868600005 | |
| dc.identifier | 10.1002/(SICI)1521-4001(199904)79:4<267 | |
| dc.identifier | http://www.repositorio.unicamp.br/jspui/handle/REPOSIP/53131 | |
| dc.identifier | http://www.repositorio.unicamp.br/handle/REPOSIP/53131 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/53131 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1271527 | |
| dc.description | An iterative model algorithm Sbr minimizing a Lipschitz-continuous function subject to continuous constraints is introduced. Each iteration, of the method proceeds in two phases. In the first phase, feasibility is improved and, as a result, a more feasible intermediate point is obtained. In the second phase the algorithm tries to obtain a decrease of the objective function on an auxiliary feasible set. The output of the second phase is a trial point that is compared with the current iterate by means of a suitable merit function. If the merit function is sufficiently decreased, the trial point is accepted. Otherwise, it is rejected and the second phase is repeated in a reduced domain. Global convergence results are proved and practical applications are commented. | |
| dc.description | 79 | |
| dc.description | 4 | |
| dc.description | 267 | |
| dc.description | 276 | |
| dc.language | en | |
| dc.publisher | Wiley-v C H Verlag Gmbh | |
| dc.publisher | Berlin | |
| dc.publisher | Alemanha | |
| dc.relation | Zeitschrift Fur Angewandte Mathematik Und Mechanik | |
| dc.relation | Z. Angew. Math. Mech. | |
| dc.rights | fechado | |
| dc.rights | http://olabout.wiley.com/WileyCDA/Section/id-406071.html | |
| dc.source | Web of Science | |
| dc.subject | nonlinear programming | |
| dc.subject | trust regions | |
| dc.subject | global convergence | |
| dc.subject | non-derivative methods | |
| dc.subject | direct search methods | |
| dc.title | A direct search method for nonlinear programming | |
| dc.type | Artículos de revistas | |
