annotate src/samer/maths/opt/ConstrainedConjGrad.java @ 8:5e3cbbf173aa tip

Reorganise some more
author samer
date Fri, 05 Apr 2019 22:41:58 +0100
parents bf79fb79ee13
children
rev   line source
samer@0 1 /*
samer@0 2 * Copyright (c) 2000, Samer Abdallah, King's College London.
samer@0 3 * All rights reserved.
samer@0 4 *
samer@0 5 * This software is provided AS iS and WITHOUT ANY WARRANTY;
samer@0 6 * without even the implied warranty of MERCHANTABILITY or
samer@0 7 * FITNESS FOR A PARTICULAR PURPOSE.
samer@0 8 */
samer@0 9
samer@0 10 package samer.maths.opt;
samer@0 11 import samer.maths.*;
samer@0 12 import samer.core.*;
samer@0 13
samer@0 14 public class ConstrainedConjGrad extends ConjGrad
samer@0 15 {
samer@0 16 Constraints C;
samer@0 17
samer@0 18 public ConstrainedConjGrad(State s, Constraints c) {
samer@0 19 super(s); C=c;
samer@0 20 }
samer@0 21
samer@0 22 public void init() {
samer@0 23 C.negate(S.P1.g,S.h);
samer@0 24 C.zeroInactive(S.h);
samer@0 25 S.normh=Util.maxabs(S.h);
samer@0 26 }
samer@0 27
samer@0 28 public void update()
samer@0 29 {
samer@0 30 C.sub(dg,S.P2.g,S.P1.g);
samer@0 31 gg = C.dot(S.P1.g,S.P1.g);
samer@0 32 dgg = C.dot(dg,S.P2.g);
samer@0 33
samer@0 34 C.mul(S.h,dgg/gg);
samer@0 35 C.sub(S.h,S.P2.g);
samer@0 36 S.normh=Util.maxabs(S.h);
samer@0 37
samer@0 38 double s2=C.dot(S.P2.g,S.h);
samer@0 39 if (s2>0) {
samer@0 40 // Shell.trace("steepest descent");
samer@0 41 C.negate(S.P2.g,S.h);
samer@0 42 C.zeroInactive(S.h);
samer@0 43 S.normh=Util.maxabs(S.h);
samer@0 44 s2=C.dot(S.P2.g,S.h);
samer@0 45 }
samer@0 46 S.P2.s=s2;
samer@0 47 }
samer@0 48 }