Slide 4b.1 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., 2003. G. K. Ananthasuresh Lecture.

Slides:



Advertisements
Similar presentations
Zhen Lu CPACT University of Newcastle MDC Technology Reduced Hessian Sequential Quadratic Programming(SQP)
Advertisements

Optimality conditions for constrained local optima, Lagrange multipliers and their use for sensitivity of optimal solutions.
Engineering Optimization
Support Vector Machines Instructor Max Welling ICS273A UCIrvine.
Point-wise Discretization Errors in Boundary Element Method for Elasticity Problem Bart F. Zalewski Case Western Reserve University Robert L. Mullen Case.
1 TTK4135 Optimization and control B.Foss Spring semester 2005 TTK4135 Optimization and control Spring semester 2005 Scope - this you shall learn Optimization.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
by Rianto Adhy Sasongko Supervisor: Dr.J.C.Allwright
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Optimality conditions for constrained local optima, Lagrange multipliers and their use for sensitivity of optimal solutions Today’s lecture is on optimality.
Separating Hyperplanes
LECTURE SERIES on STRUCTURAL OPTIMIZATION Thanh X. Nguyen Structural Mechanics Division National University of Civil Engineering
July 11, 2006 Comparison of Exact and Approximate Adjoint for Aerodynamic Shape Optimization ICCFD 4 July 10-14, 2006, Ghent Giampietro Carpentieri and.
Slide 4f.1 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Lecture.
Visual Recognition Tutorial
1 Logic-Based Methods for Global Optimization J. N. Hooker Carnegie Mellon University, USA November 2003.
Engineering Optimization – Concepts and Applications Engineering Optimization Concepts and Applications WB 1440 ? F Fred van Keulen Matthijs Langelaar.
Nonlinear Optimization for Optimal Control
MAE 552 – Heuristic Optimization Lecture 6 February 6, 2002.
Linear Regression  Using a linear function to interpolate the training set  The most popular criterion: Least squares approach  Given the training set:
The Widrow-Hoff Algorithm (Primal Form) Repeat: Until convergence criterion satisfied return: Given a training set and learning rate Initial:  Minimize.
The Perceptron Algorithm (Dual Form) Given a linearly separable training setand Repeat: until no mistakes made within the for loop return:
Reformulated - SVR as a Constrained Minimization Problem subject to n+1+2m variables and 2m constrains minimization problem Enlarge the problem size and.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley Asynchronous Distributed Algorithm Proof.
Lecture 10: Support Vector Machines
Interval-based Inverse Problems with Uncertainties Francesco Fedele 1,2 and Rafi L. Muhanna 1 1 School of Civil and Environmental Engineering 2 School.
Slide 3.1 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Lecture.
Slide 4a.1 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Your.
SVM by Sequential Minimal Optimization (SMO)
1 Chapter 8 Nonlinear Programming with Constraints.
84 b Unidimensional Search Methods Most algorithms for unconstrained and constrained optimisation use an efficient unidimensional optimisation technique.
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
Optimization of Process Flowsheets S,S&L Chapter 24 T&S Chapter 12 Terry A. Ring CHEN 5253.
ME451 Kinematics and Dynamics of Machine Systems Dynamics of Planar Systems December 1, 2011 Solving Index 3 DAEs using Newmark Method © Dan Negrut, 2011.
Stochastic Linear Programming by Series of Monte-Carlo Estimators Leonidas SAKALAUSKAS Institute of Mathematics&Informatics Vilnius, Lithuania
Computational Methods for Design Lecture 4 – Introduction to Sensitivities John A. Burns C enter for O ptimal D esign A nd C ontrol I nterdisciplinary.
Slide 2a.1 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Lecture.
Chapter 3 Roots of Equations. Objectives Understanding what roots problems are and where they occur in engineering and science Knowing how to determine.
Machine Learning Weak 4 Lecture 2. Hand in Data It is online Only around 6000 images!!! Deadline is one week. Next Thursday lecture will be only one hour.
Numerical Methods for Engineering MECN 3500
1 Lagrangean Relaxation --- Bounding through penalty adjustment.
Reliability-Based Design Methods of Structures
Slide 2b.1 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Lecture.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley.
Monte-Carlo method for Two-Stage SLP Lecture 5 Leonidas Sakalauskas Institute of Mathematics and Informatics Vilnius, Lithuania EURO Working Group on Continuous.
1  The Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
The Method of Moving Asymptotes
Exact Differentiable Exterior Penalty for Linear Programming Olvi Mangasarian UW Madison & UCSD La Jolla Edward Wild UW Madison December 20, 2015 TexPoint.
1  Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
Differential equations. Many applications of mathematics involve two variables and a relation between them is required. This relation is often expressed.
Derivatives of static response from linear finite element analysis Local search algorithms benefit from derivatives even when they are calculated by finite.
Non-Linear Programming © 2011 Daniel Kirschen and University of Washington 1.
Lecture 6 - Single Variable Problems & Systems of Equations CVEN 302 June 14, 2002.
Nonlinear Programming In this handout Gradient Search for Multivariable Unconstrained Optimization KKT Conditions for Optimality of Constrained Optimization.
Lecture notes for Stat 231: Pattern Recognition and Machine Learning 1. Stat 231. A.L. Yuille. Fall 2004 Linear Separation and Margins. Non-Separable and.
Ch. Eick: Num. Optimization with GAs Numerical Optimization General Framework: objective function f(x 1,...,x n ) to be minimized or maximized constraints:
14 - finite element method
1 Nonlinear Sub-optimal Mid Course Guidance with Desired Alinement using MPQC P. N. Dwivedi, Dr. A.Bhattacharya, Scientist, DRDO, Hyderabad-,INDIA Dr.
D Nagesh Kumar, IISc Water Resources Systems Planning and Management: M2L2 Introduction to Optimization (ii) Constrained and Unconstrained Optimization.
Tuesday, March 19 The Network Simplex Method for Solving the Minimum Cost Flow Problem Handouts: Lecture Notes Warning: there is a lot to the network.
Computational Fluid Dynamics Lecture II Numerical Methods and Criteria for CFD Dr. Ugur GUVEN Professor of Aerospace Engineering.
Differential Equations
Optimization of Process Flowsheets
Chapter 6. Large Scale Optimization
Structural Optimization Design ( Structural Analysis & Optimization )
Joint Optimization of Multiple Behavioral and Implementation Properties of Digital IIR Filter Designs Magesh Valliappan, Brian L. Evans, and Mohamed Gzara.
Lecture 38 Constrained Optimization
Chapter 6. Large Scale Optimization
Constraints.
Presentation transcript:

