-
Notifications
You must be signed in to change notification settings - Fork 16
Refactoring #164
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
Refactoring #164
Conversation
added function to compute sugradient in SDDPoptimize.jl
…ogramming.jl into new-bounds
New bounds sdp
…ogramming.jl into new-bounds
Merge test
…nd integer not working
|
When do we get to see the dual code? :) I'm very interested |
|
I was planning to release it after the publication of the article on arxiv, but I have been a bit busy since :p If you are interested, I can tidy up the code and release it by the end of the week! |
|
No rush, you have your thesis to finish! |
|
@odow I released dual SDDP in this repo: To use dual SDDP, you should be on the branch I give some example in a jupyter notebook. The code is not that clean, but I hope it conveys well the ideas behind dual SDDP :) I think that writing the dual SP should be straightforward with MOI, as we have access to the Linear Bellman operator coded directly as a LP and we have access to the corresponding matrix. I plan to implement this after the JuMP dev workshop, in a new version of SDDP in JuliaStochOpt. Do not hesitate if you have any remark concerning the code/the algorithm! |
|
I'm very pleased to see this. Great work. I'm submitting my thesis Tuesday so will look properly after then. |
|
Good luck for the final rush! |
iterate!function to ease dual SDDP code