L8 Optimal Design concepts pt D

Slides:



Advertisements
Similar presentations
3.6 Support Vector Machines
Advertisements

Optimality conditions for constrained local optima, Lagrange multipliers and their use for sensitivity of optimal solutions.
Engineering Optimization
Optimization. f(x) = 0 g i (x) = 0 h i (x)
Page 1 Page 1 ENGINEERING OPTIMIZATION Methods and Applications A. Ravindran, K. M. Ragsdell, G. V. Reklaitis Book Review.
1 OR II GSLM Outline  classical optimization – unconstrained optimization  dimensions of optimization  feasible direction.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Lecture 8 – Nonlinear Programming Models Topics General formulations Local vs. global solutions Solution characteristics Convexity and convex programming.
L12 LaGrange Multiplier Method Homework Review Summary Test 1.
Optimality conditions for constrained local optima, Lagrange multipliers and their use for sensitivity of optimal solutions Today’s lecture is on optimality.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
The Most Important Concept in Optimization (minimization)  A point is said to be an optimal solution of a unconstrained minimization if there exists no.
Optimization in Engineering Design 1 Lagrange Multipliers.
Numerical Optimization
Engineering Optimization
Economics 214 Lecture 37 Constrained Optimization.
Constrained Optimization
Unconstrained Optimization Problem
Constrained Optimization Economics 214 Lecture 41.
MAE 552 – Heuristic Optimization Lecture 1 January 23, 2002.
D Nagesh Kumar, IIScOptimization Methods: M2L5 1 Optimization using Calculus Kuhn-Tucker Conditions.
Optimality Conditions for Nonlinear Optimization Ashish Goel Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A.
D Nagesh Kumar, IIScOptimization Methods: M2L3 1 Optimization using Calculus Optimization of Functions of Multiple Variables: Unconstrained Optimization.
1 Optimization. 2 General Problem 3 One Independent Variable x y (Local) maximum Slope = 0.
Introduction to Optimization (Part 1)
1 Least Cost System Operation: Economic Dispatch 2 Smith College, EGR 325 March 10, 2006.
KKT Practice and Second Order Conditions from Nash and Sofer
L13 Optimization using Excel See revised schedule read 8(1-4) + Excel “help” for Mar 12 Test Answers Review: Convex Prog. Prob. Worksheet modifications.
L4 Graphical Solution Homework See new Revised Schedule Review Graphical Solution Process Special conditions Summary 1 Read for W for.
LAGRANGE mULTIPLIERS By Rohit Venkat.
Slide 2a.1 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Lecture.
EASTERN MEDITERRANEAN UNIVERSITY Department of Industrial Engineering Non linear Optimization Spring Instructor: Prof.Dr.Sahand Daneshvar Submited.
D Nagesh Kumar, IIScOptimization Methods: M2L4 1 Optimization using Calculus Optimization of Functions of Multiple Variables subject to Equality Constraints.
L8 Optimal Design concepts pt D
Part 4 Nonlinear Programming 4.1 Introduction. Standard Form.
L21 Numerical Methods part 1 Homework Review Search problem Line Search methods Summary 1 Test 4 Wed.
(iii) Lagrange Multipliers and Kuhn-tucker Conditions D Nagesh Kumar, IISc Introduction to Optimization Water Resources Systems Planning and Management:
Functions of Several Variables Copyright © Cengage Learning. All rights reserved.
Introduction to Optimization
Nonlinear Programming In this handout Gradient Search for Multivariable Unconstrained Optimization KKT Conditions for Optimality of Constrained Optimization.
CS B553: A LGORITHMS FOR O PTIMIZATION AND L EARNING Constrained optimization.
Linear Programming Chapter 9. Interior Point Methods  Three major variants  Affine scaling algorithm - easy concept, good performance  Potential.
1 Introduction Optimization: Produce best quality of life with the available resources Engineering design optimization: Find the best system that satisfies.
Continuous Optimization. Copyright by Yu-Chi Ho2 First and second N.A.S.C. F Unconstraint optimization problem F Performance index: F Decision vector:
OR II GSLM
D Nagesh Kumar, IISc Water Resources Systems Planning and Management: M2L2 Introduction to Optimization (ii) Constrained and Unconstrained Optimization.
Optimal Control.
1 Support Vector Machines: Maximum Margin Classifiers Machine Learning and Pattern Recognition: September 23, 2010 Piotr Mirowski Based on slides by Sumit.
Another sufficient condition of local minima/maxima
L6 Optimal Design concepts pt B
Part 4 Nonlinear Programming
Chapter 11 Optimization with Equality Constraints
L11 Optimal Design L.Multipliers
Module E3-a Economic Dispatch.
Optimality conditions constrained optimisation
CS5321 Numerical Optimization
3-3 Optimization with Linear Programming
The Lagrange Multiplier Method
L5 Optimal Design concepts pt A
L10 Optimal Design L.Multipliers
Part 4 Nonlinear Programming
13 Functions of Several Variables
Outline Unconstrained Optimization Functions of One Variable
Structural Optimization Design ( Structural Analysis & Optimization )
Differentiation Summary
CS5321 Numerical Optimization
Optimal Control of Systems
L7 Optimal Design concepts pt C
Constraints.
Presentation transcript:

L8 Optimal Design concepts pt D Homework Review Equality Constrained MVO LaGrange Function Necessary Condition EC-MVO Example Summary

MV Optimization- UNCONSTRAINED For x* to be a local minimum: 1rst order Necessary Condition 2nd order Sufficient Condition i.e. H(x*) must be positive definite

MV Optimization- CONSTRAINED For x* to be a local minimum:

LaGrange Function If we let x* be the minimum f(x*) in the feasible region: All x* satisfy the equality constraints (i.e. hj =0)   Let’s create the LaGrange Function by augmenting the objective function with “0’s” Using parameters, known as LaGrange multipliers, and the equality constraints

Necessary Condition Necessary condition for a stationary point Given f(x), one equality constraint, and n=2

2D Example

Example cont’d

Example cont’d

Geometric meaning?

Stationary Points Points that satisfy the necessary condition of the LaGrange Function are stationary points Also called “Karush-Kuhn-Tucker” or KKT points

Lagrange Multiplier Method 1. Both f(x) and all hj(x) are differentiable 2. x* must be a regular point: x* is feasible (i.e. satisfies all hj(x) Gradient vectors of hj(x) are linearly independent (not parallel, otherwise no unique solution) 3. LaGrange multipliers can be +, - or 0. Can multiply h(x) by -1, feasible region is the same.

Summary LaGrange Function L(x,u) Necessary Conditions for EC-MVO Example Geometric meaning of multiplier