Kliknij, aby edytować styl wzorca tytułu A global optimization method for solving parametric linear system whose input data are rational functions of interval.

Slides:



Advertisements
Similar presentations
Arc-length computation and arc-length parameterization
Advertisements

Yuri R. Tsoy, Vladimir G. Spitsyn, Department of Computer Engineering
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Intelligent Control Methods Lecture 12: Genetic Algorithms Slovak University of Technology Faculty of Material Science and Technology in Trnava.
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2014 – 35148: Continuous Solution for Boundary Value Problems.
Genetic Algorithms for Real Parameter Optimization Written by Alden H. Wright Department of Computer Science University of Montana Presented by Tony Morelli.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
DAN SHMIDT ITAY BITTAN Advanced Topics in Evolutionary Algorithms.
Solving Linear Equations Rule 7 ‑ 1: We can perform any mathematical operation on one side of an equation, provided we perform the same operation on the.
1 Simulation Modeling and Analysis Session 13 Simulation Optimization.
Computing the Rational Univariate Reduction by Sparse Resultants Koji Ouchi, John Keyser, J. Maurice Rojas Department of Computer Science, Mathematics.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Handling Constraints 報告者 : 王敬育. Many researchers investigated Gas based on floating point representation but the optimization problems they considered.
Design of Curves and Surfaces by Multi Objective Optimization Rony Goldenthal Michel Bercovier School of Computer Science and Engineering The Hebrew University.
Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.
NEW APPROACH TO CALCULATION OF RANGE OF POLYNOMIALS USING BERNSTEIN FORMS.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Interval-based Inverse Problems with Uncertainties Francesco Fedele 1,2 and Rafi L. Muhanna 1 1 School of Civil and Environmental Engineering 2 School.
Genetic Algorithm.
Dr.M.V.Rama Rao Department of Civil Engineering,
A Genetic Algorithms Approach to Feature Subset Selection Problem by Hasan Doğu TAŞKIRAN CS 550 – Machine Learning Workshop Department of Computer Engineering.
Efficient Model Selection for Support Vector Machines
On comparison of different approaches to the stability radius calculation Olga Karelkina Department of Mathematics University of Turku MCDM 2011.
Charles L. Karr Rodney Bowersox Vishnu Singh
Integrating Neural Network and Genetic Algorithm to Solve Function Approximation Combined with Optimization Problem Term presentation for CSC7333 Machine.
Geometric Operations and Morphing.
3 RD NSF Workshop on Imprecise Probability in Engineering Analysis & Design February 20-22, 2008 | Georgia Institute of Technology, Savannah, USA On using.
What is a model Some notations –Independent variables: Time variable: t, n Space variable: x in one dimension (1D), (x,y) in 2D or (x,y,z) in 3D –State.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Chapter 7 Handling Constraints
Appendix B A BRIEF TOUR OF SOLVER Prescriptive Analytics
Solving Linear Programming Problems: The Simplex Method
Lots of Pages Homework Pg. 184#41 – 53 all #28 C(7, 4) r = #33 #40 (-∞, -5/3]U[3, ∞)#42[-2, -1)U(-1, ∞) #52 (-∞, 2]#88y – axis #91 origin#104Does not pass.
Goal: Solve a system of linear equations in two variables by the linear combination method.
Robustness in Numerical Computation I Root Finding Kwanghee Ko School of Mechatronics Gwnagju Institute of Science and Technology.
Computational Complexity Jang, HaYoung BioIntelligence Lab.
Optimal Placement of Wind Turbines Using Genetic Algorithms
Evolutionary Art with Multiple Expression Programming By Quentin Freeman.
Linear Programming Erasmus Mobility Program (24Apr2012) Pollack Mihály Engineering Faculty (PMMK) University of Pécs João Miranda
Kanpur Genetic Algorithms Laboratory IIT Kanpur 25, July 2006 (11:00 AM) Multi-Objective Dynamic Optimization using Evolutionary Algorithms by Udaya Bhaskara.
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Newton’s Method, Root Finding with MATLAB and Excel
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
A Production Scheduling Problem Using Genetic Algorithm Presented by: Ken Johnson R. Knosala, T. Wal Silesian Technical University, Konarskiego Gliwice,
3-2 Solving Linear Systems Algebraically Objective: CA 2.0: Students solve system of linear equations in two variables algebraically.
Do Now (3x + y) – (2x + y) 4(2x + 3y) – (8x – y)
Alice E. Smith and Mehmet Gulsen Department of Industrial Engineering
CSCE 441: Keyframe Animation/Smooth Curves (Cont.) Jinxiang Chai.
CSCE 441: Keyframe Animation/Smooth Curves (Cont.) Jinxiang Chai.
New inclusion functions in interval global optimization of engineering structures Andrzej Pownuk Chair of Theoretical Mechanics Faculty of Civil Engineering.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
Parallel Simulated Annealing using Genetic Crossover Tomoyuki Hiroyasu Mitsunori Miki Maki Ogura November 09, 2000 Doshisha University, Kyoto, Japan.
Breeding Swarms: A GA/PSO Hybrid 簡明昌 Author and Source Author: Matthew Settles and Terence Soule Source: GECCO 2005, p How to get: (\\nclab.csie.nctu.edu.tw\Repository\Journals-
Genetic Algorithm(GA)
Evolutionary Design of the Closed Loop Control on the Basis of NN-ANARX Model Using Genetic Algoritm.
Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Evolutionary Computation Evolving Neural Network Topologies.
INTEGRATION & TECHNIQUES OF INTEGRATION
Evolving the goal priorities of autonomous agents
Iwona Skalna Department of Applied Informatics Cracow, Poland
Genetic Algorithms CSCI-2300 Introduction to Algorithms
EE368 Soft Computing Genetic Algorithms.
Applications of Genetic Algorithms TJHSST Computer Systems Lab
Introduction to Genetic Algorithm and Some Experience Sharing
Artificial Intelligence CIS 342
Derivative-free Methods for Structural Optimization
Presentation transcript:

Kliknij, aby edytować styl wzorca tytułu A global optimization method for solving parametric linear system whose input data are rational functions of interval parameters Iwona Skalna AGH University of Science and Technology Krakow, Poland Outline Parametric linear systems Optimization problem Global optmization Monotonicity test Iwona Skalna, PolandSmall Workshop on Interval Methods09, Lausanne Revised affine arithmetic Evolutionary optimization Examples Conclusions

Kliknij, aby edytować styl wzorca tytułu Parametric linear systems Optimization problem Interval global optmization Monotonicity test Revised affine arithmetic Evolutionary optimization Examples Conclusions Iwona Skalna, Krakow, PolandSmall Workshop on Interval Methods09, Lausanne Outline Parametric linear systems Optimization problem Global optmization Monotonicity test Revised affine arithmetic Evolutionary optimization Examples Conclusions

Parametric linear system is defined as a family of real linear systems whereare nonlinear continuous functions of parameters with coefficients Kliknij, aby edytować styl wzorca tytułu Small Workshop on Interval Methods09, LausanneIwona Skalna, Krakow, Poland Outline Parametric linear systems Optimization problem Global optmization Monotonicity test Revised affine arithmetic Evolutionary optimization Examples Conclusions

The goal is to find the thightest interval enclosure for S, possibly the interval hull solution defined as Parametric (united) solution set is define as Kliknij, aby edytować styl wzorca tytułu Small Workshop on Interval Methods09, LausanneIwona Skalna, Krakow, Poland If the solution is monotone with respect to all parameters, then the interval hull solution can be calculated by solving at most 2n real linear systems with coefficients being the respective endpoints of interval parameters Outline Parametric linear systems Optimization problem Global optmization Monotonicity test Revised affine arithmetic Evolutionary optimization Examples Conclusions

In general case, to calculate the hull solution, the following 2n constrained optimization problems must be solved where is an objective function Kliknij, aby edytować styl wzorca tytułu Small Workshop on Interval Methods09, LausanneIwona Skalna, Krakow, Poland Outline Parametric linear systems Optimization problem Global optmization Monotonicity test Revised affine arithmetic Evolutionary optimization Examples Conclusions

The optimizations problems are solved using an interval global optimization. The interval global optimization algorithm has the following steps: Various acceleration techniques are used to speed up the convergence of global optimization. The monotonicity test is the most important one for the considered problem. Step 1. Initialize the list L =(pq, x(pq)) Step 2. Remove (pq, x(pq)) from the list L Step 3. Bisect pq = pq 1 pq 2 Step 4. Calculate x(pq i ), pq i Step 5. Perform the monotonicity test Step 6. If w(pq) < STOP else GOTO 2 Kliknij, aby edytować styl wzorca tytułu Small Workshop on Interval Methods09, LausanneIwona Skalna, Krakow, Poland Outline Parametric linear systems Optimization problem Global optmization Monotonicity test Revised affine arithmetic Evolutionary optimization Examples Conclusions

If a devirative has constant sing, then the corresponding interval can be reduced to one of its edges. or The monotonicicty test is performed using the Direct Method solving parametric linear systems. To check the sign of derivatives, the following parametric linear systems must be solved: Kliknij, aby edytować styl wzorca tytułu Small Workshop on Interval Methods09, LausanneIwona Skalna, Krakow, Poland Outline Parametric linear systems Optimization problem Global optmization Monotonicity test Revised affine arithmetic Evolutionary optimization Examples Conclusions The Direct Method is also used to calculate inclusion function for the objective function x(p,q) is

Direct Method requires affine-linear dependencies. The nonlinear functions must be transformed into affine-linear forms. This is acheived using the revised affine arithmetic. Kliknij, aby edytować styl wzorca tytułu Arithmetic operations used in this work are defined as follows: Small Workshop on Interval Methods09, LausanneIwona Skalna, Krakow, Poland Revised affine form Outline Parametric linear systems Optimization problem Global optmization Monotonicity test Revised affine arithmetic Evolutionary optimization Examples Conclusions

multiplication Kliknij, aby edytować styl wzorca tytułu Small Workshop on Interval Methods09, LausanneIwona Skalna, Krakow, Poland Outline Parametric linear systems Optimization problem Global optmization Monotonicity test Revised affine arithmetic Evolutionary optimization Examples Conclusions where

reciprocal division Kliknij, aby edytować styl wzorca tytułu Small Workshop on Interval Methods09, LausanneIwona Skalna, Krakow, Poland Outline Parametric linear systems Optimization problem Global optmization Monotonicity test Revised affine arithmetic Evolutionary optimization Examples Conclusions whereis a range of an affine form where

Interval global optimization method produces hull solution for parametric linear systems with affine-linear dependencies which is en enclosure for the solution set of the original system with non-affine dependencies. The amount of the overestimation is verified using an evolutionary optimization method. Each evolutionary algorith has the following steps: Step 1. Initialize population P(t : 0) Step 2. Crossover P(t) Step 3. Mutation P(t) Step 4. Select P(t+1) from P(t) Step 5. t : t + 1 Step 6. If done then STOP else GOTO 2 Kliknij, aby edytować styl wzorca tytułu Small Workshop on Interval Methods09, LausanneIwona Skalna, Krakow, Poland Outline Parametric linear systems Optimization problem Global optmization Monotonicity test Revised affine arithmetic Evolutionary optimization Examples Conclusions

The results of evolutionary optimization depends strongly on parameters. Here, the following parameters: Population size: 16 Number of generations: 80 Crossover probability: 0.1 Mutation probability: 0.9 Kliknij, aby edytować styl wzorca tytułu Small Workshop on Interval Methods09, LausanneIwona Skalna, Krakow, Poland and the following genetic operators are used : non-uniform mutation arithmetic crossover Outline Parametric linear systems Optimization problem Global optmization Monotonicity test Revised affine arithmetic Evolutionary optimization Examples Conclusions

Example 1. Two dimensional systems with 5 parameters Kliknij, aby edytować styl wzorca tytułu Small Workshop on Interval Methods09, LausanneIwona Skalna, Krakow, Poland Outline Parametric linear systems Optimization problem Global optmization Monotonicity test Revised affine arithmetic Evolutionary optimization Examples Conclusions

Example 1. Two dimensional systems with 5 parameters Kliknij, aby edytować styl wzorca tytułu Small Workshop on Interval Methods09, LausanneIwona Skalna, Krakow, Poland Outline Parametric linear systems Optimization problem Global optmization Monotonicity test Revised affine arithmetic Evolutionary optimization Examples Conclusions

Example 3. Real-life problem of structure mechanics Kliknij, aby edytować styl wzorca tytułu Small Workshop on Interval Methods09, LausanneIwona Skalna, Krakow, Poland Outline Parametric linear systems Optimization problem Global optmization Monotonicity test Revised affine arithmetic Evolutionary optimization Examples Conclusions One-bay structural steel frame

Kliknij, aby edytować styl wzorca tytułu Small Workshop on Interval Methods09, LausanneIwona Skalna, Krakow, Poland Outline Parametric linear systems Optimization problem Global optmization Monotonicity test Revised affine arithmetic Evolutionary optimization Examples Conclusions

Kliknij, aby edytować styl wzorca tytułu Small Workshop on Interval Methods09, LausanneIwona Skalna, Krakow, Poland Global optimization method can be succesfully used for solving parametric linear systems whose input data are rational functions of interval parameters The main drawback of global optimization is the complexity. This deficiency can be overcome by parallel programming techniques The parallelism can be introduced both in the process of the monotonicity check and in the optimization process. This will be the subject of future work Outline Parametric linear systems Optimization problem Global optmization Monotonicity test Revised affine arithmetic Evolutionary optimization Examples Conclusions

Kliknij, aby edytować styl wzorca tytułu Small Workshop on Interval Methods09, LausanneIwona Skalna, Krakow, Poland