A straightforward local-search optimization algorithm on the symmetric group

Details A straightforward local-search optimization algorithm on the symmetric group A straightforward local-search optimization algorithm on the symmetric group

2009-04-29

arxiv.org/abs/0904.4518v1

Mathematics

Optimization and Control

Scientific paper

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 $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.

Affiliated with

Also associated with

No associations

Rating

A straightforward local-search optimization algorithm on the symmetric group does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A straightforward local-search optimization algorithm on the symmetric group, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A straightforward local-search optimization algorithm on the symmetric group will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-511085