I am performing some optimizations on some examples using the MMA and the CCSAQ algorithm, but each time l'm changing the order of constraints. The results show that unlike the MMA algorithm (which produces the same result regardless of ordering), the CCSAQ algorithm produces small differences between the runs.
Can this be due to the fact that the CCSAQ constructs simple quadratic approximations (and not MMA) or is it something code related?
I tweaked all of the parameters on the CCSAQ algorithm but the results always differ by a little bit each time (when changing the order of constraints).
I am performing some optimizations on some examples using the MMA and the CCSAQ algorithm, but each time l'm changing the order of constraints. The results show that unlike the MMA algorithm (which produces the same result regardless of ordering), the CCSAQ algorithm produces small differences between the runs.
Can this be due to the fact that the CCSAQ constructs simple quadratic approximations (and not MMA) or is it something code related?
I tweaked all of the parameters on the CCSAQ algorithm but the results always differ by a little bit each time (when changing the order of constraints).