explorerand< EXP, RND > Class Template Reference

random search in the interval (xi[k]-h[k],xi[k]+hi[k]). More...

#include <explorerand.h>

Inheritance diagram for explorerand< EXP, RND >:

Collaboration diagram for explorerand< EXP, RND >:

List of all members.

Public Types
typedef typeop< EXP >::Targ::FNtype	FN
typedef typeop< EXP >::Tbare::Ttype	T
Public Member Functions
	explorerand (uintc N_, T const h0step=20.0, uintc indexmax_=500)
	Construct a N dimensional direct search object on FN.
	explorerand (FN fn_, uintc N_, T const h0step=20.0, uintc indexmax_=500)
	FN can be a reference.
void	operator++ ()
	Iterate towards the minimum.
Public Attributes
RND	rnd

---

Detailed Description

template<typename EXP, typename RND>
class explorerand< EXP, RND >

random search in the interval (xi[k]-h[k],xi[k]+hi[k]).

A search is made in both directions about xi[k].

EXP is expected to support exploreh or one of its derivations.

This method became comparable to the others with a higher number of iterations.

Definition at line 15 of file explorerand.h.

---

Member Typedef Documentation

template<typename EXP, typename RND>

typedef typeop<EXP>::Targ::FNtype explorerand< EXP, RND >::FN

Definition at line 21 of file explorerand.h.

template<typename EXP, typename RND>

typedef typeop<EXP>::Tbare::Ttype explorerand< EXP, RND >::T

Definition at line 22 of file explorerand.h.

---

Constructor & Destructor Documentation

template<typename EXP, typename RND>

explorerand< EXP, RND >::explorerand	(	uintc	N_,
		T const	h0step = 20.0,
		uintc	indexmax_ = 500
	)			[inline]

Construct a N dimensional direct search object on FN.

Definition at line 26 of file explorerand.h.

    : EXP(N_,h0step,indexmax_) {}

template<typename EXP, typename RND>

explorerand< EXP, RND >::explorerand	(	FN	fn_,
		uintc	N_,
		T const	h0step = 20.0,
		uintc	indexmax_ = 500
	)			[inline]

FN can be a reference.

Definition at line 35 of file explorerand.h.

    : EXP(fn_,N_,h0step,indexmax_) {}

---

Member Function Documentation

template<typename EXP , typename RND >

void explorerand< EXP, RND >::operator++

(

)

[inline]

Iterate towards the minimum.

Definition at line 50 of file explorerand.h.

References explorerand< EXP, RND >::rnd, and SHOW.

{
  EXP::hasStateChanged=false;

  if (!EXP::valid)
    return;

  if (EXP::index>EXP::indexmax)
  {
    EXP::valid=false;
#ifndef NDEBUG
cout << "error: indexmax reached  " << SHOW(EXP::index) << endl;
#endif
    return;
  }

  ++EXP::index;

  static T tmp;

  for (uint i=0; i<EXP::N; ++i)
  {
    tmp = EXP::xi[i];

bool flag=false;
for (uint k=0; k<1; ++k)
{
if (flag==false)
{
    EXP::xi[i] += EXP::hi[i]*rnd();
    if (EXP::evaluate())
    {
      flag=true;
//      cout << "***" << endl;
      continue;
    }

    EXP::xi[i] = tmp - EXP::hi[i]*rnd();
    if (EXP::evaluate())
    {
      flag=true;
//      cout << "###" << endl;
      continue;
    }
}
}

if (flag==true)
  continue;


    EXP::xi[i] = tmp;

/*

    EXP::xi[i] += EXP::hi[i];
    if (EXP::evaluate())
      continue;

    EXP::hi[i] *= -1;
    EXP::xi[i] += EXP::hi[i];
    EXP::xi[i] += EXP::hi[i];
    if (EXP::evaluate())
      continue;

    tmp = EXP::xi[i];
    
    // Try find a random solution with the interval. 
    EXP::xi[i] += EXP::hi[i]*2.0*rnd();
    if (EXP::evaluate())
    {
cout << "success" << endl;
      continue;
    }

cout << "fuck" << endl;
 
    EXP::xi[i] = tmp; 

    EXP::xi[i] -= EXP::hi[i];
*/

    EXP::hi[i] *= 0.61803398875; 
  }
}

---

Member Data Documentation

template<typename EXP, typename RND>

RND explorerand< EXP, RND >::rnd

Definition at line 19 of file explorerand.h.

Referenced by explorerand< EXP, RND >::operator++().

---

The documentation for this class was generated from the following file:

• patternsearch/explorerand.h