-
I tried a simple program based on the first example in manual.pdf. Here is the Matlab code
% Simple conic optimization (first example in manual).
m = 3; % n = 2
A = [1, 2, 3; 4, 5, 6];
b = […
-
**Is your feature request related to a problem? Please describe.**
Many convex/conic optimization papers and solvers assume that the problem has been written in some conic standard form usually
min …
-
Dear all,
I tried to run my first ACADO OCP. I formulated the following OCP:
A straight descent of an an aircraft from the state (x = 0.0, h= 36000 ft, v= 460 kt) to the state (x = 150.0 NM, h=…
ghost updated
6 years ago
-
**Describe the bug**
When generating large sparse programs, CVXPY spends a huge amount of memory canonicalizing the expression and passing it to a solver. In particular, a quadratic program with at m…
-
**Is your feature request related to a problem? Please describe.**
A number of `AddConstraint` methods in `MathematicalProgram` do not return types of `Binding`. Examples include `AddSosConstraint` w…
-
I wrote a program using coneqp with a matrix G that implies that x = s and I need vec(x) to be positive semidefinite.
My cone is a semidefinite cone so this should imply vec(s) is p.s.
This is the cas…
-
Hi there!
This issue is a catch-all for documentation improvement suggestions. I'll keep it updated with things to work on, rather than having lots of separate issues.
* If you have suggestion…
-
**Is your feature request related to a problem? Please describe.**
The problem is as follows: when I give CVXPY an SDP in primal form to solve with Mosek, it automatically dualizes it and it solves i…
-
As a result of a recent [discussion](https://github.com/cvxpy/cvxpy/discussions/2087) we identified the potential benefit of having heuristics to decide whether or not to dualize problem before handin…
-
**No quadratic programming solver available in Scipy.**
Quadratic programming (QP) solvers are a fundamental tool in engineering.
Scipy provides performant Linear Program solvers through [linprog]…