Hello, Many thanks for making this great code available. I've been using the MMA algorithm for multiresolution shape optimisation.
Basically I have to update my geometry every time the algorithm evaluates the cost function. The problem is I keep getting several very unfeasible geometries for few iterations before the solution starts to converge. Is there a way to make the sub problem more conservative at the start of the iteration? Kosala (Engineering PhD student, Cambridge University) _______________________________________________ NLopt-discuss mailing list [email protected] http://ab-initio.mit.edu/cgi-bin/mailman/listinfo/nlopt-discuss
