PUBLIC

GradAssOptC::GradAssOptC(int,int,double,double,double,int,int,double,int,TraceC) GradAssOptC::~GradAssOptC(void) GradAssOptC::ResetSeed(void) GradAssOptC::Optimize(GradAssCostC &) BaseOptC::Optimize(BaseCostC &) BaseOptC::Optimize(BaseCostC &,SArray1dC,HardAssignC &) BaseOptC::ResetSeed(void) BaseOptC::NObjs(void) const BaseOptC::NLabs(void) const BaseOptC::RanHardLabel(int &,BooleanT) BaseOptC::RanSoftLabel(int &) BaseOptC::AddNoise(SoftAssignC &,double,int &,double) BaseOptC::NormaliseSoft(SoftAssignC &) BaseOptC::NormaliseSoftLabels(SoftAssignC &) BaseOptC::NormaliseSoftObjects(SoftAssignC &) BaseOptC::Difference(SoftAssignC &,SoftAssignC &) BaseOptC::SoftToHard(const SoftAssignC &) BaseOptC::PrintSoftLabel(SoftAssignC &) BaseOptC::PrintHardLabel(HardAssignC &) BaseOptC::CheckPermute(HardAssignC &) BaseOptC::ForcePermute(HardAssignC &) TraceC::TraceC(int,ostream &) TraceC::~TraceC(void) TraceC::TraceC(const TraceC &)

GradAssOptC
include	"amma/GradAssOpt.hh"
User Level:	Default
Library:	CombOpt
Example:	doNumClassComb.cc
Section:	Optimisation.Implementation Numerical Methods.Optimisation.Implementation
In Scope:	std

Comments:
------------------------------------------------------------------------- -------------------------------------------------------------------------

public BaseOptC

GradAssOptC(int _nobjs,int _nlabs,double _thi,double _tlo,double _f,int _passes,int _idum = -1,double _noise = 0.001,int _synch = 0,TraceC tr = TraceC(NoTrace,cout))

~GradAssOptC()

Destructor

void ResetSeed()

set the seed to its first given value if negative this restarts the random seqeunce

HardAssignC Optimize(GradAssCostC & func)

Optimize the specified function according to previously specified parameters

HardAssignC Optimize(BaseCostC & func)

HardAssignC Optimize(BaseCostC & func,SArray1dC<BooleanT> _clamped,HardAssignC & start)

void ResetSeed()

int NObjs() const

int NLabs() const

HardAssignC RanHardLabel(int & idum,BooleanT ass = FALSE)

Random initial assignment of labels

SoftAssignC RanSoftLabel(int & idum)

Random initial assignment of labels

void AddNoise(SoftAssignC & work,double x,int & idum,double minp = 1e-10)

add uniform noise scaled by x to work set negatives to positive and set minimum to minp does NOT normalize

void NormaliseSoft(SoftAssignC & w)

normalise the label set

SoftAssignC NormaliseSoftLabels(SoftAssignC & wold)

normalise the label set

SoftAssignC NormaliseSoftObjects(SoftAssignC & wold)

normalise the object set

double Difference(SoftAssignC & w1,SoftAssignC & w2)

sum of absolute differences

HardAssignC SoftToHard(const SoftAssignC & ass)

Random initial assignment of labels

void PrintSoftLabel(SoftAssignC & r)

print out

void PrintHardLabel(HardAssignC & r)

print out

BooleanT CheckPermute(HardAssignC & r)

checks to see that the labelling is a permutation

void ForcePermute(HardAssignC & r)

forces the solution to be a permutation by a crude and possibly slow algorithm

Inline TraceC(int tl = NoTrace,ostream & os = cout)

Constructor

Inline ~TraceC()

Destructor

Inline TraceC(const TraceC & t)

Copy Constructor