How can I construct the objective following the DCP ruleset?

2

x has to be a nonnegative variable for the problem to be convex.

Try formulate it using the exponential cone

i.e. something like

objective = z + y^2;
minimize(objective)
subject to
x + y <= 1
{a*y+b,x,z} = exponential(1);