Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  discusses computational complexity of conceptual successive convex relaxation methods proposed by Kojima and TunA§el for approximating a convex relaxation of a compact subsetof the n-dimensional Euclidean spaceR n . Here,C0 denotes a nonempty compact convex subset ofR n , anda set of finitely or infinitely many quadratic functions.  evaluate the number of iterations which the successive convex relaxation methods require to attain a convex relaxation ofF with a given accuracy e, in terms of e, the diameter ofC0, the diameter ofF, and some other quantities characterizing the Lipschitz continuity, the nonlinearity, and the nonconvexity of the setof quadratic functions.
['Masakazu Kojima', 'Akiko Takeda']
I am writing a research paper on a idea Complexity Analysis of Successive Convex Relaxation Methods for Nonconvex Sets
[{"from": "human", "value": "I am writing a research paper on a idea Complexity Analysis of Successive Convex Relaxation Methods for Nonconvex Sets"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  discusses computational complexity of conceptual successive convex relaxation methods proposed by Kojima and TunA\u00a7el for approximating a convex relaxation of a compact subsetof the n-dimensional Euclidean spaceR n . Here,C0 denotes a nonempty compact convex subset ofR n , anda set of finitely or infinitely many quadratic functions.  evaluate the number of iterations which the successive convex relaxation methods require to attain a convex relaxation ofF with a given accuracy e, in terms of e, the diameter ofC0, the diameter ofF, and some other quantities characterizing the Lipschitz continuity, the nonlinearity, and the nonconvexity of the setof quadratic functions."}]