Solves a convex optimization problem with a linear objective minimize c'*x subject to f(x) <= 0 G*x <= h A*x = b. f is vector valued, convex and twice differentiable. The linear inequalities are with respect to a cone C defined as the Cartesian product of N + M + 1 cones: C = C_0 x C_1 x ...
(F ConvexProg, c, G, h, A, b *matrix.FloatMatrix, dims *sets.DimensionSet, solopts *SolverOptions)
source not stored for this graph (policy: none)