dc.creatorMartinez, JM
dc.creatorSantos, LT
dc.creatorSantos, SA
dc.date1997
dc.date2014-12-16T11:31:49Z
dc.date2015-11-26T16:54:17Z
dc.date2014-12-16T11:31:49Z
dc.date2015-11-26T16:54:17Z
dc.date.accessioned2018-03-28T23:41:33Z
dc.date.available2018-03-28T23:41:33Z
dc.identifierInternational Journal Of Computer Mathematics. Taylor & Francis Ltd, v. 64, n. 41732, n. 273, n. 284, 1997.
dc.identifier0020-7160
dc.identifierWOS:A1997YF43700008
dc.identifier10.1080/00207169708804590
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/76068
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/76068
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/76068
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1276814
dc.descriptionWe consider the problem [GRAPHICS] where f(l), ..., f(m):R-n --> R-n are (generally nonlinear) differentiable functions, Omega subset of R-n and n, m can be large. We Introduce a new algorithm for solving this problem that can be implemented in rather modest computer environments. The new method is based on a fast one-dimensional newtonian procedure applied to the objective value of an auxiliary function. We report numerical experiments, which suggest that the new algorithm, combined with a powerful strategy for minimization on spheres, can be an effective tool for solving initial vector coding problems.
dc.description64
dc.description41732
dc.description273
dc.description284
dc.languageen
dc.publisherTaylor & Francis Ltd
dc.publisherAbingdon
dc.publisherInglaterra
dc.relationInternational Journal Of Computer Mathematics
dc.relationInt. J. Comput. Math.
dc.rightsfechado
dc.rightshttp://journalauthors.tandf.co.uk/permissions/reusingOwnWork.asp
dc.sourceWeb of Science
dc.subjectminimax methods
dc.subjectinitial vector coding problem
dc.titleA minimax method with application to the initial vector coding problem
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución