16 May 2012

Operating principle

Basics on optimization

Define an optimization problem

  • Mono or multi-objectives
  • With or without constraint(s)
  • Parameter(s) to be varied

Apply an optimization algorithm

  • Determinist methods (Conjugate gradients, SQP, …)
  • Stochastic methods (Genetic algorithms, GMGA, Niching)
  • Indirect method (Optimization algorithm using surrogate)

 


Perform an optimization

  • Global optimum searching
  • Pareto frontier searching

 

 

 

General Workflow

  • Connection to a CEDRAT Software project allowing to control parameters and get back functions
  • Definition of parameters (interval of variation)
  • Creation or recovery of objective functions and constraints
  • Definition of optimization problem with objectives and possibly constraints
  • Automatic optimization driven by GOT-It with online progress visualisation
  • Results post-processing: tables, plots, 3D surfaces, html export
Next>>