Julia 如何向量化凸不等式约束

Julia 如何向量化凸不等式约束,julia,convex,Julia,Convex,我试图对一个不等式约束进行向量化,比较两种凸类型。一方面,我有凸面.MaxAtoms,另一方面,我有Variables。我想做如下事情: using Convex N = 10 t = Variable(1) v = Variable(N) x = Variable(1) z = rand(100) problem = minimize(x) problem.constraints += [t >= 0] ccc = Vector{Convex.MaxAtom}(N) for i =

我试图对一个不等式约束进行向量化,比较两种
类型。一方面,我有
凸面.MaxAtom
s,另一方面,我有
Variable
s。我想做如下事情:

using Convex
N = 10
t = Variable(1)
v = Variable(N)
x = Variable(1)
z = rand(100)

problem = minimize(x)
problem.constraints += [t >= 0]

ccc = Vector{Convex.MaxAtom}(N)
for i = 1:N
    c = -(1. + minimum(x.*z))
    cc = t + c
    ccc[i] = max(cc,0.)
end
problem.constraints += [ccc <= v]
我试图避免这种情况,因为最终我的10会大得多。

在这种情况下(多亏了乌德尔博士),它可以像

c = -(1. + xisim + minimum(x.*z))
cc = t + c
ccc = max(cc,0.)
problem.constraints += [ccc <= v]
c=-(1.+xisim+最小值(x.*z))
cc=t+c
ccc=最大值(cc,0.)
problem.constraints+=[ccc在这种情况下(多亏了Udell博士),它可以作为

c = -(1. + xisim + minimum(x.*z))
cc = t + c
ccc = max(cc,0.)
problem.constraints += [ccc <= v]
c=-(1.+xisim+最小值(x.*z))
cc=t+c
ccc=最大值(cc,0.)
问题.约束+=[ccc