Thanks, Miles! inv_pos() is the way to go!
On Sunday, March 22, 2015 at 4:35:22 PM UTC-4, Miles Lubin wrote: > > In the language of DCP, the division operator doesn't preserve convexity, > so I'm assuming that's why it's not implemented. > Looking at the list of available operations ( > http://convexjl.readthedocs.org/en/latest/operations.html), you may want > to try inv_pos(x-t). > > On Saturday, March 21, 2015 at 9:08:18 PM UTC-4, Dongning Guo wrote: >> >> An error occurred upon my first attempt to use Julia for solving a >> meaningful convex optimization problem: >> >> using Convex >> x = Variable(3) >> t = rand(3) >> s = t+rand(3) >> constraints = [x>=0, x<=s] >> p = minimize(sum(1./(x-t)), constraints) >> >> `./` has no method matching ./(::Int64, ::AdditionAtom) >> >> Searched for awhile for a fix but to no avail. Can anyone help? Thanks >> in advance! >> >
