MISolver.cc 19 KB
Newer Older
Henrik Zimmer's avatar
Henrik Zimmer committed
1
2
/*===========================================================================*\
 *                                                                           *
Henrik Zimmer's avatar
Henrik Zimmer committed
3
 *                               CoMISo                                      *
Henrik Zimmer's avatar
Henrik Zimmer committed
4
 *      Copyright (C) 2008-2009 by Computer Graphics Group, RWTH Aachen      *
Henrik Zimmer's avatar
Henrik Zimmer committed
5
 *                           www.rwth-graphics.de                            *
Henrik Zimmer's avatar
Henrik Zimmer committed
6
 *                                                                           *
Henrik Zimmer's avatar
Henrik Zimmer committed
7
8
 *---------------------------------------------------------------------------* 
 *  This file is part of CoMISo.                                             *
Henrik Zimmer's avatar
Henrik Zimmer committed
9
 *                                                                           *
Henrik Zimmer's avatar
Henrik Zimmer committed
10
11
12
13
 *  CoMISo is free software: you can redistribute it and/or modify           *
 *  it under the terms of the GNU General Public License as published by     *
 *  the Free Software Foundation, either version 3 of the License, or        *
 *  (at your option) any later version.                                      *
Henrik Zimmer's avatar
Henrik Zimmer committed
14
15
16
17
 *                                                                           *
 *  CoMISo is distributed in the hope that it will be useful,                *
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of           *
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the            *
Henrik Zimmer's avatar
Henrik Zimmer committed
18
 *  GNU General Public License for more details.                             *
Henrik Zimmer's avatar
Henrik Zimmer committed
19
 *                                                                           *
Henrik Zimmer's avatar
Henrik Zimmer committed
20
21
 *  You should have received a copy of the GNU General Public License        *
 *  along with CoMISo.  If not, see <http://www.gnu.org/licenses/>.          *
Henrik Zimmer's avatar
Henrik Zimmer committed
22
 *                                                                           *
Henrik Zimmer's avatar
Henrik Zimmer committed
23
\*===========================================================================*/ 
Henrik Zimmer's avatar
Henrik Zimmer committed
24
25


David Bommes's avatar
David Bommes committed
26
#include <CoMISo/Config/config.hh>
27
28
#include "MISolver.hh"

29
#if(COMISO_QT_AVAILABLE)
30
#include <CoMISo/QtWidgets/MISolverDialogUI.hh>
31
32
#endif

David Bommes's avatar
David Bommes committed
33
34
35
36
#if COMISO_GUROBI_AVAILABLE
  #include <gurobi_c++.h>
#endif

David Bommes's avatar
David Bommes committed
37
38
#include <CoMISo/Utils/StopWatch.hh>

39
40
41
#include <gmm/gmm.h>
#include <float.h>

42
43
44
// hack for testing only
#include "SparseQRSolver.hh"
#include "UMFPACKSolver.hh"
45
#include "EigenLDLTSolver.hh"
David Bommes's avatar
David Bommes committed
46

47
48
#define ROUND(x) ((x)<0?int((x)-0.5):int((x)+0.5))

