int ret = easy_sdp(total_block_size, nb_var, C, a, constraints, 0.0, &X, &y, &Z, &pobj, &dobj);
int ret = easy_sdp(total_block_size, nb_var, C, a, constraints, 0.0, &X, &y, &Z, &pobj, &dobj);
+ fclose(stdout);
+ stdout=stdout_sav;
switch(ret){
case 0:
switch(ret){
case 0:
- case 1: printf("SUCCESS The problem is primal infeasible\n");
+ case 1: DEBUG0("SUCCESS The problem is primal infeasible\n");
break;
break;
- case 2: printf("SUCCESS The problem is dual infeasible\n");
+ case 2: DEBUG0("SUCCESS The problem is dual infeasible\n");
break;
break;
- case 3: printf("Partial SUCCESS A solution has been found, but full accuracy was not achieved. One or more of primal infeasibility, dual infeasibility, or relative duality gap are larger than their tolerances, but by a factor of less than 1000.\n");
+ case 3: DEBUG0("Partial SUCCESS A solution has been found, but full accuracy was not achieved. One or more of primal infeasibility, dual infeasibility, or relative duality gap are larger than their tolerances, but by a factor of less than 1000.\n");
break;
break;
- case 4: printf("Failure. Maximum number of iterations reached.");
+ case 4: DEBUG0("Failure. Maximum number of iterations reached.");
break;
break;
- case 5: printf("Failure. Stuck at edge of primal feasibility.");
+ case 5: DEBUG0("Failure. Stuck at edge of primal feasibility.");