OOPSE/libmdtools/Minimizer.hpp

#ifndef _MINIMIZER_H_
#define _MINIMIZER_H_
#include "MinimizerBase.hpp"
#include "Minimizer1D.hpp"
typedef enum {GoldenSection, Brent} LineSearchStrategy;
class Minimizer : public MinimizerBase{

  public:
    Minimizer(MinimizerParameterSet* param) {paramSet = param;}

    virtual void printMinizerInfo() = 0;
    void init() {}
    void setMinX(vector<double>& x) { minX = x;}
    vector<double> getMinX() { return minX;}

    void setPrevMinX(vector<double>& x) { prevMinX = x;}
    vector<double> getPrevMinX() {return prevMinX;}

    int getCurrentIteration() {return currentIter;}

  protected:
    
    MinimizerParameterSet* paramSet;    
    int currentIter;

    // Coordinates yielding the minimum value of the function.
    vector<double> minX;

   // Vector holding the previous point.
    vector<double> prevMinX; 
};

class MinimizerUsingLineSearch : public Minimizer{
  public:
    MinimizerUsingLineSearch(MinimizerParameterSet* param) : Minimizer(param), lineSearchInit(false){}
    void setLineSearchStrategy(NLModel* nlp, LineSearchStrategy stategy){

      if(stategy == GoldenSection)
        lsMinimizer = new GoldenSectionMinimizer(nlp);
      
      else if(stategy == Brent)
        lsMinimizer = new BrentMinimizer(nlp);
      
      else{
        cerr << "MinimizerUsingLineSearch Error : Unknown Line Search Strategy" << endl;
        exit(-1);
      }

      lsMinimizer->setMaxIteration(paramSet->getLineSearchMaxIteration());
      lsMinimizer->setStepTol(paramSet->getLineSearchTol());

      lineSearchInit = true;      
    }
    
  protected:

    Minimizer1D* lsMinimizer;
    bool lineSearchInit;
};

#endif
Revision:	1023
Committed:	Wed Feb 4 22:26:00 2004 UTC (20 years, 5 months ago) by tim
File size:	1709 byte(s)
Log Message:	Fix a bunch of bugs :-) Single version of conjugate gradient with golden search linesearch pass a couple of functions test. Brent's algorithm is still broken
#	User	Rev	Content
1	tim	1011	#ifndef _MINIMIZER_H_
2			#define _MINIMIZER_H_
3			#include "MinimizerBase.hpp"
4			#include "Minimizer1D.hpp"
5	tim	1023	typedef enum {GoldenSection, Brent} LineSearchStrategy;
6	tim	1011	class Minimizer : public MinimizerBase{
7
8			public:
9	tim	1023	Minimizer(MinimizerParameterSet* param) {paramSet = param;}
10	tim	1011
11			virtual void printMinizerInfo() = 0;
12	tim	1023	void init() {}
13	tim	1011	void setMinX(vector<double>& x) { minX = x;}
14			vector<double> getMinX() { return minX;}
15
16			void setPrevMinX(vector<double>& x) { prevMinX = x;}
17			vector<double> getPrevMinX() {return prevMinX;}
18
19			int getCurrentIteration() {return currentIter;}
20
21			protected:
22
23			MinimizerParameterSet* paramSet;
24			int currentIter;
25
26			// Coordinates yielding the minimum value of the function.
27			vector<double> minX;
28
29			// Vector holding the previous point.
30			vector<double> prevMinX;
31			};
32
33			class MinimizerUsingLineSearch : public Minimizer{
34			public:
35	tim	1023	MinimizerUsingLineSearch(MinimizerParameterSet* param) : Minimizer(param), lineSearchInit(false){}
36			void setLineSearchStrategy(NLModel* nlp, LineSearchStrategy stategy){
37
38			if(stategy == GoldenSection)
39			lsMinimizer = new GoldenSectionMinimizer(nlp);
40
41			else if(stategy == Brent)
42			lsMinimizer = new BrentMinimizer(nlp);
43
44			else{
45			cerr << "MinimizerUsingLineSearch Error : Unknown Line Search Strategy" << endl;
46			exit(-1);
47			}
48
49			lsMinimizer->setMaxIteration(paramSet->getLineSearchMaxIteration());
50			lsMinimizer->setStepTol(paramSet->getLineSearchTol());
51
52			lineSearchInit = true;
53			}
54
55	tim	1011	protected:
56	tim	1023
57	tim	1011	Minimizer1D* lsMinimizer;
58	tim	1023	bool lineSearchInit;
59	tim	1011	};
60
61			#endif