On Nov 9, 2010, at 1:47 PM, Julius Ziegler wrote:
Never mind, I had a signed-ned bug in the code that was setting up the constraints, so none where defined in the case that I reported! It works perfectly now, even when initialising x from outside the solution set!
I'm glad it works for you. The algorithms with nonlinear constraints all attempt to work even if you have a starting point that violates the constraints (is "infeasible").
However, I should point out that local optimization algorithms (like SLSQP, MMA, and COBYLA) can only guarantee convergence to a local optimum if you give a feasible starting point (one that satisfies the constraints). The reason is that you can construct nonlinear problems where finding a feasible point in the first place requires global optimization.
Steven _______________________________________________ NLopt-discuss mailing list [email protected] http://ab-initio.mit.edu/cgi-bin/mailman/listinfo/nlopt-discuss
