Mixed-Integer Convex Programming: Branch-and-bound with Frank-Wolfe-based convex relaxations
-
Updated
May 23, 2024 - Julia
Mixed-Integer Convex Programming: Branch-and-bound with Frank-Wolfe-based convex relaxations
A Julia package that solves Linearly Constrained Separable Optimization Problems using ADMM.
Julia implementation for various Frank-Wolfe and Conditional Gradient variants
Proximal operators for nonsmooth optimization in Julia
Add a description, image, and links to the first-order-methods topic page so that developers can more easily learn about it.
To associate your repository with the first-order-methods topic, visit your repo's landing page and select "manage topics."