Semidefinite Programming with Homotopy Conditional Gradient Method (HCGM) and Vu-Condat methods for solving two problems: Fashion-MNIST classification using k-means clustering and geometric embedding for the Sparsest Cut Problem.
python
data-science
machine-learning
jupyter-notebook
scipy
image-classification
matplotlib
semidefinite-programming
k-means-clustering
fashion-mnist
primal-dual-algorithm
geometric-embeddings
uniform-sparse-approxiamtion
hcgm
-
Updated
Sep 25, 2022 - Jupyter Notebook