> On Aug 26, 2015, at 4:51 PM, Wenya Wang <[email protected]> wrote: > Dear NLopt Experts, > > I'my applying the NLopt library in my thesis project. Recently, I > notice that sometimes, the optimization solution obviously violates the first > out of my two constraints. I'm wondering if it's the case that when two > constraints are giving an empty set for optimizing over, one of them will be > violated?
If the feasible set is empty, then by definition no local optimum exists and the algorithms cannot converge (at least, not to anything sensible). _______________________________________________ NLopt-discuss mailing list [email protected] http://ab-initio.mit.edu/cgi-bin/mailman/listinfo/nlopt-discuss
