Changeset 1024
- Timestamp:
- 06/15/08 13:35:45 (6 months ago)
- Files:
Legend:
- Unmodified
- Added
- Removed
- Modified
- Copied
- Moved
trunk/openopt/scikits/openopt/solvers/UkrOpt/ralg_oo.py
r1021 r1024 143 143 newPoint = p.point(x) 144 144 145 if newPoint.mr() > PrevPoint.mr() or newPoint.f() > PrevPoint.f() or abs(newPoint.f() - iterPoint.f()) < 15 * p.ftol or p.norm(newPoint.x - iterPoint.x) < 15 * p.xtol:145 if PrevPoint.betterThan(newPoint) or newPoint.f() > PrevPoint.f() or abs(newPoint.f() - iterPoint.f()) < 15 * p.ftol or p.norm(newPoint.x - iterPoint.x) < 15 * p.xtol: 146 146 iterPoint, hs = PrevPoint, hs_prev 147 147 break … … 178 178 g1 = g2-constrGradPrevIter 179 179 if sum(p.dotmult(constrGradPrevIter, g2))>0: 180 #TODO: add debugmsg here 180 181 doDilation = False 181 182 elif prevIterPointIsFeasible: … … 195 196 if not self.needRej(p, b, g1, g): 196 197 if all(isfinite(g)) and ng > 1e-50 and doDilation: 197 g = (g / ng).reshape( (-1,1))198 vec1 = self.__economyMult__(b, g).reshape( (-1,1))198 g = (g / ng).reshape(-1,1) 199 vec1 = self.__economyMult__(b, g).reshape(-1,1) 199 200 vec2 = p.dotmult(g.T, w) 200 201 b += p.matmult(vec1, vec2) … … 205 206 #hs = max(p.norm(xPrevIter - x), hsmin) 206 207 207 #xk, fk, rk = iterPoint.x, iterPoint.f(), iterPoint.mr() 208 p.iterfcn(xk, fk) 208 p.iterfcn(xk, fk, rk) 209 209 210 210 s2 = 0 … … 225 225 s2 = key 226 226 break 227 #p.msg += ' /checkme/'228 229 227 p.istop = s2 230 228 … … 372 370 ind = where(v != 0)[0] 373 371 r = dot(M[:,ind], v[ind]) 374 ## if norm(r-dot(M,v))>1e-17:375 ## print 'diff', norm(r-dot(M,v))376 372 return r 377 373