Slide 4b.1 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Lecture 4b Highlights of some solution methods Aspects of optimization algorithms used in topology design.

Slide 4b.2 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Contents Components of optimal synthesis Sensitivity analysis Mathematical programming algorithms An optimality criteria method Convex approximation methods

Slide 4b.3 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Optimal synthesis: what it entails Design needs  Objective function  Design variables  Constraints  Equations governing the device behavior A study to ensure the well- posedness of the optimization problem Function evaluation Sensitivity analysis Optimization algorithm Solution Satisfactory? Stop Yes No OPTIMAL SYNTHESIS

Slide 4b.4 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Sensitivity analysis Determining the gradients of the objective and constraint functions with respect to the design variables. Consider and satisfy essential (Dirichlet) boundary conditions. = smoothened state (exists or not) of a point Need to compute: (the body force is assumed to be absent.)

Slide 4b.5 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Sensitivity analysis in discrete modeling: direct method (differentiate w.r.t. ) (assuming that does not depend on ) (needs to be solved for each variable to get )

Slide 4b.6 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Sensitivity analysis in discrete modeling: adjoint method where Needs to be solved for only once! Adjoint equation (if there are constraints dependent on, then needs to be solved for those as well).

Slide 4b.7 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Sequential linear programming (SLP) Linearize Solve the LP problem and repeat until convergence. Works reasonably well, even “black-box” usage of standard packages once the problem if well formulated and understood. Especially suitable when multiple and constraints exist. Somewhat slower rates of convergence.

Slide 4b.8 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Sequential quadratic programming (SQP) “Quadratize” Solve the QP problem and repeat until convergence. Works quite well in conjunction with trust-region method (Matlab’s optimization toolbox has a routine: constr( )

Slide 4b.9 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Return to continuum model: sensitivity analysis

Slide 4b.10 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Adjoint sensitivity analysis for the continuum model Equation of equilibrium recovered from the weak form Adjoint equation (Same conclusion that we saw in slide # 2b.9 in the context of bars)

Slide 4b.11 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Optimality criteria method Adjoint. Equn. Equilib. Equn. Turned out to be the same here but not always true. Design Equn. Optimality criterion

Slide 4b.12 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Optimality criteria method: evaluating the Lagrange multiplier Check if any exceeded their upper or lower limits; if yes, limit them to the bounds. Use: Inner loop at k th iteration Repeat until do not change anymore.

Slide 4b.13 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Convex approximation methods Linearization Reciprocal linearization Convex linearization Replace with Replace with only if the partial derivative with respect to that variable is positive. Advantage: leads to convex, separable problems that can be easily solved using the more efficient dual methods (Lagrange multipliers become the variables).

Slide 4b.14 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Method of moving asymptotes (MMA) Adjustable bounds to get a conservative or accurate convex approximation of the objective and constraint expressions as necessary. K. Svanberg, “The Method of Moving Asymptotes—A New Method for Structural Optimization,” Int. J. for Num. Meth. In Engineering, Vol. 24, 1987, pp

Slide 4b.15 Stiff Structures, Compliant Mechanisms, and MEMS: A short course offered at IISc, Bangalore, India. Aug.-Sep., G. K. Ananthasuresh Main points Function evaluation and sensitivity analysis Optimality criteria method Standard mathematical programming techniques will do (SLP, SQP) Or use convex linearization algorithms such as MMA Posing the problem correctly is crucial; most algorithms would work for properly posed problems