You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
After in iteration 918, we go into a simplex descent step over the convex hull. However, the step size computed is always zero. Hence, we do this until t + number_of_iterations > 3000 where t=918 is the global FW iteration and number_of_steps counts the number of simplex descent steps. Aka we have do more than 2000 simplex descent steps which takes ages.
In the callback of the simplex descent, we should probably have t + number_of_steps as iteration, no? Currently, we get of bunch of SD steps with the same iteration counter,
bcg_directions_error.jl
.t + number_of_iterations > 3000
wheret=918
is the global FW iteration andnumber_of_steps
counts the number of simplex descent steps. Aka we have do more than 2000 simplex descent steps which takes ages.One example print out from the simplex descent:
Considering that
maximum(c) - minimum(c)
, so the gap within the active set, is nearly at the tolerance, this could be a numerics issue.The text was updated successfully, but these errors were encountered: