Good work.
Can this library solve any convex-concave problem? For example, there are non-convex constraints:
(x + y)^2 -x^2 - y^2 - (x^2 + y^2) ^ (3/2) <= 0, where (x + y)^2 is convex, and -x^2 - y^2 - (x^2 + y^2) ^ (3/2) is concave
-x^2 - y^2 + 100 <= 0
Is obtained solution globally optimal?
Is there any paper to describe the algorithm/method?
Thank you very much.