comparison util/SMALL_solve.m @ 140:31d2864dfdd4 ivand_dev

Audio Impainting additional constraints with cvx added

     b = Problem.b1;
 else
     b = Problem.b;            % The right-hand-side vector.
 end
 %%
-fprintf('\nStarting solver %s... \n', solver.name);
+if (solver.profile)
+    fprintf('\nStarting solver %s... \n', solver.name);
+end
+
 start=cputime;
 tStart=tic;
 if strcmpi(solver.toolbox,'sparselab')
     y = eval([solver.name,'(SparseLab_A, b, n,',solver.param,');']);
 elseif strcmpi(solver.toolbox,'sparsify')

 
 %%
 %   Sparse representation time
 tElapsed=toc(tStart);
 solver.time = cputime - start;
-fprintf('Solver %s finished task in %2f seconds (cpu time). \n', solver.name, solver.time);
-fprintf('Solver %s finished task in %2f seconds (tic-toc time). \n', solver.name, tElapsed);
+if (solver.profile)
+    fprintf('Solver %s finished task in %2f seconds (cpu time). \n', solver.name, solver.time);
+    fprintf('Solver %s finished task in %2f seconds (tic-toc time). \n', solver.name, tElapsed);
+end
 solver.time=tElapsed;
 % geting around out of memory problem when converting big matrix from
 % sparse to full...
 
 if isfield(Problem, 'sparse')&&(Problem.sparse==1)
     solver.solution = y;
 else
     solver.solution = full(y);
 end
 if isfield(Problem,'reconstruct')
-%   Reconstruct the signal from the solution
-solver.reconstructed  = Problem.reconstruct(solver.solution);
+    %   Reconstruct the signal from the solution
+    solver.reconstructed  = Problem.reconstruct(solver.solution);
 end
 end