-
Notifications
You must be signed in to change notification settings - Fork 3
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Finset algs #2
Finset algs #2
Conversation
…raicOptimization.jl into finset-algs Merge add cvx with benchmark results.
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## main #2 +/- ##
===========================================
- Coverage 97.91% 23.13% -74.78%
===========================================
Files 2 8 +6
Lines 48 376 +328
===========================================
+ Hits 47 87 +40
- Misses 1 289 +288 ☔ View full report in Codecov by Sentry. |
(s::Optimizer)(x::Vector) = s.dynamics(x) | ||
dom(s::Optimizer) = s.state_space | ||
|
||
struct ContinuousOpt <: FinSetAlgebra{Optimizer} end |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Are these continuous decision variables or continuous time differentials? Should be in the docstring.
A[v,e] = -1 | ||
end | ||
end | ||
return A |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
You can do this in linear time with
A = zeros(V,E)
for e in parts(g, :E)
A[src(e),e] = 1
A[tgt(e),e] = -1
end
function draw2(n::Int) | ||
a = rand(1:n) | ||
b = rand(1:n-1) | ||
b += (b >= a) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
wat?
What process are you trying to sample from?
Implemented the translation of a finset algebra to a cospan algebra.
Reimplemented existing code in terms of finset algebras.
Implemented the algebra of network flow graphs and their natural transformation into optimization problems via dual decomposition.
Ran some benchmarks and generated some figures for paper.