dc.creatorMartinez, JM
dc.date1998
dc.date2014-07-30T13:51:28Z
dc.date2015-11-26T16:34:07Z
dc.date2014-07-30T13:51:28Z
dc.date2015-11-26T16:34:07Z
dc.date.accessioned2018-03-28T23:16:17Z
dc.date.available2018-03-28T23:16:17Z
dc.identifierInternational Journal Of Computer Mathematics. Taylor & Francis Ltd, v. 70, n. 1, n. 75, n. 86, 1998.
dc.identifier0020-7160
dc.identifierWOS:000079804100006
dc.identifier10.1080/00207169808804737
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/55189
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/55189
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1271102
dc.descriptionThis paper has two main objectives. Firstly, the performance of a recently developed Nonlinear programming algorithm based on Augmented Lagrangians on a family of optimization problems related to the classical Kissing Problem is reported. The test problems are easily defined in purely mathematical terms and its reproduction using standard scientific languages does nor seem to be prone to human errors. Therefore, the figures presented here can be useful to developers of other optimization algorithms. Secondly, the practical results on the geometrical problems described in this paper have an independent interest from a large variety of perspectives, including the historical one. In particular, there exist a large number of related open mathematical problems, and the ability of dealing with them numerically should help to their rigorous elucidation.
dc.description70
dc.description1
dc.description75
dc.description86
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.subjectoptimization
dc.subjectnonlinear constraints
dc.subjectAugmented Lagrangian method
dc.subjectpacking problems
dc.subjectConstraints
dc.subjectAlgorithm
dc.titleAugmented lagrangians and sphere packing problems
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución