Global Optimization with MATLAB Products
|
|
- Ann Simmons
- 5 years ago
- Views:
Transcription
1 Global Optimization with MATLAB Products Account Manager 이장원차장 Application Engineer 엄준상 The MathWorks, Inc.
2 Agenda Introduction to Global Optimization Peaks Surve of Solvers with Eamples 8 MultiStart 6 Global Search Pattern Search 4 Simulated Annealing Genetic Algorithm / Multiobjective Genetic Algorithm Additional Resources Local minima Question & Answer Global minima
3 Optimization Finding answers to problems automaticall Modif Design Parameters NO Initial Design Parameters Model or Prototpe Objectives Achieved? YES Optimal Design OPTIMIZATION PROCESS Design process can be performed: Manuall Automaticall (trial-and-error or iterativel) (using optimization techniques) Optimization benefits include: Finding better (optimal) designs Faster design evaluations Useful for trade-off analsis (N dimensions) Non-intuitive designs ma be found Antenna Design Using Genetic Algorithm
4 c sin() + cos( ) Manifold Pressure Ratio sin() + cos( ) Eample Global Optimization Problems Wh does fmincon have a hard time finding the function minimum? 5 Starting at 5 Starting at 5 Starting at Wh didn t fminunc find the maimum volumetric efficienc? Peak VE Value = Starting at Starting at Starting at End.6 Wh didn t nonlinear regression find a good fit? c=b e -b 4 t +b e -b 5 t +b e -b 6 t Start Revolutions Per Minute, RPM t 4
5 Global Optimization Goal: Want to find the lowest/largest value of the nonlinear function that has man local minima/maima Problem: Traditional solvers often return one of the local minima (not the global) Solution: A solver that locates globall optimal solutions Rastrigin s Function 5
6 Global Optimization Toolbo For problems that contain multiple maima/minima or are non-smooth Faster/fewer function eval uations Larger problems (higher d imensions) Finds local minima/maim a Finds global minima/mai ma (most of the time) Better on non-smooth stochastic discontinuous undefined gradients Custom data tpes (in GA and SA solvers) Optimization T oolbo Global Optimization Toolbo 6
7 MULTISTART 7
8 What is MultiStart? Run a local solver from each set of start points Option to filter starting points based feasibilit Supports parallel computing 8
9 GLOBAL SEARCH
10 What is GlobalSearch? Multistart heuristic algorithm Calls fmincon from multiple start points to tr and find a global minimum Filters/removes non-promising start points
11 GlobalSearch Overview Schematic Problem Peaks function Three minima Green, z = -.65 Red, z= -.5 Blue, z =
12 GlobalSearch Overview Stage Run from specified
13 GlobalSearch Overview Stage Generate stage start points via Scatter Search
14 GlobalSearch Overview Stage Find stage start point with lowest penalt value
15 GlobalSearch Overview Stage Run from best stage point
16 GlobalSearch Overview Stage Generate stage start points using Scatter Search
17 GlobalSearch Overview Stage Analse each stage point in turn
18 GlobalSearch Overview Stage Don t run points that are in basins of eisting minimum
19 GlobalSearch Overview Stage Analse each stage point in turn
20 GlobalSearch Overview Stage Don t run points whose penalt value eceeds threshold 6 Current penalt threshold value :
21 GlobalSearch Overview Stage Analse each stage point in turn
22 GlobalSearch Overview Stage Run start point if it satisfies distance & merit criteria Current penalt threshold value :
23 GlobalSearch Overview Stage Epand basin of attraction if minimum alread found Current penalt threshold value : Basins can overlap
24 SIMULATED ANNEALING 8
25 What is Simulated Annealing? A probabilistic metaheuristic approach based upon the phsical process of annealing in metallurg. Controlled cooling of a metal allows atoms to realign from a random higher energ state to an ordered crstalline (globall) lower energ state B analog, simulated annealing replaces a current solution b randoml choosing a nearb solution A nearb solution is determined b the solution temperature 9
26 Simulated Annealing Overview Iteration Run from specified
27 Simulated Annealing Overview Iteration Randoml generate a new point according to probabilit distribution and current temperature Temperature =.9 - Possible New Points: Standard Normal N(,) * Temperature - - -
28 Simulated Annealing Overview Iteration If lower, accept the point, if higher, accept based upon acceptance probabilit Temperature = P e accept (.9)/ T
29 Simulated Annealing Overview Iteration Randoml generate a new point according to probabilit distribution and current temperature Temperature =
30 Simulated Annealing Overview Iteration Randoml generate a new point according to probabilit distribution and current temperature, accept new point if lower value Temperature =
31 Simulated Annealing Overview Iteration Lower temperature according to temperature schedule Temperature =
32 Simulated Annealing Overview Iteration Lower temperature according to temperature schedule and generate new point Temperature =
33 Simulated Annealing Overview Iteration N- After several iterations, the search radius becomes small and we narrow in on a local solution Temperature =
34 Simulated Annealing Overview Iteration N Reset temperature and start the process again (reanneling) Temperature =
35 Simulated Annealing Overview Iteration N Reset temperature and start the process again (reannealing) Temperature =.9 -. Paccept ( )) / T e - -. (
36 Simulated Annealing Overview Iteration N Reset temperature and start the process again (reannealing) Temperature =
37 Simulated Annealing Overview Iteration N+ Reduce temperature and continue Temperature =
38 Simulated Annealing Overview Iteration N+ Reduce temperature and continue Temperature =
39 Simulated Annealing Overview Iteration Reduce temperature and continue Temperature =
40 PATTERN SEARCH (DIRECT SEARCH) 47
41 What is a Pattern Search? An approach that uses a pattern of search directions around the eisting points, the mesh Polls the mesh for a better solution and moves to that point Epands/contracts the mesh around the current point when a solution is not found Does not rel on gradient information 48
42 Pattern Search Overview Iteration Run from specified
43 Pattern Search Overview Iteration Appl pattern vector, poll new points for improvement Mesh size = Pattern vectors = [,], [,], [-,], [-,-] First poll successful 4.6 Pnew mesh _ size* pattern _ vector.8.6 *[,].4 - Complete Poll (not default)
44 Pattern Search Overview Iteration Increase mesh size and repeat Mesh size = Pattern vectors = [,], [,], [-,], [-,-] Complete Poll 5
45 Pattern Search Overview Iteration Mesh epansion: increase mesh size and repeat Mesh size = 4 Pattern vectors = [,], [,], [-,], [-,-]
46 Pattern Search Overview Iteration 4 Refine mesh: decrease mesh size and repeat Mesh size = 4*.5 = Pattern vectors = [,], [,], [-,], [-,-]
47 Pattern Search Overview Iteration N Continue epansion/contraction until convergence
48 GENETIC ALGORITHM 57
49 What is a Genetic Algorithm? Genetic Algorithms use concepts from evolutionar biolog to find eact or approimate solutions to optimization problems Start with an initial generation of candidate solutions that are tested against the objective function Subsequent generations evolve from the st through selection, crossover and mutation The individual that best minimizes the given objective is returned as the ideal solution 58
50 How Evolution Works Binar Case Selection Retain the best performing bit strings from one generation to the net. Favor these for reproduction parent = [ ] parent = [ ] Crossover parent = [ ] parent = [ ] child = [ ] Mutation parent = [ ] child = [ ] 59
51 Genetic Algorithm Iteration Evaluate initial population
52 Genetic Algorithm Iteration Select a few good solutions for reproduction
53 Genetic Algorithm Iteration Generate new population and evaluate
54 Genetic Algorithm Iteration Select a few good solutions for reproduction
55 Genetic Algorithm Iteration Generate new population and evaluate
56 Genetic Algorithm Iteration Select a few good solutions for reproduction
57 Genetic Algorithm Iteration N Continue process until stopping criteria are met - Solution found
58 6 4 Comparison of Solver (Default) Performance FuncValue Min StartPt rf([,]) rf([,]) 6 FuncValue Min 4 StartPt rf([,]) 6 FuncValue Min StartPt
59 7
60 Additional Resources Upcoming Webinars Speeding Up Optimization with Parallel Computing (August ) On-demand Webinars Genetic Algorithm in Financial Applications Tips & Tricks: Getting Started with Optimization Introduction to Optimization 7
61 Contact Information North America Phone: Outside North America Contact our local MathWorks office or reseller: 7
62 Questions? 7
63 MATLAB Provides the Foundation for Optimization The leading environment for technical computing Customizable Numeric computation Data analsis and visualization The de facto industr-standard, high-level programming language for algorithm development Toolboes for statistics, optimization, smbolic math, signal and image processing, and other areas Foundation of the MathWorks product famil 74
64 Optimization Toolbo Solve standard and large-scale optimization problems Graphical user interface and command line functions for: Linear and nonlinear programming Quadratic programming Nonlinear least squares and nonlinear equations Multi-objective optimization Binar integer programming Additional Capabilities: Parallel computing support in selected solvers Customizable algorithm options Choose between standard and largescale algorithms Output diagnostics 75
65 Global Optimization Toolbo Solve multiple maima, multiple minima, and nonsmooth optimization problems Graphical user interface and command line functions for: Global Search solver Multistart solver Genetic algorithm solver Single objective Multiobjective with Pareto front Direct search solver Simulated annealing solver Useful for problems not easil addressed with Optimization Toolbo: Discontinuous Highl nonlinear Stochastic Discrete or custom data tpes Undefined derivatives Multiple maima/minima 76
66 Anatom of an Optimization Problem General Form Accepted b MATLAB Solvers Objective Function min Decision variables f ( ) Subject to Constraints (i.e. such that) Tpicall a linear or nonlinear function A b, c( ) Linear constraints inequalities equalities bounds A l eq b eq u, c eq ( ) Nonlinear constraints inequalities equalities 77
67 MATLAB Optimization Products and Eample Applications MATLAB Statistics Toolbo Curve Fitting Toolbo Optimization Toolbo Genetic Algorithm and Direct Search Toolbo Solving Equations Real roots finding (D): -5 Real roots finding (N-D): Nois, discontinuous root finding (N-D) f() = Root finding Sstems of equations Linear Sstems: F() = A-b = (i.e. A=b) >> = A \ b Nonlinear Sstems F(X) = Nois, discontinuous sstems: F(X) = Curve/Modeling Fitting Basic (linear) curve fitting.9 Advanced (nonlinear) curve fitting Model Fitting (least squares) Constrained curve fitting Nois, Discontinuous parameter estimation.8 Parameter Estimation curve fitting parameter estimation (model fitting) Trade-Off Studies Maimization Minimization Goal seeking Multiobjective Unconstrained nonlinear minimization Constrained nonlinear minimization Nois, Discontinuous, illdefined mimization 78
Solving Optimization Problems with MATLAB Loren Shure
Solving Optimization Problems with MATLAB Loren Shure 6 The MathWorks, Inc. Topics Introduction Least-squares minimization Nonlinear optimization Mied-integer programming Global optimization Optimization
More informationOptimization in MATLAB Seth DeLand
Optimization in MATLAB Seth DeLand 4 The MathWorks, Inc. Topics Intro Using gradient-based solvers Optimization in Comp. Finance toolboxes Global optimization Speeding up your optimizations Optimization
More informationMATLAB Based Optimization Techniques and Parallel Computing
MATLAB Based Optimization Techniques and Parallel Computing Bratislava June 4, 2009 2009 The MathWorks, Inc. Jörg-M. Sautter Application Engineer The MathWorks Agenda Introduction Local and Smooth Optimization
More informationOptimieren mit MATLAB jetzt auch gemischt-ganzzahlig Dr. Maka Karalashvili Application Engineer MathWorks
Optimieren mit MATLAB jetzt auch gemischt-ganzzahlig Dr. Maka Karalashvili Application Engineer MathWorks 2014 The MathWorks, Inc. 1 Let s consider the following modeling case study Requirements Item Nuts
More informationPROJECT REPORT. Parallel Optimization in Matlab. Joakim Agnarsson, Mikael Sunde, Inna Ermilova Project in Computational Science: Report January 2013
Parallel Optimization in Matlab Joakim Agnarsson, Mikael Sunde, Inna Ermilova Project in Computational Science: Report January 2013 PROJECT REPORT Department of Information Technology Contents 1 Introduction
More informationLecture 4. Convexity Robust cost functions Optimizing non-convex functions. 3B1B Optimization Michaelmas 2017 A. Zisserman
Lecture 4 3B1B Optimization Michaelmas 2017 A. Zisserman Convexity Robust cost functions Optimizing non-convex functions grid search branch and bound simulated annealing evolutionary optimization The Optimization
More informationChapter 3 Path Optimization
Chapter 3 Path Optimization Background information on optimization is discussed in this chapter, along with the inequality constraints that are used for the problem. Additionally, the MATLAB program for
More informationIntroduction to ANSYS DesignXplorer
Lecture 5 Goal Driven Optimization 14. 5 Release Introduction to ANSYS DesignXplorer 1 2013 ANSYS, Inc. September 27, 2013 Goal Driven Optimization (GDO) Goal Driven Optimization (GDO) is a multi objective
More informationGenetic Algorithm and Direct Search Toolbox
Genetic Algorithm and Direct Search Toolbox For Use with MATLAB User s Guide Version 1 How to Contact The MathWorks: www.mathworks.com comp.soft-sys.matlab support@mathworks.com suggest@mathworks.com bugs@mathworks.com
More informationIntroduction to Design Optimization: Search Methods
Introduction to Design Optimization: Search Methods 1-D Optimization The Search We don t know the curve. Given α, we can calculate f(α). By inspecting some points, we try to find the approximated shape
More informationCHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM
20 CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM 2.1 CLASSIFICATION OF CONVENTIONAL TECHNIQUES Classical optimization methods can be classified into two distinct groups:
More informationActive contour: a parallel genetic algorithm approach
id-1 Active contour: a parallel genetic algorithm approach Florence Kussener 1 1 MathWorks, 2 rue de Paris 92196 Meudon Cedex, France Florence.Kussener@mathworks.fr Abstract This paper presents an algorithm
More informationModule 1 Lecture Notes 2. Optimization Problem and Model Formulation
Optimization Methods: Introduction and Basic concepts 1 Module 1 Lecture Notes 2 Optimization Problem and Model Formulation Introduction In the previous lecture we studied the evolution of optimization
More informationToday. Golden section, discussion of error Newton s method. Newton s method, steepest descent, conjugate gradient
Optimization Last time Root finding: definition, motivation Algorithms: Bisection, false position, secant, Newton-Raphson Convergence & tradeoffs Example applications of Newton s method Root finding in
More informationSURVEY OF TEN NON-TRADITIONAL OPTIMIZATION TECHNIQUES
International Journal of Civil Engineering and Technology (IJCIET) Volume 9, Issue 8, August 2018, pp. 432 453, Article ID: IJCIET_09_08_042 Available online at http://www.iaeme.com/ijciet/issues.asp?jtype=ijciet&vtype=9&itype=8
More informationThe Sine and Cosine Functions
Lesson -5 Lesson -5 The Sine and Cosine Functions Vocabular BIG IDEA The values of cos and sin determine functions with equations = sin and = cos whose domain is the set of all real numbers. From the eact
More informationLecture
Lecture.. 7 Constrained problems & optimization Brief introduction differential evolution Brief eample of hybridization of EAs Multiobjective problems & optimization Pareto optimization This slides mainly
More information4 Using The Derivative
4 Using The Derivative 4.1 Local Maima and Minima * Local Maima and Minima Suppose p is a point in the domain of f : f has a local minimum at p if f (p) is less than or equal to the values of f for points
More informationSections 5.1, 5.2, 5.3, 8.1,8.6 & 8.7 Practice for the Exam
Sections.1,.2,.3, 8.1,8.6 & 8.7 Practice for the Eam MAC 1 -- Sulivan 8th Ed Name: Date: Class/Section: State whether the function is a polnomial function or not. If it is, give its degree. If it is not,
More informationData Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University
Data Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University Search & Optimization Search and Optimization method deals with
More informationMarch 19, Heuristics for Optimization. Outline. Problem formulation. Genetic algorithms
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis and Dimensioning II Department of Electronics and Communications Engineering Tampere University of Technology, Tampere, Finland March 19, 2014
More informationReflector profile optimisation using Radiance
Reflector profile optimisation using Radiance 1,4 1,2 1, 8 6 4 2 3. 2.5 2. 1.5 1..5 I csf(1) csf(2). 1 2 3 4 5 6 Giulio ANTONUTTO Krzysztof WANDACHOWICZ page 1 The idea Krzysztof WANDACHOWICZ Giulio ANTONUTTO
More informationMeta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization
2017 2 nd International Electrical Engineering Conference (IEEC 2017) May. 19 th -20 th, 2017 at IEP Centre, Karachi, Pakistan Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic
More informationMulti-objective Optimization
Some introductory figures from : Deb Kalyanmoy, Multi-Objective Optimization using Evolutionary Algorithms, Wiley 2001 Multi-objective Optimization Implementation of Constrained GA Based on NSGA-II Optimization
More informationGlobal Optimization. for practical engineering applications. Harry Lee 4/9/2018 CEE 696
Global Optimization for practical engineering applications Harry Lee 4/9/2018 CEE 696 Table of contents 1. Global Optimization 1 Global Optimization Global optimization Figure 1: Fig 2.2 from Nocedal &
More informationGenetic Algorithm and Direct Search Toolbox 2 User s Guide
Genetic Algorithm and Direct Search Toolbox 2 User s Guide How to Contact The MathWorks www.mathworks.com Web comp.soft-sys.matlab Newsgroup www.mathworks.com/contact_ts.html Technical Support suggest@mathworks.com
More informationLocal Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )
Local Search and Optimization Chapter 4 Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld ) 1 Outline Local search techniques and optimization Hill-climbing
More informationGenetic Algorithm and Direct Search Toolbox For Use with MATLAB
Genetic Algorithm and Direct Search Toolbox For Use with MATLAB Computation Visualization Programming User s Guide Version 2 How to Contact The MathWorks www.mathworks.com Web comp.soft-sys.matlab Newsgroup
More information3.6 Graphing Piecewise-Defined Functions and Shifting and Reflecting Graphs of Functions
76 CHAPTER Graphs and Functions Find the equation of each line. Write the equation in the form = a, = b, or = m + b. For Eercises through 7, write the equation in the form f = m + b.. Through (, 6) and
More informationSECONDARY MATH TRANSFORMATIONS
SECONDARY MATH 3 3-3 TRANSFORMATIONS WARM UP WHAT YOU WILL LEARN How to transform functions from the parent function How to describe a transformation How to write an equation of a transformed function
More informationLocal Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )
Local Search and Optimization Chapter 4 Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld ) 1 2 Outline Local search techniques and optimization Hill-climbing
More informationLocal Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )
Local Search and Optimization Chapter 4 Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld ) 1 2 Outline Local search techniques and optimization Hill-climbing
More informationHYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS
HYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS NABEEL AL-MILLI Financial and Business Administration and Computer Science Department Zarqa University College Al-Balqa'
More informationDevelopment of optimization methods for Volvo fuel economy simulation. Master s thesis in Signal and Systems RAFAEL KLÜPPEL SMIJTINK
Development of optimization methods for Volvo fuel economy simulation. Master s thesis in Signal and Systems RAFAEL KLÜPPEL SMIJTINK 1 Development of optimization methods for Volvo fuel economy simulation.
More information1.2. Characteristics of Polynomial Functions. What are the key features of the graphs of polynomial functions?
1.2 Characteristics of Polnomial Functions In Section 1.1, ou eplored the features of power functions, which are single-term polnomial functions. Man polnomial functions that arise from real-world applications
More informationCost Functions in Machine Learning
Cost Functions in Machine Learning Kevin Swingler Motivation Given some data that reflects measurements from the environment We want to build a model that reflects certain statistics about that data Something
More informationAn Evolutionary Algorithm for Minimizing Multimodal Functions
An Evolutionary Algorithm for Minimizing Multimodal Functions D.G. Sotiropoulos, V.P. Plagianakos and M.N. Vrahatis University of Patras, Department of Mamatics, Division of Computational Mamatics & Informatics,
More informationIntroduction to Linear Programming. Algorithmic and Geometric Foundations of Optimization
Introduction to Linear Programming Algorithmic and Geometric Foundations of Optimization Optimization and Linear Programming Mathematical programming is a class of methods for solving problems which ask
More informationApplication of Genetic Algorithms to CFD. Cameron McCartney
Application of Genetic Algorithms to CFD Cameron McCartney Introduction define and describe genetic algorithms (GAs) and genetic programming (GP) propose possible applications of GA/GP to CFD Application
More informationUnsupervised Learning. Supervised learning vs. unsupervised learning. What is Cluster Analysis? Applications of Cluster Analysis
7 Supervised learning vs unsupervised learning Unsupervised Learning Supervised learning: discover patterns in the data that relate data attributes with a target (class) attribute These patterns are then
More informationIntroduction to Design Optimization: Search Methods
Introduction to Design Optimization: Search Methods 1-D Optimization The Search We don t know the curve. Given α, we can calculate f(α). By inspecting some points, we try to find the approximated shape
More informationPhoto by Carl Warner
Photo b Carl Warner Photo b Carl Warner Photo b Carl Warner Fitting and Alignment Szeliski 6. Computer Vision CS 43, Brown James Has Acknowledgment: Man slides from Derek Hoiem and Grauman&Leibe 2008 AAAI
More informationEscaping Local Optima: Genetic Algorithm
Artificial Intelligence Escaping Local Optima: Genetic Algorithm Dae-Won Kim School of Computer Science & Engineering Chung-Ang University We re trying to escape local optima To achieve this, we have learned
More informationIntroduction to Genetic Algorithms
Advanced Topics in Image Analysis and Machine Learning Introduction to Genetic Algorithms Week 3 Faculty of Information Science and Engineering Ritsumeikan University Today s class outline Genetic Algorithms
More informationResearch Article Modified Bézier Curves with Shape-Preserving Characteristics Using Differential Evolution Optimization Algorithm
Advances in Numerical Analsis Volume 23, Article ID 858279, 8 pages http://d.doi.org/.55/23/858279 Research Article Modified Bézier Curves with Shape-Preserving Characteristics Using Differential Evolution
More information5.6 Translations and Combinations of Transformations
5.6 Translations and Combinations of Transformations The highest tides in the world are found in the Ba of Fund. Tides in one area of the ba cause the water level to rise to 6 m above average sea level
More informationGraphing square root functions. What would be the base graph for the square root function? What is the table of values?
Unit 3 (Chapter 2) Radical Functions (Square Root Functions Sketch graphs of radical functions b appling translations, stretches and reflections to the graph of Analze transformations to identif the of
More informationDiversity visualization in evolutionary algorithms
Diversit visualization in evolutionar algorithms Jan Drchal drchaj@fel.cvut.cz Miroslav Šnorek snorek@fel.cvut.cz Abstract: Evolutionar Algorithms (EAs) are well-known nature-inspired optimization methods.
More informationMulti-stable Perception. Necker Cube
Multi-stable Perception Necker Cube Spinning dancer illusion, Nobuuki Kaahara Fitting and Alignment Computer Vision Szeliski 6.1 James Has Acknowledgment: Man slides from Derek Hoiem, Lana Lazebnik, and
More informationUnconstrained and Constrained Optimization
Unconstrained and Constrained Optimization Agenda General Ideas of Optimization Interpreting the First Derivative Interpreting the Second Derivative Unconstrained Optimization Constrained Optimization
More informationGenetic Algorithms. Aims 09s1: COMP9417 Machine Learning and Data Mining. Biological Evolution. Evolutionary Computation
Aims 09s1: COMP9417 Machine Learning and Data Mining Genetic Algorithms April, 009 Acknowledgement: Material derived from slides for the book Machine Learning, Tom M. Mitchell, McGraw-Hill, 1997 http://www-.cs.cmu.edu/~tom/mlbook.html
More informationDETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES
DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES SHIHADEH ALQRAINY. Department of Software Engineering, Albalqa Applied University. E-mail:
More informationAlgorithms & Complexity
Algorithms & Complexity Nicolas Stroppa - nstroppa@computing.dcu.ie CA313@Dublin City University. 2006-2007. November 21, 2006 Classification of Algorithms O(1): Run time is independent of the size of
More informationSTRAND G: Relations, Functions and Graphs
UNIT G Using Graphs to Solve Equations: Tet STRAND G: Relations, Functions and Graphs G Using Graphs to Solve Equations Tet Contents * * Section G. Solution of Simultaneous Equations b Graphs G. Graphs
More informationFast oriented bounding box optimization on the rotation group SO(3, R)
Fast oriented bounding box optimization on the rotation group SO(3, R) Chia-Tche Chang 1, Bastien Gorissen 2,3 and Samuel Melchior 1,2 chia-tche.chang@uclouvain.be bastien.gorissen@cenaero.be samuel.melchior@uclouvain.be
More informationAn Artificial Immune System Approach for B-Spline Surface Approximation Problem
An Artiicial Immune Sstem Approach or B-Spline Surace Approimation Problem Erkan Ülker and Vesi İşler Selçuk Universit, Department o Computer Engineering, 4075 Kona, Turke eulker@selcuk.edu.tr Middle East
More informationIntegrating ICT into mathematics at KS4&5
Integrating ICT into mathematics at KS4&5 Tom Button tom.button@mei.org.uk www.mei.org.uk/ict/ This session will detail the was in which ICT can currentl be used in the teaching and learning of Mathematics
More informationMETAHEURISTICS. Introduction. Introduction. Nature of metaheuristics. Local improvement procedure. Example: objective function
Introduction METAHEURISTICS Some problems are so complicated that are not possible to solve for an optimal solution. In these problems, it is still important to find a good feasible solution close to the
More information3.6.2 Generating admissible heuristics from relaxed problems
3.6.2 Generating admissible heuristics from relaxed problems To come up with heuristic functions one can study relaxed problems from which some restrictions of the original problem have been removed The
More informationFilter Design Explorer 1.0 User s Guide
Filter Design Eplorer 1.0 User s Guide CADES Research Center, 017. Web: www.cadescenter.com Email: info@cadescenter.com NOTICE: As a result of the new 1D result storage mode in CST 017, please note the
More informationSIMULATED ANNEALING TECHNIQUES AND OVERVIEW. Daniel Kitchener Young Scholars Program Florida State University Tallahassee, Florida, USA
SIMULATED ANNEALING TECHNIQUES AND OVERVIEW Daniel Kitchener Young Scholars Program Florida State University Tallahassee, Florida, USA 1. INTRODUCTION Simulated annealing is a global optimization algorithm
More informationABSOLUTE EXTREMA AND THE MEAN VALUE THEOREM
61 LESSON 4-1 ABSOLUTE EXTREMA AND THE MEAN VALUE THEOREM Definitions (informal) The absolute maimum (global maimum) of a function is the -value that is greater than or equal to all other -values in the
More informationArtificial Intelligence
Artificial Intelligence Informed Search and Exploration Chapter 4 (4.3 4.6) Searching: So Far We ve discussed how to build goal-based and utility-based agents that search to solve problems We ve also presented
More information5.2 Graphing Polynomial Functions
Locker LESSON 5. Graphing Polnomial Functions Common Core Math Standards The student is epected to: F.IF.7c Graph polnomial functions, identifing zeros when suitable factorizations are available, and showing
More informationHeuristic Optimisation
Heuristic Optimisation Part 10: Genetic Algorithm Basics Sándor Zoltán Németh http://web.mat.bham.ac.uk/s.z.nemeth s.nemeth@bham.ac.uk University of Birmingham S Z Németh (s.nemeth@bham.ac.uk) Heuristic
More information(ii) Use Simpson s rule with two strips to find an approximation to Use your answers to parts (i) and (ii) to show that ln 2.
C umerical Methods. June 00 qu. 6 (i) Show by calculation that the equation tan = 0, where is measured in radians, has a root between.0 and.. [] Use the iteration formula n+ = tan + n with a suitable starting
More informationDERIVATIVE-FREE OPTIMIZATION
DERIVATIVE-FREE OPTIMIZATION Main bibliography J.-S. Jang, C.-T. Sun and E. Mizutani. Neuro-Fuzzy and Soft Computing: A Computational Approach to Learning and Machine Intelligence. Prentice Hall, New Jersey,
More informationReducing Graphic Conflict In Scale Reduced Maps Using A Genetic Algorithm
Reducing Graphic Conflict In Scale Reduced Maps Using A Genetic Algorithm Dr. Ian D. Wilson School of Technology, University of Glamorgan, Pontypridd CF37 1DL, UK Dr. J. Mark Ware School of Computing,
More informationAI Programming CS S-08 Local Search / Genetic Algorithms
AI Programming CS662-2013S-08 Local Search / Genetic Algorithms David Galles Department of Computer Science University of San Francisco 08-0: Overview Local Search Hill-Climbing Search Simulated Annealing
More informationDeveloped in Consultation with Tennessee Educators
Developed in Consultation with Tennessee Educators Table of Contents Letter to the Student........................................ Test-Taking Checklist........................................ Tennessee
More informationFitting a transformation: Feature-based alignment April 30 th, Yong Jae Lee UC Davis
Fitting a transformation: Feature-based alignment April 3 th, 25 Yong Jae Lee UC Davis Announcements PS2 out toda; due 5/5 Frida at :59 pm Color quantization with k-means Circle detection with the Hough
More informationThe Binary Genetic Algorithm. Universidad de los Andes-CODENSA
The Binary Genetic Algorithm Universidad de los Andes-CODENSA 1. Genetic Algorithms: Natural Selection on a Computer Figure 1 shows the analogy between biological i l evolution and a binary GA. Both start
More informationEvolutionary Computation. Chao Lan
Evolutionary Computation Chao Lan Outline Introduction Genetic Algorithm Evolutionary Strategy Genetic Programming Introduction Evolutionary strategy can jointly optimize multiple variables. - e.g., max
More informationComparison between Neighbourhood and Genetic Algorithms on two Analytic Objective Functions and on a 2.5D Synthetic Seismic Inverse Problems
Comparison between Neighbourhood and Genetic Algorithms on two Analytic Objective Functions and on a 2.5D Synthetic Seismic Inverse Problems A. Sajeva*, M. Aleardi*, A. Mazzotti* and E. Stucchi** * Università
More informationCross-validation for detecting and preventing overfitting
Cross-validation for detecting and preventing overfitting Note to other teachers and users of these slides. Andrew would be delighted if ou found this source material useful in giving our own lectures.
More informationFaculty of Science and Technology MASTER S THESIS
Faculty of Science and Technology MASTER S THESIS Study program/ Specialization: Petroleum Engineering/Reservoir Engineering Writer : Ibnu Hafidz Arief Faculty supervisor: Prof.Dr. Hans Spring semester,
More informationArtificial Intelligence
Artificial Intelligence Local Search Vibhav Gogate The University of Texas at Dallas Some material courtesy of Luke Zettlemoyer, Dan Klein, Dan Weld, Alex Ihler, Stuart Russell, Mausam Systematic Search:
More information3-2. Families of Graphs. Look Back. OBJECTIVES Identify transformations of simple graphs. Sketch graphs of related functions.
3-2 BJECTIVES Identif transformations of simple graphs. Sketch graphs of related functions. Families of Graphs ENTERTAINMENT At some circuses, a human cannonball is shot out of a special cannon. In order
More informationMATLAB Simulink Modeling and Simulation of Recurrent Neural Network for Solving Linear Programming Problems
International Conference on Mathematical Computer Engineering - ICMCE - 8 MALAB Simulink Modeling and Simulation of Recurrent Neural Network for Solving Linear Programming Problems Raja Das a a School
More informationSolving Traveling Salesman Problem Using Parallel Genetic. Algorithm and Simulated Annealing
Solving Traveling Salesman Problem Using Parallel Genetic Algorithm and Simulated Annealing Fan Yang May 18, 2010 Abstract The traveling salesman problem (TSP) is to find a tour of a given number of cities
More informationA new Optimization Algorithm for the Design of Integrated Circuits
EUROCON 2007 The International Conference on Computer as a Tool Warsaw, September 9-12 A new Optimization Algorithm for the Design of Integrated Circuits Jernej Olenšek, Árpád Bűrmen, Janez Puhan, Tadej
More informationUsing a Table of Values to Sketch the Graph of a Polynomial Function
A point where the graph changes from decreasing to increasing is called a local minimum point. The -value of this point is less than those of neighbouring points. An inspection of the graphs of polnomial
More informationStandard Optimization Techniques
12 Standard Optimization Techniques Peter Marwedel TU Dortmund, Informatik 12 Germany Springer, 2010 2012 年 12 月 19 日 These slides use Microsoft clip arts. Microsoft copyright restrictions apply. Structure
More information3 Limits Involving Infinity: Asymptotes LIMITS INVOLVING INFINITY. 226 Chapter 3 Additional Applications of the Derivative
226 Chapter 3 Additional Applications of the Derivative 52. Given the function f() 2 3 3 2 2 7, complete the following steps: (a) Graph using [, ] b [, ] and [, ] b [ 2, 2]2. (b) Fill in the following
More information1.5 LIMITS. The Limit of a Function
60040_005.qd /5/05 :0 PM Page 49 SECTION.5 Limits 49.5 LIMITS Find its of functions graphicall and numericall. Use the properties of its to evaluate its of functions. Use different analtic techniques to
More informationCHAPTER 4 WAVELET TRANSFORM-GENETIC ALGORITHM DENOISING TECHNIQUE
102 CHAPTER 4 WAVELET TRANSFORM-GENETIC ALGORITHM DENOISING TECHNIQUE 4.1 INTRODUCTION This chapter introduces an effective combination of genetic algorithm and wavelet transform scheme for the denoising
More informationUsing Genetic Algorithms to Solve the Box Stacking Problem
Using Genetic Algorithms to Solve the Box Stacking Problem Jenniffer Estrada, Kris Lee, Ryan Edgar October 7th, 2010 Abstract The box stacking or strip stacking problem is exceedingly difficult to solve
More informationOPTIMIZATION METHODS. For more information visit: or send an to:
OPTIMIZATION METHODS modefrontier is a registered product of ESTECO srl Copyright ESTECO srl 1999-2007 For more information visit: www.esteco.com or send an e-mail to: modefrontier@esteco.com NEOS Optimization
More information2.4 Polynomial and Rational Functions
Polnomial Functions Given a linear function f() = m + b, we can add a square term, and get a quadratic function g() = a 2 + f() = a 2 + m + b. We can continue adding terms of higher degrees, e.g. we can
More informationChapter 4 Section 1 Graphing Linear Inequalities in Two Variables
Chapter 4 Section 1 Graphing Linear Inequalities in Two Variables Epressions of the tpe + 2 8 and 3 > 6 are called linear inequalities in two variables. A solution of a linear inequalit in two variables
More informationChapter 14 Global Search Algorithms
Chapter 14 Global Search Algorithms An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Introduction We discuss various search methods that attempts to search throughout the entire feasible set.
More informationGENETIC ALGORITHM with Hands-On exercise
GENETIC ALGORITHM with Hands-On exercise Adopted From Lecture by Michael Negnevitsky, Electrical Engineering & Computer Science University of Tasmania 1 Objective To understand the processes ie. GAs Basic
More informationx=2 26. y 3x Use calculus to find the area of the triangle with the given vertices. y sin x cos 2x dx 31. y sx 2 x dx
4 CHAPTER 6 APPLICATIONS OF INTEGRATION 6. EXERCISES 4 Find the area of the shaded region.. =5-. (4, 4) =. 4. = - = (_, ) = -4 =œ + = + =.,. sin,. cos, sin,, 4. cos, cos, 5., 6., 7.,, 4, 8., 8, 4 4, =_
More informationReflector calculation, validation and optimisation using Radiance Krzysztof WANDACHOWICZ
Reflector calculation, validation and optimisation using Radiance Krzysztof WANDACHOWICZ page 1 Radiance Workshop 2004 Calculation of Luminaires Using Radiance The idea Radiance Workshop 2006 Design optimisation
More informationTest functions for optimization needs
Test functions for optimization needs Marcin Molga, Czesław Smutnicki 3 kwietnia 5 Streszczenie This paper provides the review of literature benchmarks (test functions) commonl used in order to test optimization
More information3.2 Polynomial Functions of Higher Degree
71_00.qp 1/7/06 1: PM Page 6 Section. Polnomial Functions of Higher Degree 6. Polnomial Functions of Higher Degree What ou should learn Graphs of Polnomial Functions You should be able to sketch accurate
More informationMulti-Objective Memetic Algorithm using Pattern Search Filter Methods
Multi-Objective Memetic Algorithm using Pattern Search Filter Methods F. Mendes V. Sousa M.F.P. Costa A. Gaspar-Cunha IPC/I3N - Institute of Polymers and Composites, University of Minho Guimarães, Portugal
More informationIntermediate Algebra. Gregg Waterman Oregon Institute of Technology
Intermediate Algebra Gregg Waterman Oregon Institute of Technolog c 2017 Gregg Waterman This work is licensed under the Creative Commons Attribution 4.0 International license. The essence of the license
More informationName: Date: Absolute Value Transformations
Name: Date: Absolute Value Transformations Vocab: Absolute value is the measure of the distance awa from zero on a number line. Since absolute value is the measure of distance it can never be negative!
More informationGrid and Mesh Generation. Introduction to its Concepts and Methods
Grid and Mesh Generation Introduction to its Concepts and Methods Elements in a CFD software sstem Introduction What is a grid? The arrangement of the discrete points throughout the flow field is simpl
More information