I am making the thesis on the problem of circle packing (CPP) in a circle, and I am trying to learn how to use JOptimizer to do some simple optimization. Although my math background is somewhat limited, it is hard for me to work with JOptimizer.
Taken from the packaging circles in the smallest circle: adaptive hybrid algorithm I have the following:
CPP has a fairly simple mathematical representation: 
When converted to a "semi-definite quadratically bounded linear program", it becomes:
Now I'm a little lost. How to configure JOptimizer to optimize this (to a local minimum)? I also have a list of starting points and radii for my circles.
Thanks a lot!