I’m trying to vectorize an inequality constraint comparing two `Convex`

types. On one side, I have `Convex.MaxAtom`

s, and on the other side, I have `Variable`

s. SO link here. I want to do something like the following:

```
using Convex
t = Variable(1)
v = Variable(10)
x = Variable(1)
z = rand(100)
problem = minimize(x)
problem.constraints += [t >= 0]
ccc = Convex.MaxAtom[]
for i = 1:10
c = -(1. + minimum(x.*z))
cc = t + c
push!(ccc, max(cc, 0.))
end
problem.constraints += [ccc <= v]
```

but I’m getting the following error on the constraint:

```
ERROR: LoadError: MethodError: no method matching isless(::Complex{Int64}, ::Int64)
```

I’m not sure where the `Int64`

types are coming in. Is there a better way of adding this constraint besides looping through and adding individual comparisons like

```
for i = 1:10
problem.constraints += [ccc[i] >= v[i]]
end
```

I’m trying to avoid this because eventually my 10 will be much larger.