49
namespace COMISO {
50
51
52
53
54
55
56
57



// Constructor
MISolver::MISolver() 
{
  // default parameters
  initial_full_solution_ = true;
David Bommes's avatar
David Bommes committed
58
  iter_full_solution_    = true;
59
60
  final_full_solution_   = true;

David Bommes's avatar
David Bommes committed
61
62
63
  direct_rounding_   = false;
  no_rounding_       = false;
  multiple_rounding_ = true;
David Bommes's avatar
David Bommes committed
64
  gurobi_rounding_   = false;
David Bommes's avatar
David Bommes committed
65
  cplex_rounding_    = false;
66

David Bommes's avatar
David Bommes committed
67
  max_local_iters_ = 100000;
68
  max_local_error_ = 1e-3;
David Bommes's avatar
David Bommes committed
69
  max_cg_iters_    = 50;
70
  max_cg_error_    = 1e-3;
David Bommes's avatar
David Bommes committed
71
72
73

  multiple_rounding_threshold_ = 0.5;

David Bommes's avatar
David Bommes committed
74
75
  gurobi_max_time_ = 60;

76
77
  noisy_ = 0;
  stats_ = true;
78
79

  use_constraint_reordering_ = true;
80
81
}

David Bommes's avatar
David Bommes committed
82

83
84
85
//-----------------------------------------------------------------------------


David Bommes's avatar
David Bommes committed
86
87
88
89
90
91
void 
MISolver::solve_no_rounding( 
    CSCMatrix& _A, 
    Vecd&      _x, 
    Vecd&      _rhs )
{
92
93
  direct_solver_.calc_system_gmm(_A);
  direct_solver_.solve(_x, _rhs);
David Bommes's avatar
David Bommes committed
94
95
96
97
98
99
100
}


//-----------------------------------------------------------------------------


void 
101
102
103
104
MISolver::resolve(
    Vecd&      _x,
    Vecd&      _rhs )
{
105
  direct_solver_.solve(_x, _rhs);
106
107
108
109
110
111
112
}


//-----------------------------------------------------------------------------


void
David Bommes's avatar
David Bommes committed
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
MISolver::solve_direct_rounding( 
    CSCMatrix& _A, 
    Vecd&      _x, 
    Vecd&      _rhs, 
    Veci&      _to_round)
{
  Veci to_round(_to_round);
  // copy to round vector and make it unique
  std::sort(to_round.begin(), to_round.end());
  Veci::iterator last_unique;
  last_unique = std::unique(to_round.begin(), to_round.end());
  int r = last_unique - to_round.begin();
  to_round.resize( r);

  // initalize old indices
  Veci old_idx(_rhs.size());
  for(unsigned int i=0; i<old_idx.size(); ++i)
    old_idx[i] = i;
131
132
  direct_solver_.calc_system_gmm(_A);
  direct_solver_.solve(_x, _rhs);
David Bommes's avatar
David Bommes committed
133

134
135
136
137
  // check solver performance (only for testing!!!)
  {
    StopWatch sw;

138
    // hack
David Bommes's avatar
David Bommes committed
139
140
    const bool enable_performance_test = false;

141
    // performance comparison code
David Bommes's avatar
changed    
David Bommes committed
142
#if(COMISO_SUITESPARSE_SPQR_AVAILABLE)
David Bommes's avatar
David Bommes committed
143
    if(enable_performance_test)
144
145
146
147
148
149
150
151
152
153
154
155
156
    {
      sw.start();
      COMISO::SparseQRSolver spqr;
      spqr.calc_system_gmm(_A);
      std::cerr << "SparseQR factor took: " << sw.stop()/1000.0 << "s\n";
      Vecd x2(_x);
      sw.start();
      spqr.solve(x2,_rhs);
      std::cerr << "SparseQR solve took: " << sw.stop()/1000.0 << "s\n";
      Vecd res(_x);
      gmm::add(_x,gmm::scaled(x2,-1.0),res);
      std::cerr << "DIFFERENCE IN RESULT: " << gmm::vect_norm2(res) << std::endl;
    }
David Bommes's avatar
changed    
David Bommes committed
157
#endif
158
159

    // performance comparison code
160
#if(COMISO_SUITESPARSE_AVAILABLE)
David Bommes's avatar
David Bommes committed
161
    if(enable_performance_test)
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
    {
      sw.start();
      COMISO::UMFPACKSolver umf;
      umf.calc_system_gmm(_A);
      std::cerr << "UMFPack factor took: " << sw.stop()/1000.0 << "s\n";
      Vecd x3(_x);
      sw.start();
      umf.solve(x3,_rhs);
      std::cerr << "UMFPack solve took: " << sw.stop()/1000.0 << "s\n";
      Vecd res2(_x);
      gmm::add(_x,gmm::scaled(x3,-1.0),res2);
      std::cerr << "UMFPACK DIFFERENCE IN RESULT: " << gmm::vect_norm2(res2) << std::endl;
    }

    // performance comparison code
David Bommes's avatar
David Bommes committed
177
    if(enable_performance_test)
178
179
180
181
182
183
184
185
186
187
188
189
190
    {
      sw.start();
      COMISO::CholmodSolver chol;
      chol.calc_system_gmm(_A);
      std::cerr << "Choldmod factor took: " << sw.stop()/1000.0 << "s\n";
      Vecd x4(_x);
      sw.start();
      chol.solve(x4,_rhs);
      std::cerr << "Choldmod solve took: " << sw.stop()/1000.0 << "s\n";
      Vecd res(_x);
      gmm::add(_x,gmm::scaled(x4,-1.0),res);
      std::cerr << "DIFFERENCE IN RESULT: " << gmm::vect_norm2(res) << std::endl;
    }
191
192
#endif

David Bommes's avatar
David Bommes committed
193
#if(COMISO_EIGEN3_AVAILABLE)
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
    // performance comparison code
    if(enable_performance_test)
    {
      sw.start();
      COMISO::EigenLDLTSolver ldlt;
      ldlt.calc_system_gmm(_A);
      std::cerr << "Eigen LDLT factor took: " << sw.stop()/1000.0 << "s\n";
      Vecd x5(_x);
      sw.start();
      ldlt.solve(x5,_rhs);
      std::cerr << "Eigen LDLT solve took: " << sw.stop()/1000.0 << "s\n";
      Vecd res(_x);
      gmm::add(_x,gmm::scaled(x5,-1.0),res);
      std::cerr << "DIFFERENCE IN RESULT: " << gmm::vect_norm2(res) << std::endl;
    }
#endif
210
  }
David Bommes's avatar
David Bommes committed
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237

  // round and eliminate variables
  Vecui elim_i;
  Vecd  elim_v;
  for( unsigned int i=0; i < to_round.size(); ++i)
  {
    _x[to_round[i]] = ROUND(_x[to_round[i]]);
    elim_i.push_back(to_round[i]);
    elim_v.push_back(_x[to_round[i]]);
    // update old idx
    old_idx[to_round[i]] = -1;
  }

  Veci::iterator new_end = std::remove( old_idx.begin(), old_idx.end(), -1);
  old_idx.resize( new_end-old_idx.begin());
  // eliminate vars from linear system
  Vecd xr(_x);
  COMISO_GMM::eliminate_csc_vars2( elim_i, elim_v, _A, xr, _rhs);

  // std::cerr << "size A: " << gmm::mat_nrows(_A) << " " << gmm::mat_ncols(_A) 
  // 	    << std::endl;
  // std::cerr << "size x  : " << xr.size() << std::endl;
  // std::cerr << "size rhs: " << _rhs.size() << std::endl;

  // final full solution
  if( gmm::mat_ncols( _A) > 0)
  {
238
239
240
    //    direct_solver_.update_system_gmm(_A);
    direct_solver_.calc_system_gmm(_A);
    direct_solver_.solve( xr, _rhs);
David Bommes's avatar
David Bommes committed
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
  }

  // store solution values to result vector
  for(unsigned int i=0; i<old_idx.size(); ++i)
  {
    _x[ old_idx[i] ] = xr[i];
  }
}


//-----------------------------------------------------------------------------


void 
MISolver::solve_iterative( 
    CSCMatrix& _A, 
    Vecd&      _x, 
    Vecd&      _rhs, 
    Veci&      _to_round,
    bool       _fixed_order )
{
  // StopWatch
  COMISO::StopWatch sw;
  double time_search_next_integer = 0;

266
  // some statistics
David Bommes's avatar
David Bommes committed
267
268
269
270
271
272
  n_local_ = 0;
  n_cg_    = 0;
  n_full_  = 0;

  // reset cholmod step flag
  cholmod_step_done_ = false;
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290

  Veci to_round(_to_round);
  // if the order is not fixed, uniquify the indices
  if( !_fixed_order)
  {
    // copy to round vector and make it unique
    std::sort(to_round.begin(), to_round.end());
    Veci::iterator last_unique;
    last_unique = std::unique(to_round.begin(), to_round.end());
    int r = last_unique - to_round.begin();
    to_round.resize( r);
  }

  // initalize old indices
  Veci old_idx(_rhs.size());
  for(unsigned int i=0; i<old_idx.size(); ++i)
    old_idx[i] = i;

David Bommes's avatar
David Bommes committed
291
  if( initial_full_solution_)
292
293
  {
    if( noisy_ > 2) std::cerr << "initial full solution" << std::endl;
294
295
    direct_solver_.calc_system_gmm(_A);
    direct_solver_.solve(_x, _rhs);
296

David Bommes's avatar
David Bommes committed
297
    cholmod_step_done_ = true;
298

David Bommes's avatar
David Bommes committed
299
300
    ++n_full_;
  }
301
302
303
304
305
306
307
308
309
310
311
312
313
314

  // neighbors for local optimization
  Vecui neigh_i;

  // Vector for reduced solution
  Vecd xr(_x);

  // loop until solution computed
  for(unsigned int i=0; i<to_round.size(); ++i)
  {
    if( noisy_ > 0)
    {
      std::cerr << "Integer DOF's left: " << to_round.size()-(i+1) << " ";
      if( noisy_ > 1)
David Bommes's avatar
David Bommes committed
315
        std::cerr << "residuum_norm: " << COMISO_GMM::residuum_norm( _A, xr, _rhs) << std::endl;
316
317
318
319
320
    }

    // index to eliminate
    unsigned int i_best = 0;

David Bommes's avatar
David Bommes committed
321
322
323
    // position in round vector
    unsigned int tr_best = 0;

324
325
326
327
328
329
    if( _fixed_order ) // if order is fixed, simply get next index from to_round
    {
      i_best = to_round[i];
    }
    else               // else search for best rounding candidate
    {
David Bommes's avatar
David Bommes committed
330
      sw.start();
331
332
333
334
335
336
337
338
339
340
      // find index yielding smallest rounding error
      double       r_best = FLT_MAX;
      for(unsigned int j=0; j<to_round.size(); ++j)
      {
        if( to_round[j] != -1)
        {
          int cur_idx = to_round[j];
          double rnd_error = fabs( ROUND(xr[cur_idx]) - xr[cur_idx]);
          if( rnd_error < r_best)
          {
David Bommes's avatar
David Bommes committed
341
342
343
            i_best  = cur_idx;
            r_best  = rnd_error;
	    tr_best = j;
344
345
346
          }
        }
      }
David Bommes's avatar
David Bommes committed
347
      time_search_next_integer += sw.stop();
348
349
350
351
352
353
354
355
356
357
358
359
    }

    // store rounded value
    double rnd_x = ROUND(xr[i_best]);
    _x[ old_idx[i_best] ] = rnd_x;

    // compute neighbors
    neigh_i.clear();
    Col col = gmm::mat_const_col(_A, i_best);
    ColIter it  = gmm::vect_const_begin( col);
    ColIter ite = gmm::vect_const_end  ( col);
    for(; it!=ite; ++it)
David Bommes's avatar
David Bommes committed
360
      if(it.index() != i_best)
361
362
363
        neigh_i.push_back(it.index());

    // eliminate var
David Bommes's avatar
David Bommes committed
364
365
    COMISO_GMM::fix_var_csc_symmetric(i_best, rnd_x, _A, xr, _rhs);
    to_round[tr_best] = -1;
366

David Bommes's avatar
David Bommes committed
367
368
369
370
    // 3-stage update of solution w.r.t. roundings
    // local GS / CG / SparseCholesky
    update_solution( _A, xr, _rhs, neigh_i);
  }
371

David Bommes's avatar
David Bommes committed
372
373
374
375
  // final full solution?
  if( final_full_solution_)
  {
    if( noisy_ > 2) std::cerr << "final full solution" << std::endl;
376

David Bommes's avatar
David Bommes committed
377
    if( gmm::mat_ncols( _A) > 0)
378
    {
David Bommes's avatar
David Bommes committed
379
      if(cholmod_step_done_)
380
	direct_solver_.update_system_gmm(_A);
David Bommes's avatar
David Bommes committed
381
      else
382
	direct_solver_.calc_system_gmm(_A);
383

384
      direct_solver_.solve( xr, _rhs);
David Bommes's avatar
David Bommes committed
385
      ++n_full_;
386
    }
David Bommes's avatar
David Bommes committed
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
  }

  // store solution values to result vector
  for(unsigned int i=0; i<old_idx.size(); ++i)
  {
    _x[ old_idx[i] ] = xr[i];
  }

  // output statistics
  if( stats_)
  {
    std::cerr << "\t" << __FUNCTION__ << " *** Statistics of MiSo Solver ***\n";
    std::cerr << "\t\t Number of CG    iterations  = " << n_cg_ << std::endl;
    std::cerr << "\t\t Number of LOCAL iterations  = " << n_local_ << std::endl;
    std::cerr << "\t\t Number of FULL  iterations  = " << n_full_ << std::endl;
    std::cerr << "\t\t Number of ROUNDING          = " << _to_round.size() << std::endl;
    std::cerr << "\t\t time searching next integer = " << time_search_next_integer / 1000.0 <<"s\n";
    std::cerr << std::endl;
  }
}
407
408
409



David Bommes's avatar
David Bommes committed
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
//-----------------------------------------------------------------------------


void 
MISolver::update_solution( 
    CSCMatrix& _A, 
    Vecd&      _x, 
    Vecd&      _rhs, 
    Vecui&     _neigh_i )
{
  // set to not converged
  bool converged = false;

  // compute new solution
  if(max_local_iters_ > 0)
  {
    if( noisy_ > 2)std::cerr << "use local iteration ";

    int    n_its     = max_local_iters_;
    double tolerance = max_local_error_;
    converged = siter_.gauss_seidel_local(_A, _x, _rhs, _neigh_i, n_its, tolerance);

    ++n_local_;
  }


  // conjugate gradient
  if( !converged && max_cg_iters_ > 0)
  {
    if( noisy_ > 2) std::cerr << ", cg ";

    int max_cg_iters = max_cg_iters_;
    double tolerance = max_cg_error_;
    converged = siter_.conjugate_gradient(_A, _x,_rhs, max_cg_iters, tolerance);

    if( noisy_ > 3) 
      std::cerr << "( converged " << converged << " "
		<< " iters " << max_cg_iters   << " "
		<< " res_norm " << tolerance << std::endl;
    ++n_cg_;
  }

  if(!converged && iter_full_solution_)
  {
    if( noisy_ > 2)std::cerr << ", full ";

    if( gmm::mat_ncols( _A) > 0)
    {
      if(cholmod_step_done_)
459
	direct_solver_.update_system_gmm(_A);
David Bommes's avatar
David Bommes committed
460
      else
461
      {
462
	direct_solver_.calc_system_gmm(_A);
David Bommes's avatar
David Bommes committed
463
	cholmod_step_done_ = true;
464
      }
465
      direct_solver_.solve(_x,_rhs);
David Bommes's avatar
David Bommes committed
466
467

      ++n_full_;
468
    }
David Bommes's avatar
David Bommes committed
469
470
471
472
473
474
  }

  if( noisy_ > 2)std::cerr << std::endl;
}

//-----------------------------------------------------------------------------
475

David Bommes's avatar
David Bommes committed
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511

void 
MISolver::solve_multiple_rounding( 
    CSCMatrix& _A, 
    Vecd&      _x, 
    Vecd&      _rhs, 
    Veci&      _to_round )
{
  // StopWatch
  COMISO::StopWatch sw;
  double time_search_next_integer = 0;

  // some statistics
  n_local_ = 0;
  n_cg_    = 0;
  n_full_  = 0;

  // reset cholmod step flag
  cholmod_step_done_ = false;

  Veci to_round(_to_round);
  // copy to round vector and make it unique
  std::sort(to_round.begin(), to_round.end());
  Veci::iterator last_unique;
  last_unique = std::unique(to_round.begin(), to_round.end());
  int r = last_unique - to_round.begin();
  to_round.resize( r);

  // initalize old indices
  Veci old_idx(_rhs.size());
  for(unsigned int i=0; i<old_idx.size(); ++i)
    old_idx[i] = i;

  if( initial_full_solution_)
  {
    if( noisy_ > 2) std::cerr << "initial full solution" << std::endl;
512
513
    direct_solver_.calc_system_gmm(_A);
    direct_solver_.solve(_x, _rhs);
David Bommes's avatar
David Bommes committed
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529

    cholmod_step_done_ = true;

    ++n_full_;
  }

  // neighbors for local optimization
  Vecui neigh_i;

  // Vector for reduced solution
  Vecd xr(_x);

  // loop until solution computed
  for(unsigned int i=0; i<to_round.size(); ++i)
  {
    if( noisy_ > 0)
530
    {
David Bommes's avatar
David Bommes committed
531
532
533
534
535
536
537
538
539
540
541
542
      std::cerr << "Integer DOF's left: " << to_round.size()-(i+1) << " ";
      if( noisy_ > 1)
        std::cerr << "residuum_norm: " << COMISO_GMM::residuum_norm( _A, xr, _rhs) << std::endl;
    }

    // position in round vector
    std::vector<int> tr_best;

    sw.start();

    RoundingSet rset;
    rset.set_threshold(multiple_rounding_threshold_);
543

David Bommes's avatar
David Bommes committed
544
545
546
547
    // find index yielding smallest rounding error
    for(unsigned int j=0; j<to_round.size(); ++j)
    {
      if( to_round[j] != -1)
548
      {
David Bommes's avatar
David Bommes committed
549
550
	int cur_idx = to_round[j];
	double rnd_error = fabs( ROUND(xr[cur_idx]) - xr[cur_idx]);
551

David Bommes's avatar
David Bommes committed
552
	rset.add(j, rnd_error);
553
554
555
      }
    }

David Bommes's avatar
David Bommes committed
556
557
558
559
560
    rset.get_ids( tr_best);

    time_search_next_integer += sw.stop();
  
    // nothing more to do?
Jan Möbius's avatar
Jan Möbius committed
561
    if( tr_best.empty() )
David Bommes's avatar
David Bommes committed
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
      break;

    if( noisy_ > 5)
      std::cerr << "round " << tr_best.size() << " variables simultaneously\n";

    // clear neigh for local update
    neigh_i.clear();

    for(unsigned int j = 0; j<tr_best.size(); ++j)
    {
      int i_cur = to_round[tr_best[j]];

      // store rounded value
      double rnd_x = ROUND(xr[i_cur]);
      _x[ old_idx[i_cur] ] = rnd_x;

      // compute neighbors
      Col col = gmm::mat_const_col(_A, i_cur);
      ColIter it  = gmm::vect_const_begin( col);
      ColIter ite = gmm::vect_const_end  ( col);
      for(; it!=ite; ++it)
	if(it.index() != (unsigned int)i_cur)
	  neigh_i.push_back(it.index());

      // eliminate var
      COMISO_GMM::fix_var_csc_symmetric( i_cur, rnd_x, _A, xr, _rhs);
      to_round[tr_best[j]] = -1;
    }

    // 3-stage update of solution w.r.t. roundings
    // local GS / CG / SparseCholesky
    update_solution( _A, xr, _rhs, neigh_i);
594
595
596
  }

  // final full solution?
David Bommes's avatar
David Bommes committed
597
  if( final_full_solution_)
598
599
600
601
602
  {
    if( noisy_ > 2) std::cerr << "final full solution" << std::endl;

    if( gmm::mat_ncols( _A) > 0)
    {
David Bommes's avatar
David Bommes committed
603
      if(cholmod_step_done_)
604
	direct_solver_.update_system_gmm(_A);
David Bommes's avatar
David Bommes committed
605
      else
606
	direct_solver_.calc_system_gmm(_A);
David Bommes's avatar
David Bommes committed
607

608
      direct_solver_.solve( xr, _rhs);
David Bommes's avatar
David Bommes committed
609
      ++n_full_;
610
611
612
613
614
615
616
617
618
619
620
621
622
    }
  }

  // store solution values to result vector
  for(unsigned int i=0; i<old_idx.size(); ++i)
  {
    _x[ old_idx[i] ] = xr[i];
  }

  // output statistics
  if( stats_)
  {
    std::cerr << "\t" << __FUNCTION__ << " *** Statistics of MiSo Solver ***\n";
David Bommes's avatar
David Bommes committed
623
624
625
626
627
    std::cerr << "\t\t Number of CG    iterations  = " << n_cg_ << std::endl;
    std::cerr << "\t\t Number of LOCAL iterations  = " << n_local_ << std::endl;
    std::cerr << "\t\t Number of FULL  iterations  = " << n_full_ << std::endl;
    std::cerr << "\t\t Number of ROUNDING          = " << _to_round.size() << std::endl;
    std::cerr << "\t\t time searching next integer = " << time_search_next_integer / 1000.0 <<"s\n";
628
629
630
631
632
    std::cerr << std::endl;
  }
}


David Bommes's avatar
David Bommes committed
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
//-----------------------------------------------------------------------------


void
MISolver::solve_gurobi(
    CSCMatrix& _A,
    Vecd&      _x,
    Vecd&      _rhs,
    Veci&      _to_round)
{
#if COMISO_GUROBI_AVAILABLE

  // get round-indices in set
  std::set<int> to_round;
  for(unsigned int i=0; i<_to_round.size();++i)
    to_round.insert(_to_round[i]);

  try {
    GRBEnv env = GRBEnv();

    GRBModel model = GRBModel(env);

    // set time limite
    model.getEnv().set(GRB_DoubleParam_TimeLimit, gurobi_max_time_);

    unsigned int n = _rhs.size();

    // 1. allocate variables
    std::vector<GRBVar> vars;
    for( unsigned int i=0; i<n; ++i)
      if( to_round.count(i))
        vars.push_back( model.addVar(-GRB_INFINITY, GRB_INFINITY, 0.0, GRB_INTEGER));
      else
        vars.push_back( model.addVar(-GRB_INFINITY, GRB_INFINITY, 0.0, GRB_CONTINUOUS));

    // Integrate new variables
    model.update();

    // 2. setup_energy

    // build objective function from linear system E = x^tAx - 2x^t*rhs
    GRBQuadExpr objective;

    for(unsigned int i=0; i<_A.nc; ++i)
      for(unsigned int j=_A.jc[i]; j<_A.jc[i+1]; ++j)
      {
        objective += _A.pr[j]*vars[_A.ir[j]]*vars[i];
      }
    for(unsigned int i=0; i<n; ++i)
      objective -= 2*_rhs[i]*vars[i];

//    _A.jc[c+1]
//    _A.pr[write]
//    _A.ir[write]
//    _A.nc
//    _A.nr

    // minimize
    model.set(GRB_IntAttr_ModelSense, 1);
    model.setObjective(objective);

    // 4. solve
    model.optimize();

    // 5. store result
    _x.resize(n);
    for(unsigned int i=0; i<n; ++i)
      _x[i] = vars[i].get(GRB_DoubleAttr_X);

    std::cout << "GUROBI objective: " << model.get(GRB_DoubleAttr_ObjVal) << std::endl;

  }
Jan Möbius's avatar
Jan Möbius committed
705
  catch(GRBException& e)
David Bommes's avatar
David Bommes committed
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
  {
    std::cout << "Error code = " << e.getErrorCode() << std::endl;
    std::cout << e.getMessage() << std::endl;
  }
  catch(...)
  {
    std::cout << "Exception during optimization" << std::endl;
  }

#else
  std::cerr << "GUROBI solver is not available, please install it..." << std::endl;
#endif
}


721
722
723
724
725
726
727
//----------------------------------------------------------------------------


void 
MISolver::
show_options_dialog()
{
728
#if(COMISO_QT_AVAILABLE)
729
730
  MISolverDialog* pd = new MISolverDialog(*this);
  pd->exec();
David Bommes's avatar
changed    
David Bommes committed
731
732
#else
  std::cerr << "Warning: Qt not available to show solver dialog!!!" << std::endl;
733
734
735
736
#endif
}


737
// end namespace COMISO
738
}// ----------------------