Adjustments to Software Settings Jeremy Dyson Basel, Switzerland.

Slides:



Advertisements
Similar presentations
Courant and all that Consistency, Convergence Stability Numerical Dispersion Computational grids and numerical anisotropy The goal of this lecture is to.
Advertisements

Introduction to parameter optimization
An Introduction to the Kinetic Evaluation Software KinGUI
Gregory Shklover, Ben Emanuel Intel Corporation MATAM, Haifa 31015, Israel Simultaneous Clock and Data Gate Sizing Algorithm with Common Global Objective.
G5BAIM Artificial Intelligence Methods
Instabilities of SVD Small eigenvalues -> m+ sensitive to small amounts of noise Small eigenvalues maybe indistinguishable from 0 Possible to remove small.
Local Search Algorithms Chapter 4. Outline Hill-climbing search Simulated annealing search Local beam search Genetic algorithms Ant Colony Optimization.
Nelder Mead.
CSE 330: Numerical Methods
Simulated Annealing Premchand Akella. Agenda Motivation The algorithm Its applications Examples Conclusion.
Gizem ALAGÖZ. Simulation optimization has received considerable attention from both simulation researchers and practitioners. Both continuous and discrete.
Geometry Optimization Pertemuan VI. Geometry Optimization Backgrounds Real molecules vibrate thermally about their equilibrium structures. Finding minimum.
HYBRID SIMULATED ANNEALING AND DIRECT SEARCH METHOD FOR NONLINEAR UNCONSTRAINED GLOBAL OPTIMIZATION Abdel-Rahman Hedar and Masao Fukushima Speaker : UFO.
University of Minho School of Engineering Centre Algoritmi Uma Escola a Reinventar o Futuro – Semana da Escola de Engenharia - 24 a 27 de Outubro de 2011.
Gradient Methods April Preview Background Steepest Descent Conjugate Gradient.
Chapter 1 Introduction The solutions of engineering problems can be obtained using analytical methods or numerical methods. Analytical differentiation.
Job Release-Time Design in Stochastic Manufacturing Systems Using Perturbation Analysis By: Dongping Song Supervisors: Dr. C.Hicks & Dr. C.F.Earl Department.
Engineering Optimization
Fitting models to data. Step 5) Express the relationships mathematically in equations Step 6)Get values of parameters Determine what type of model you.
16/23/2015 9:48 AM6/23/2015 9:48 AM6/23/2015 9:48 AMRecursion Recursion Recursion is when a function calls itself to implement an algorithm. Really a paradigm.
Planning operation start times for the manufacture of capital products with uncertain processing times and resource constraints D.P. Song, Dr. C.Hicks.
CS 1 – Introduction to Computer Science Introduction to the wonderful world of Dr. T Daniel Tauritz, Ph.D. Associate Professor of Computer Science.
Using Simulated Annealing and Evolution Strategy scheduling capital products with complex product structure By: Dongping SONG Supervisors: Dr. Chris Hicks.
Nonlinear Stochastic Programming by the Monte-Carlo method Lecture 4 Leonidas Sakalauskas Institute of Mathematics and Informatics Vilnius, Lithuania EURO.
Attempts to find an optimum solution penalty value for certain classes of NP-Hard problems George M. White SITE University of Ottawa
UNCONSTRAINED MULTIVARIABLE
Lesson 2.5 The Fundamental Theorem of Algebra. For f(x) where n > 0, there is at least one zero in the complex number system Complex → real and imaginary.
Introduction and Analysis of Error Pertemuan 1
Problem Solving Professor: Dr. Miguel Alonso Jr..
Modeling and simulation of systems Simulation optimization and example of its usage in flexible production system control.
FDA- A scalable evolutionary algorithm for the optimization of ADFs By Hossein Momeni.
Optimum Design of Steel Space Frames by Hybrid Teaching-Learning Based Optimization and Harmony Search Algorithms & Dr.Alper AKIN Dr. IbrahIm AYDOGDU Dear.
Nonlinear Programming.  A nonlinear program (NLP) is similar to a linear program in that it is composed of an objective function, general constraints,
Deterministic Operations Research Models J. Paul Brooks Jill R. Hardin Department of Statistical Sciences and Operations Research November 28, 2006.
Try the practice questions first and check your answers with those given. Then, answer the “real” questions, #1-8. Show your work on the organizer you.
Optimization of multi-pass turning operations using ant colony system Authors: K. Vijayakumar, G. Prabhaharan, P. Asokan, R. Saravanan 2003 Presented by:
Week 10Complexity of Algorithms1 Hard Computational Problems Some computational problems are hard Despite a numerous attempts we do not know any efficient.
Applications of Neural Networks in Time-Series Analysis Adam Maus Computer Science Department Mentor: Doctor Sprott Physics Department.
Mathematical Models & Optimization?
A new Ad Hoc Positioning System 컴퓨터 공학과 오영준.
The good sides of Bayes Jeannot Trampert Utrecht University.
Operations Research The OR Process. What is OR? It is a Process It assists Decision Makers It has a set of Tools It is applicable in many Situations.
FORS 8450 Advanced Forest Planning Lecture 6 Threshold Accepting.
Solving Polynomial Functions involving Complex Numbers.
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
A study of simulated annealing variants Ana Pereira Polytechnic Institute of Braganca, Portugal Edite Fernandes University of Minho,
Higher Computing Science 2016 Prelim Revision. Topics to revise Computational Constructs parameter passing (value and reference, formal and actual) sub-programs/routines,
Operations Research Models and Methods Advanced Operations Research Reference: Operations Research Models and Methods, Operations Research Models and Methods,
OR Integer Programming ( 정수계획법 ). OR
Chapter 4.6 Complex Numbers. Imaginary Numbers The expression does not have a real solution because squaring a number cannot result in a negative answer.
Solving Multi-Step Equations INTEGRATED MATHEMATICS.
Parallel Simulated Annealing using Genetic Crossover Tomoyuki Hiroyasu Mitsunori Miki Maki Ogura November 09, 2000 Doshisha University, Kyoto, Japan.
Computational Fluid Dynamics Lecture II Numerical Methods and Criteria for CFD Dr. Ugur GUVEN Professor of Aerospace Engineering.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Constraints Satisfaction Edmondo Trentin, DIISM. Constraint Satisfaction Problems: Local Search In many optimization problems, the path to the goal is.
Local search algorithms In many optimization problems, the path to the goal is irrelevant; the goal state itself is the solution State space = set of "complete"
CSE 330: Numerical Methods. What is true error? True error is the difference between the true value (also called the exact value) and the approximate.
The Engineering Design Process
The Quadratic Formula..
Boundary-Value Problems for ODE )בעיות הגבול(
A Tabu Search Environment for Engineering Design Optimisation
Complex Fractions and Review of Order of Operations
Introduction to Scientific Computing II
EE 534 Numerical Methods in Electromagnetics
6.6 The Marquardt Algorithm
Sudoku.
Introduction to Scientific Computing II
Warmup Does the function f(x) = 3x2 + 6x have a maximum or a minimum value?
FDA – A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions BISCuit EDA Seminar
Evolutionary Computational Intelligence
Presentation transcript:

Adjustments to Software Settings Jeremy Dyson Basel, Switzerland

Why Are Adjustments Necessary? Optimisation is the science of selecting the best of many possible decisions in a complex real-life environment Mordecai Avriel Nonlinear Programming

Optimisation Minimise the Value of the Function N [Data Value i – Modelled Value i ] 2 i = 1 When the function is solved numerically (normally) rather than analytically, this means that the solution is only as exact as you make it, and it depends on: –Search method, e.g. Marquardt algorithm, for the solution –Settings for search method, including initial parameter values –How the modelled values are calculated –Settings to finish the search, i.e. an acceptable solution Settings may need adjusting to find global minimum

ModelMaker – Marquardt Settings Convergence Change –The size of a convergence step (0.1) Convergence Steps –Number of convergence step before optimisation stops (50) Retry Count –Number of times optimisation retries convergence steps (50) Initial Lamda –Initial value determines initial steepness of the search (0.01) Minimum Change –Minimum change in Lambda ( ) Fractional Change –Fractional change in Lambda (0.01)

ModelMaker – Simulated Annealing Why is it needed? –If the Marquardt Settings cannot find the global minimum When is it likely to be needed? –Initial parameter values inappropriate –Model has a complex minimisation function, e.g. HS kinetics What does it do? –Tries many combinations of initial parameter values

Acknowledgement Dr Rene Oscar Kühne for teaching me ModelMaker