Re:Algorithmic fitting of Japanese candy
by blt on Wednesday November 16, 2016 @11:52PM
(#12974417)
It's not. The intersection constraints are not convex. You could use sequential convex programming to find a local optimum.
edit: to back up my claim: the feasible set of a convex optimization problem must be convex. suppose you have two squares of side length 1 at positions x1 and x2. The following two solutions are feasible:
edit: to back up my claim: the feasible set of a convex optimization problem must be convex. suppose you have two squares of side length 1 at positions x1 and x2. The following two solutions are feasible:
but their midpoint is not: therefore the feasible set is not convex.