-
**Is your feature request related to a problem? Please describe.**
Product of two vectors
**Describe the solution you'd like**
I am trying to add a constraint x^T y
-
please expose initial_guess for nonconvex_objective
different initial weights will get different result
-
**Describe the bug**
cvxpy is interpreting `cp.multiply(x, (Q @ x))` as `x @ Q @ x`
**To Reproduce**
```
import cvxpy as cp
import numpy as np
N = 5
Q = cp.Parameter((N, N))
x = cp.Varia…
ghost updated
3 years ago
-
Given a model, I want to identify each constraint's convexity. In the suspect package, there are four statuses related to Convexity, Convexity.Convex, Convexity.Linear, Convexity.Concave, Convexity.Un…
-
Thanks for your attention.
I am trying to solve an objective function Support vector machine with a truncated hinge loss.
The objective function as follow:
;
Objective = logsumexp(x)
a = [2;1];
rho = 2;
Constraints = (norm(x-a, 2)
-
Currently, the CVaR optimisation using `NoisyOpt` is a little buggy. Because the weights aren't normalised by default, we must post-process them. However, this post-processing also means that the fina…
-
[yalmip last via git clone]
I try to solve a binear model with solver GUROBI using yalmip.
1st time I got:
Successfully solved (GUROBI-NONCONVEX);
but when re-run .m file, there is a error:
…
-
There seems to be a problem with returned partitions in `nonconvex_divide` for the case 1.1:
https://github.com/LostFan123/pode/blob/30c9f9725ccf760d98c8f37924e5d31ddf452972/pode/pode.py#L584-L586
T…