-
# 04-04 Partial optimization · 모두를 위한 컨벡스 최적화
[https://convex-optimization-for-all.github.io/contents/chapter04/2020/02/08/04_04_Partial_optimization/](https://convex-optimization-for-all.github.io…
-
I’m working on a project involving optimal routing in DeFi, inspired by the paper **_Optimal Routing for Constant Function Market Makers_** by Angeris et al. I’d love some help understanding how to se…
-
# 02-01 Affine and Convex Sets · 모두를 위한 컨벡스 최적화
[https://convex-optimization-for-all.github.io/contents/chapter02/2021/01/08/02_01_Affine_and_Convex_Sets/](https://convex-optimization-for-all.githu…
-
https://web.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf
-
# 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…
-
-
## Questions
- polyhedron vs. convex
definition
-
# 13-04-01 Example lasso dual · 모두를 위한 컨벡스 최적화
[https://convex-optimization-for-all.github.io/contents/chapter13/2021/04/05/13_04_01_Example_lasso_dual/](https://convex-optimization-for-all.github.…
-
# 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…
-
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 …