Mathematical Models & Optimization?

Slides:



Advertisements
Similar presentations
Algorithm Design Methods (I) Fall 2003 CSE, POSTECH.
Advertisements

Solving LP Models Improving Search Special Form of Improving Search
Edge Preserving Image Restoration using L1 norm
Neural and Evolutionary Computing - Lecture 4 1 Random Search Algorithms. Simulated Annealing Motivation Simple Random Search Algorithms Simulated Annealing.
CSCI 347 / CS 4206: Data Mining Module 07: Implementations Topic 03: Linear Models.
Model calibration using. Pag. 5/3/20152 PEST program.
FTP Biostatistics II Model parameter estimations: Confronting models with measurements.
Experimental Design, Response Surface Analysis, and Optimization
Discrete Optimization Shi-Chung Chang. Discrete Optimization Lecture #1 Today: Reading Assignments 1.Chapter 1 and the Appendix of [Pas82] 2.Chapter 1.
Regression Analysis Using Excel. Econometrics Econometrics is simply the statistical analysis of economic phenomena Here, we just summarize some of the.
Gizem ALAGÖZ. Simulation optimization has received considerable attention from both simulation researchers and practitioners. Both continuous and discrete.
Classification and Prediction: Regression Via Gradient Descent Optimization Bamshad Mobasher DePaul University.
Simulated Annealing Student (PhD): Umut R. ERTÜRK Lecturer : Nazlı İkizler Cinbiş
Support Vector Machines (SVMs) Chapter 5 (Duda et al.)
OPTIMAL CONTROL SYSTEMS
MAE 552 – Heuristic Optimization Lecture 3 January 28, 2002.
Page 1 Page 1 ENGINEERING OPTIMIZATION Methods and Applications A. Ravindran, K. M. Ragsdell, G. V. Reklaitis Book Review.
Reporter : Mac Date : Multi-Start Method Rafael Marti.
Optimization Methods Unconstrained optimization of an objective function F Deterministic, gradient-based methods Running a PDE: will cover later in course.
Gradient Methods May Preview Background Steepest Descent Conjugate Gradient.
An Introduction to Black-Box Complexity
Introduction to Simulated Annealing 22c:145 Simulated Annealing  Motivated by the physical annealing process  Material is heated and slowly cooled.
By Rohit Ray ESE 251.  Most minimization (maximization) strategies work to find the nearest local minimum  Trapped at local minimums (maxima)  Standard.
Chapter 3 Introduction to Optimization Modeling
Collaborative Filtering Matrix Factorization Approach
Neural Networks Lecture 8: Two simple learning algorithms
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
More Machine Learning Linear Regression Squared Error L1 and L2 Regularization Gradient Descent.
Operations Research Models
Tutorial 5: Numerical methods - buildings Q1. Identify three principal differences between a response function method and a numerical method when both.
Stochastic Approximation and Simulated Annealing Lecture 8 Leonidas Sakalauskas Institute of Mathematics and Informatics Vilnius, Lithuania EURO Working.
Gaussian process modelling
Quantitative Methods of Management
1 IE 607 Heuristic Optimization Simulated Annealing.
Australian Journal of Basic and Applied Sciences, 5(11): , 2011 ISSN Monte Carlo Optimization to Solve a Two-Dimensional Inverse Heat.
ENCI 303 Lecture PS-19 Optimization 2
Integrating Neural Network and Genetic Algorithm to Solve Function Approximation Combined with Optimization Problem Term presentation for CSC7333 Machine.
Ken YoussefiMechanical Engineering Dept. 1 Design Optimization Optimization is a component of design process The design of systems can be formulated as.
Simulated Annealing.
Multiple Regression Petter Mostad Review: Simple linear regression We define a model where are independent (normally distributed) with equal.
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Optimization & Constraints Add mention of global techiques Add mention of calculus.
Neural Nets: Something you can use and something to think about Cris Koutsougeras What are Neural Nets What are they good for Pointers to some models and.
V Bandi and R Lahdelma 1 Forecasting. V Bandi and R Lahdelma 2 Forecasting? Decision-making deals with future problems -Thus data describing future must.
ZEIT4700 – S1, 2015 Mathematical Modeling and Optimization School of Engineering and Information Technology.
1  The Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
Regress-itation Feb. 5, Outline Linear regression – Regression: predicting a continuous value Logistic regression – Classification: predicting a.
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
An Introduction to Simulated Annealing Kevin Cannons November 24, 2005.
Optimization in Engineering Design 1 Introduction to Non-Linear Optimization.
IE 312 Review 1. The Process 2 Problem Model Conclusions Problem Formulation Analysis.
Introduction to emulators Tony O’Hagan University of Sheffield.
Linear Models Tony Dodd. 21 January 2008Mathematics for Data Modelling: Linear Models Overview Linear models. Parameter estimation. Linear in the parameters.
Support Vector Machines (SVMs) Chapter 5 (Duda et al.) CS479/679 Pattern Recognition Dr. George Bebis.
Bounded Nonlinear Optimization to Fit a Model of Acoustic Foams
Decision Support Systems
Deep Feedforward Networks
Heuristic Optimization Methods
Digital Optimization Martynas Vaidelys.
Classification Analytical methods classical methods
A Simple Artificial Neuron
Local Search Algorithms
By Rohit Ray ESE 251 Simulated Annealing.
Roberto Battiti, Mauro Brunato
Collaborative Filtering Matrix Factorization Approach
Local Search Algorithms
Dr. Arslan Ornek MATHEMATICAL MODELS
Simulated Annealing & Boltzmann Machines
REVIEW FOR EXAM 1 Chapters 3, 4, 5 & 6.
Optimization under Uncertainty
Presentation transcript:

