We introduce a fixed point iteration process built on optimization of linear function over compact domain. prove the always converges to and explore set points in various convex sets. In particular, we consider elliptopes derive an algebraic characterization their points. show that attractive elliptope are exactly its vertices. Finally, discuss how can be used for rounding solution semidefinite...

An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...