-
# 02-05 Separating and supporting hyperplanes · 모두를 위한 컨벡스 최적화
[https://convex-optimization-for-all.github.io/contents/chapter02/2021/02/11/02_05_Separating_and_supporting_hyperplanes/](https://con…
-
https://web.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf
-
We can formulate the convex constraint `X is PSD` with a non-convex constraint using the Burer-Monteiro formulation
```
X = YYᵀ
```
This can be useful when we have non-convex optimization problem …
-
# 01-02 Convex optimization problem · 모두를 위한 컨벡스 최적화
[https://convex-optimization-for-all.github.io/contents/chapter01/2021/01/28/01_02_convex_optimization_problem/](https://convex-optimization-for…
-
-
## Questions
- polyhedron vs. convex
definition
-
# 03-01-01 Definition · 모두를 위한 컨벡스 최적화
[https://convex-optimization-for-all.github.io/contents/chapter03/2021/02/12/03_01_01_convex_functions_definition/](https://convex-optimization-for-all.github…
-
The current documentation is limited to the `Readme.md` file. A more in depth guide on how to use the toolbox combined with the mathematical basics would be beneficial.
**Proposed structure:**
1…
-
**Describe the bug**
When using `requires_grad=True`, simple convex optimization problems throw segmentation faults.
**To Reproduce**
```python
import numpy as np
import cvxpy as cp
if…
-
I’d like to discuss something a bit heretical (repost from a Discord discussion with @SteveDiamond).
I recently had to solve a problem related to calculating accumulated rectangular areas and taki…