A straightforward local-search optimization algorithm on the symmetric group
Optimization and Control
2009-04-30 v1
Abstract
Given 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 -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.
Keywords
Cite
@article{arxiv.0904.4518,
title = {A straightforward local-search optimization algorithm on the symmetric group},
author = {Guillermo Morales-Luna},
journal= {arXiv preprint arXiv:0904.4518},
year = {2009}
}