Bounded Nonlinear Optimization to Fit a Model of Acoustic Foams

Slides:



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

Instabilities of SVD Small eigenvalues -> m+ sensitive to small amounts of noise Small eigenvalues maybe indistinguishable from 0 Possible to remove small.
Optimality conditions for constrained local optima, Lagrange multipliers and their use for sensitivity of optimal solutions.
Survey of gradient based constrained optimization algorithms Select algorithms based on their popularity. Additional details and additional algorithms.
Optimization with Constraints
Nonlinear Programming McCarl and Spreen Chapter 12.
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Engineering Optimization
Control Structure Selection for a Methanol Plant using Hysys/Unisim
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Optimality conditions for constrained local optima, Lagrange multipliers and their use for sensitivity of optimal solutions Today’s lecture is on optimality.
Inexact SQP Methods for Equality Constrained Optimization Frank Edward Curtis Department of IE/MS, Northwestern University with Richard Byrd and Jorge.
Numerical Optimization
Motion Analysis (contd.) Slides are from RPI Registration Class.
Methods For Nonlinear Least-Square Problems
1 Chapter 8: Linearization Methods for Constrained Problems Book Review Presented by Kartik Pandit July 23, 2010 ENGINEERING OPTIMIZATION Methods and Applications.
Constrained Optimization Rong Jin. Outline  Equality constraints  Inequality constraints  Linear Programming  Quadratic Programming.
Optimization Methods One-Dimensional Unconstrained Optimization
Unconstrained Optimization Problem
CS Pattern Recognition Review of Prerequisites in Math and Statistics Prepared by Li Yang Based on Appendix chapters of Pattern Recognition, 4.
Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.
Lecture 10: Support Vector Machines
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
An Introduction to Optimization Theory. Outline Introduction Unconstrained optimization problem Constrained optimization problem.
Constrained Optimization Rong Jin. Outline  Equality constraints  Inequality constraints  Linear Programming  Quadratic Programming.
Optimization Methods One-Dimensional Unconstrained Optimization
Ch. 9: Direction Generation Method Based on Linearization Generalized Reduced Gradient Method Mohammad Farhan Habib NetLab, CS, UC Davis July 30, 2010.
Non-Linear Simultaneous Equations
MATH 685/ CSI 700/ OR 682 Lecture Notes Lecture 9. Optimization problems.
1 Hybrid methods for solving large-scale parameter estimation problems Carlos A. Quintero 1 Miguel Argáez 1 Hector Klie 2 Leticia Velázquez 1 Mary Wheeler.
1 Chapter 8 Nonlinear Programming with Constraints.
Frank Edward Curtis Northwestern University Joint work with Richard Byrd and Jorge Nocedal February 12, 2007 Inexact Methods for PDE-Constrained Optimization.
ENCI 303 Lecture PS-19 Optimization 2
1 Introduction to Linear and Nonlinear Programming.
Nonlinear Programming.  A nonlinear program (NLP) is similar to a linear program in that it is composed of an objective function, general constraints,
MA/CS 375 Fall MA/CS 375 Fall 2002 Lecture 31.
Survey of gradient based constrained optimization algorithms Select algorithms based on their popularity. Additional details and additional algorithms.
Remarks: 1.When Newton’s method is implemented has second order information while Gauss-Newton use only first order information. 2.The only differences.
CS Statistical Machine learning Lecture 18 Yuan (Alan) Qi Purdue CS Oct
Frank Edward Curtis Northwestern University Joint work with Richard Byrd and Jorge Nocedal January 31, 2007 Inexact Methods for PDE-Constrained Optimization.
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Optimization & Constraints Add mention of global techiques Add mention of calculus.
Computational Intelligence: Methods and Applications Lecture 23 Logistic discrimination and support vectors Włodzisław Duch Dept. of Informatics, UMK Google:
L8 Optimal Design concepts pt D
A comparison between PROC NLP and PROC OPTMODEL Optimization Algorithm Chin Hwa Tan December 3, 2008.
1  The Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
1  Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
Inexact SQP methods for equality constrained optimization Frank Edward Curtis Department of IE/MS, Northwestern University with Richard Byrd and Jorge.
3 Components for a Spreadsheet Optimization Problem  There is one cell which can be identified as the Target or Set Cell, the single objective of the.
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.
Tutorial 2, Part 2: Calibration of a damped oscillator.
Regularized Least-Squares and Convex Optimization.
Constrained Optimization by the  Constrained Differential Evolution with an Archive and Gradient-Based Mutation Tetsuyuki TAKAHAMA ( Hiroshima City University.
Optimal Control.
Excel’s Solver Use Excel’s Solver as a tool to assist the decision maker in identifying the optimal solution for a business decision. Business decisions.
Solver & Optimization Problems
Computational Optimization
Boosting and Additive Trees (2)
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
CS5321 Numerical Optimization
CS5321 Numerical Optimization
Ying shen Sse, tongji university Sep. 2016
CS5321 Numerical Optimization
Optimization Methods TexPoint fonts used in EMF.
CS5321 Numerical Optimization
Computer Animation Algorithms and Techniques
CS5321 Numerical Optimization
CS5321 Numerical Optimization
Constraints.
Presentation transcript:

Bounded Nonlinear Optimization to Fit a Model of Acoustic Foams Andrew Willemsen Yinan Zuo 4/27/2011

Outline Problem Background Cost Function and Constraints Frequency Range Considerations Description of Optimization Algorithms Active Set SQP Interior Point Trust Region Reflective Results of Model Parameter Optimization Initial Conditions and Global vs. Local Minimas Comparison of Algorithms Conclusions References Nonlinear Optimization of Foam Model 4/27/2011

Problem Background The amount of dissipation of acoustic energy provided by a porous material is commonly modeled based upon 5 physical properties of the foam. Model is complex valued and frequency dependent 5 model parameters are real valued and independent of frequency These five model parameters are difficult to measure, while the resulting acoustic properties are relatively easy to measure. Thus, optimization strategies are used to estimate the model parameters by minimizing the difference between predicted and measured acoustic properties. Nonlinear Optimization of Foam Model 4/27/2011

Cost Function Sum of squares of model-measurement differences for many frequencies: Nonlinear Optimization of Foam Model 4/27/2011

Bound Constraints Each of the 5 model parameters is bounded: Nonlinear Optimization of Foam Model 4/27/2011

Frequency Range Considerations Although the model parameters are constant at all frequencies, the dependence of the model on these parameters changes as a function of frequency. Can result in scaling issues and poor parameter estimates. Choosing the correct frequency range over which to optimize the function is crucial to accurate parameter estimation. Ideally, all parameters would equally effect the value of the model. In reality, the parameters can be grouped into primary effects, secondary effect, and non-effects depending on frequency Nonlinear Optimization of Foam Model 4/27/2011

Frequency Range Considerations Relevant frequency range can be broken into 3 zones: Nonlinear Optimization of Foam Model 4/27/2011

Primary Influences At all frequencies, x1 has the most influence on the value of the model. In Zone 2, x2 has a comparable influence on the value of the model. Nonlinear Optimization of Foam Model 4/27/2011

Secondary Influences At all frequencies, x3 has a secondary influence on the value of the model. In Zone 1, x2 and x5 also have a secondary influence. In Zone 2 and 3, x2 and x4 also have a secondary influence. Nonlinear Optimization of Foam Model 4/27/2011

Selection of Best Frequency Range It was determined that using Zones 1 and 2 together would be best for the model optimization. All parameters have at least a secondary influence on the model value over some part of this frequency range. The measured values peak in this range, so less influence from measurement noise. Nonlinear Optimization of Foam Model 4/27/2011

Active Set Definition: is active if and is inactive if Lagrange function: Algorithm: While the solution is not good enough 1. Solve the equality problem defined by the active set 2.Compute the Lagrange multipliers of the active set 3. Remove the constraints with negative Lagrange multipliers 4. Search for infeasible constraints End Nonlinear Optimization of Foam Model 4/27/2011

Sequential Quadratic Programming An iterative method. Requirement for the problem: Twice continuous differentiability of the function and continuous differentiability of the constraints. The problem is solved by solving a sequence of subproblems, the search direction at each iterate is defined by subject to where Nonlinear Optimization of Foam Model 4/27/2011

Interior Point Method Implemented by Matlab’s fmincon function for constrained minimization. Barrier function (μ > 0) used to redefine problem as: The inequality constraints are made equality constraints by the use of of vector of slack variables s ≥ 0. Nonlinear Optimization of Foam Model 4/27/2011

Interior Point Method The algorithm uses two types of subproblem solvers to compute the step at each iteration. Direct Step – KKT system solver (H positive definite) Conjugate Gradient Step – Trust-region (H indefinite) subject to linearized constraints and the trust region size Nonlinear Optimization of Foam Model 4/27/2011

Nonlinear Least Squares Methods The cost function is instead a vector-valued function and the problem is of the form: The Newton direction for this problem becomes: J is the Jacobian of the vector-valued function f. Implemented in Matlab by lsqnonlin. Nonlinear Optimization of Foam Model 4/27/2011

Trust Region Reflective Method Implemented by the lsqnonlin function in Matlab for bound constrained problems Modification of trust-region approach to unconstrained problem. Scaled modified Newton step: Reflections modify steps crossing any bounds: Nonlinear Optimization of Foam Model 4/27/2011

Global and Local Minima and Initial Point Nonlinear Optimization of Foam Model 4/27/2011

Global and Local Minima and Initial Point – Active Set Nonlinear Optimization of Foam Model 4/27/2011

Global and Local Minima and Initial Point – SQP Nonlinear Optimization of Foam Model 4/27/2011

Global and Local Minima and Initial Point – Interior Point Nonlinear Optimization of Foam Model 4/27/2011

Global and Local Minima and Initial Point – Least Squares Nonlinear Optimization of Foam Model 4/27/2011

Comparison of Algorithms Each of the three fmincon algorithms and the one lsqnonlin algorithm were used to optimize the cost function using the same initial point. The primary stopping conditions for all algorithms were the first order optimality conditions, although by default not all algorithms used this stopping condition. Nonlinear Optimization of Foam Model 4/27/2011

Comparison of Algorithms Function Value Parameter Values Iterations First Order Optimality Function Evaluations Active Set 33.4230 [46088, 0.8436, 4, 5.8401, 1] 31 7.8883E-03 191 SQP 36 2.8610E-06 231 Interior Point 33.4234 [46087, 0.8436, 3.9999, 5.8406, 0.9995] 40 2.0000E-06 253 Trust-Region Reflective 33.4254 [46262, 0.8432, 4, 5.8162, 1] 73 5.3090E-01 444 Nonlinear Optimization of Foam Model 4/27/2011

Active Set Method Convergence Nonlinear Optimization of Foam Model 4/27/2011

SQP Method Convergence Nonlinear Optimization of Foam Model 4/27/2011

Interior Point Method Convergence Nonlinear Optimization of Foam Model 4/27/2011

Trust-Region Reflective Method Convergence Nonlinear Optimization of Foam Model 4/27/2011

Conclusions An effective means to estimate the properties of an acoustic foam is to optimize the acoustic material model. Zone 1 and 2 is the best frequency range to optimize over since all parameters contribute significantly to the model value in this range. Final solution depends on initial conditions If x1 is within a certain range, global minimization guaranteed For this size and type of problem: Active set method was the fastest/most efficient Least squares (trust region reflective method) was the least efficient and least accurate SQP and Interior Point methods resulted in the most accurate minimums and were nearly as efficient as active set. Nonlinear Optimization of Foam Model 4/27/2011

References Y. Atalla and R. Panneton, “Inverse acoustical characterization of open cell porous media using impedance tube measurements”, Canadian Acoustics, 33(1), (2005). J. Nocedal and S. J. Wright, Numerical Optimization, Springer, New York, (2006). T. F. Coleman and Y. Li, “An interior trust region approach for nonlinear minimization subject to bounds”, SIAM J. Optimization, 6(2), 418-445, (1996). Matlab Documentation, “Constrained Nonlinear Optimization Algorithms”, http://www.mathworks.com/help/toolbox/optim/ug/brnoxzl.html, (2011). Matlab Documentation, “Least Squares (Model Fitting) Algorithms”, http://www.mathworks.com/help/toolbox/optim/ug/brnoybu.html, (2011). Nonlinear Optimization of Foam Model 4/27/2011