optimization problem with only non convex object function as a convex optimization?

Question

Is it possible to rewrite an optimization problem with only non convex object function as a convex optimization?

I think it is impossible but am having a hard time proving it.

EDIT: What I mean by rewrite is to find equivalent convex problem, by maybe rewriting the objective function or transferring part of the objective function to the constraints.

Thanks.