What is Optimization? Optimization is the mathematical discipline which is concerned with finding the maxima and minima of functions, possibly subject.

Slides:

Advertisements

Similar presentations

1 Modeling and Simulation: Exploring Dynamic System Behaviour Chapter9 Optimization.

Advertisements

Introduction to Optimization Anjela Govan North Carolina State University SAMSI NDHS Undergraduate workshop 2006.

MATLAB Optimization Greg Reese, Ph.D Research Computing Support Group Miami University.

Unconstrained optimization Gradient based algorithms –Steepest descent –Conjugate gradients –Newton and quasi-Newton Population based algorithms –Nelder.

Optimization Methods TexPoint fonts used in EMF.

Optimization : The min and max of a function

Optimization 吳育德.

Optimization methods Review

Introduction to Function Minimization. Motivation example Data on height of a group of people, men and women Data on gender not recorded, not known.

Optimization Introduction & 1-D Unconstrained Optimization

Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.

SE- 521: Nonlinear Programming and Applications S. O. Duffuaa.

Nonlinear Regression Ecole Nationale Vétérinaire de Toulouse Didier Concordet ECVPT Workshop April 2011 Can be downloaded at

CHAPTER 2 D IRECT M ETHODS FOR S TOCHASTIC S EARCH Organization of chapter in ISSO –Introductory material –Random search methods Attributes of random search.

Random numbers and optimization techniques Jorge Andre Swieca School Campos do Jordão, January,2003 second lecture.

Chapter 3 UNCONSTRAINED OPTIMIZATION

Geometry Optimization Pertemuan VI. Geometry Optimization Backgrounds Real molecules vibrate thermally about their equilibrium structures. Finding minimum.

Numerical Optimization

Lecture 9. Unconstrained Optimization Need to maximize a function f(x), where x is a scalar or a vector x = (x 1, x 2 ) f(x) = -x x 2 2 f(x) = -(x-a)

1 Introduction to Linear and Integer Programming Lecture 9: Feb 14.

Design Optimization School of Engineering University of Bradford 1 Numerical optimization techniques Unconstrained multi-parameter optimization techniques.

Search and Optimization Methods Based in part on Chapter 8 of Hand, Manilla, & Smyth David Madigan.

Example 1 Determine whether the stationary point of the following quadratic functions is a local maxima, local minima or saddle point? A point x* is a.

Advanced Topics in Optimization

D Nagesh Kumar, IIScOptimization Methods: M2L3 1 Optimization using Calculus Optimization of Functions of Multiple Variables: Unconstrained Optimization.

Why Function Optimization ?

1 Numerical geometry of non-rigid shapes Non-Euclidean Embedding Non-Euclidean Embedding Lecture 6 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.

An Introduction to Optimization Theory. Outline Introduction Unconstrained optimization problem Constrained optimization problem.

Optimization Methods One-Dimensional Unconstrained Optimization

Lecture 9 – Nonlinear Programming Models

Introduction to Optimization (Part 1)

CS B553: A LGORITHMS FOR O PTIMIZATION AND L EARNING Gradient descent.

Morphological Analysis of 3D Scalar Fields based on Morse Theory and Discrete Distortion Mohammed Mostefa Mesmoudi Leila De Floriani Paola Magillo Dept.

06 - Boundary Models Overview Edge Tracking Active Contours Conclusion.

Part 2 Chapter 7 Optimization

ENCI 303 Lecture PS-19 Optimization 2

84 b Unidimensional Search Methods Most algorithms for unconstrained and constrained optimisation use an efficient unidimensional optimisation technique.

Chem Math 252 Chapter 5 Regression. Linear & Nonlinear Regression Linear regression –Linear in the parameters –Does not have to be linear in the.

Multivariate Unconstrained Optimisation First we consider algorithms for functions for which derivatives are not available. Could try to extend direct.

Local search algorithms Most local search algorithms are based on derivatives to guide the search. For differentiable function it has been shown that.

Engineering Optimization Chapter 3 : Functions of Several Variables (Part 1) Presented by: Rajesh Roy Networks Research Lab, University of California,

559 Fish 559; Lecture 5 Non-linear Minimization. 559 Introduction Non-linear minimization (or optimization) is the numerical technique that is used by.

Chapter 10 Minimization or Maximization of Functions.

Exam 1 Oct 3, closed book Place ITE 119, Time:12:30-1:45pm

Non-Linear Programming © 2011 Daniel Kirschen and University of Washington 1.

Survey of unconstrained optimization gradient based algorithms

Optimal Path Planning Using the Minimum-Time Criterion by James Bobrow Guha Jayachandran April 29, 2002.

Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.

Nonlinear Programming In this handout Gradient Search for Multivariable Unconstrained Optimization KKT Conditions for Optimality of Constrained Optimization.

Optimization in Engineering Design 1 Introduction to Non-Linear Optimization.

Advanced Computer Graphics Optimization Part 2 Spring 2002 Professor Brogan.

Searching a Linear Subspace Lecture VI. Deriving Subspaces There are several ways to derive the nullspace matrix (or kernel matrix). ◦ The methodology.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 2 - Chapter 7 Optimization.

Regularized Least-Squares and Convex Optimization.

Optimal Control.

CS5321 Numerical Optimization

Chap 3. The simplex method

Collaborative Filtering Matrix Factorization Approach

Local search algorithms

Chapter 7: Optimization

Introduction to Scientific Computing II

Introduction to Scientific Computing II

Introduction to Scientific Computing II

Downhill Simplex Search (Nelder-Mead Method)

Introduction to Scientific Computing II

Evolutionary Computational Intelligence

Part 2 Chapter 7 Optimization

What are optimization methods?

Presentation transcript:

What is Optimization? Optimization is the mathematical discipline which is concerned with finding the maxima and minima of functions, possibly subject to constraints.

Protein Folding Generally speaking the problem of protein folding can be viewed as an Optimization problem.

Finding parameters of your model Often, experimental data is available. Suppose is necessary to find (fit) a model to reproduce the data. x y

Where would we used optimization? Bioinformatics Physics Nutrition Electrical circuits Economics Finance Etc.

Gradient (steepest) descend algorithm

Gradient Descend Algorithm

The Nelder-Mead algorithm or simplex search algorithm is one of the best known algorithms for multidimensional unconstrained optimization without derivatives What if derivatives are not available?

Definition: Simplex A simplex or n-simplex is the convex hull of a set of (n +1) points. A simplex is an n-dimensional analogue of a triangle. Example:  a 1-simplex is a line segment  a 2-simplex is a triangle  a 3-simplex is a tetrahedron

Step1 : Initial simplex n the number of variables (dimension) From an initial gues Xo, define an initial n-simplex (that is n+1 points),

f(x_h) > f(x_s) > …. > f(l) Step2 : order the vertices of the current simplex x_h x_s x_l Compute centroid of the face oposite to x_h (worst point)

Try to find a new point that is better than x_h Step3 : transform simplex TRY REFLEXION TRY EXPANSION

Step 3 : transform simplex If we can not find a better point try the following operations: CONTRACTION OUTSIDE CONTRACTION INSIDE

If the previous operations did not find a better point then perform a shrink operation, using the best point (x_l) as reference. Step 3 : Transform the simples

Step 4 : Test convergence If simplex is small enough : finish If the functions are close enough : finish If max. number of iteration is reached: finish Otherwise go to step 2

fminsearch is a built-in MATLAB function. It is able to find a minimum for a scalar function of several variables. x = fminsearch(fun,x0) starts at the point x0 and returns a value x that is a local minimizer of the function described in fun. MATLAB: fminsearch