Akshay Agrawal
Akshay Agrawal
### Discussed in https://github.com/cvxpy/cvxpy/discussions/1522 This feature has been suggested independently by multiple users. Originally posted by **erelsgl** November 2, 2021 In some problems, some solvers may be better than others,...
On solver errors, we should unpack as much information as possible into a problem before raising the `SolverError` exception. Otherwise errors become impossible to debug. See #1536 for some context.
For extremely big problems (problems too large to fit in RAM/GPU memory), the stochastic solve method from chapter 6 of the monograph is useful. This has already been implemented. This...
The quality of an embedding in PyMDE is judged by the collection of of Euclidean distances between pairs of embedding distances. Euclidean distance is natural for visualization, since it is...
Implement a method for incrementally embedding, i.e., for adding new points to an existing embedding, as described in chapter 2, section 4.2 of the monograph. All the necessary pieces are...
It is in principle possible to have multiple constraint sets, so long as the constraints are on mutually exclusive subsets of the items. For example, for `n=1000` items, the vectors...
Chapter 7 of the monograph has some synthetic numerical examples, for the optimization subroutine. We should add Github notebooks to reproduce them.
Both layers should support warm-starting a solve at the solution to the previous call.
Compilation time of a standard form LP (minimize c @ x, subject to x >= 0) increases linearly with the number of variables (for both OSQP and SCS). The slowdown...
Remove mermaid, stat from layout and put them in diagrams