Mathematical Models & Optimization? Mankind always sets itself only such problems as it can solve… -Karl Marx (1859) Why build them? To study real-world phenomena where analytic techniques alone don’t work! To investigate relationships among parameters affecting the functioning of complex processes Where does optimization come in? The model is not usually an end in itself Model contains free parameters whose values have to be determined to produce an optimum measure of “goodness”

The Data Modeling Process … who can tell Which of her forms has shown her substance right? - William Butler Yeats, in A Bronze Head (1933) Create alternative MODELS Gather DATA Fit each MODEL to the DATA Gather more data Create new models Assign preferences to the alternative MODELS Choose what data to gather next Decide whether to create new models Choose future actions

Example Phenomenon: Residential demand for electricity Influencing factors: Prices of electricity & competing energy sources Socio-economic indicators (e.g. income) Weather indicators (e.g. heating degree days) Possible models: Econometric (linear or nonlinear) End-Use Model Artificial Neural Network

Example from your world Phenomenon: Runoff Influencing factors: Slope Cover Rainfall Possible models: Linear model Nonlinear model Artificial Neural Network

Linear Model:

Given that the linear model is the right model to account for runoff: Values for slope, cover, rainfall and the corresponding observes runoff are collected at different (x,y) locations and over time Model parameters are estimated to minimize the discrepancies between the predicted runoff (model output) and the observed runoff over the collected sample This is what you call “modern calibration” This estimation problem could be formulated as: This is an optimization problem

The Optimization Problem

Mapping the jargon Optimization lingo Function being optimized Objective function Model parameters Decision variables Constraints on model parameters constraints Simple constraints on simple bounds or The range of model parameters box constraints Objective function describes a response surface Intersection of constraints in the decision variable space Defines the feasible region or the search space

Classification of optimization problems Properties of f(x) Functional form exists: Linear Sum of squares of linear functions Quadratic function Sum of squares of nonlinear functions Smooth nonlinear function Non-smooth nonlinear function Functional form does not exist: Output of a black box Unimodal: The exists only one optimum Multimodal: There exist more than one optimum at different objective function values

Classification of optimization problems Cont. Properties of gi(x) Nature of x No constraints Simple bounds Linear functions Sparse linear functions Smooth nonlinear functions Sparse nonlinear functions Non-smooth non-linear functions Continuous Discrete Mixed

Stopping Criteria: Necessary conditions for a minimum at x* In the univariate case: In the multivariate case:

What if no gradient info. Is available? How hard we want to work on the problem (e.g. computing time) No improving for the last N6 iterations What if there are more than one minimum? Only under restricted conditions can we guarantee the “global” minimum!

Overview of existing solution methods Local Search Methods Global Search Methods (e.g. gradient descent) Deterministic Probabilistic

More on probabilistic global search methods Possibilities: Tabu Search Simulated Annealing Genetic Algorithms

Stimulated Annealing (kirkpatrick, Gelatt, and Vecchi, 1983) Motivated by the behavior of systems in thermal equilibrium at a finite temperature (statistical mechanics) Was initially designed for optimization problems with discrete decision variables. Extensions to continuous problems have been introduced (e.g. Goffe et al., 1994) Allows non improving moves with a non-zero probability

General outline of Algorithm (for a minimization problem) Cooling schedule

Important issues: Choice of Initial temperature and cooling schedule Stopping criteria Diversification Vs. intensification of search

Where can you go for more info? Literature? Numerous books & textbooks on optimization and mathematical modeling (not as much on global optimization!) A host of publications. Check journals by INFORMS and the European Society of Operational Research Software packages & computer code on the net Cplex for linear programming, GAMS as an interface to a variety of linear and nonlinear solvers (available on ECN) Libraries like IMSL Various codes written for SA & GAs available free of charge on the internet Resources on the internet Do a keyword search and you’ll locate quite a few links.