unset mma_verbose for recursive MMA of dual

darcs-hash:20080915211431-c8de0-0832386c70f3139b990f11683baaf19cd90079be.gz

diff --git a/mma/mma.c b/mma/mma.c
index 0ceffdf7b3ceb711afe8f1d4c33aec9f4da71936..3adb8f3db4f6e9232484691e392fdb5a58e6af07 100644 (file)
--- a/mma/mma.c
+++ b/mma/mma.c
@@ -217,17 +217,20 @@ nlopt_result mma_minimize(int n, nlopt_func f, void *f_data,
 
          while (1) { /* inner iterations */
               double min_dual;
-              int feasible_cur, inner_done;
+              int feasible_cur, inner_done, save_verbose;
               nlopt_result reti;
 
               /* solve dual problem */
               dd.rho = rho; dd.count = 0;
          dual_solution:
+              save_verbose = mma_verbose;
+              mma_verbose = 0;
               reti = nlopt_minimize(
                    dual_alg, m, dual_func, &dd,
                    dual_lb, dual_ub, y, &min_dual,
                    -HUGE_VAL, dual_tolrel,0., 0.,NULL, dual_maxeval,
                    stop->maxtime - (nlopt_seconds() - stop->start));
+              mma_verbose = save_verbose;
               if (reti == NLOPT_FAILURE && dual_alg != NLOPT_LD_MMA) {
                    /* LBFGS etc. converge quickly but are sometimes
                       very finicky if there are any rounding errors in