A straightforward local-search optimization algorithm on the symmetric group

Simple item page
dc.creatorMorales-Luna, Guillermo
dc.date2009-04-29
dc.date.accessioned2026-07-07T13:09:53Z
dc.date.available2026-07-07T13:09:53Z
dc.descriptionGiven a real objective function defined over the symmetric group, a direct local-search algorithm is proposed, and its complexity is estimated. In particular for an $n$-dimensional unit vector we are interested in the permutation isometry that acts on this vector by mapping it into a cone of a given angle.
dc.identifierhttps://arxiv.org/abs/0904.4518
dc.identifierhttp://arxiv.org/abs/0904.4518
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/228885
dc.subjectOptimization and Control
dc.titleA straightforward local-search optimization algorithm on the symmetric group
dc.typetext

Files

Collections

arXiv