Remarks: 1.When Newton’s method is implemented has second order information while Gauss-Newton use only first order information. 2.The only differences.

Slides:



Advertisements
Similar presentations
QoS-based Management of Multiple Shared Resources in Dynamic Real-Time Systems Klaus Ecker, Frank Drews School of EECS, Ohio University, Athens, OH {ecker,
Advertisements

Introduction An important research activity in the area of global optimization is to determine an effective strategy for solving least squares problems.
Engineering Optimization
CHAPTER 8 More About Estimation. 8.1 Bayesian Estimation In this chapter we introduce the concepts related to estimation and begin this by considering.
Lena Gorelick Joint work with Frank Schmidt and Yuri Boykov Rochester Institute of Technology, Center of Imaging Science January 2013 TexPoint fonts used.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2014 – 35148: Continuous Solution for Boundary Value Problems.
Exact or stable image\signal reconstruction from incomplete information Project guide: Dr. Pradeep Sen UNM (Abq) Submitted by: Nitesh Agarwal IIT Roorkee.
Optimality conditions for constrained local optima, Lagrange multipliers and their use for sensitivity of optimal solutions Today’s lecture is on optimality.
Separating Hyperplanes
Inexact SQP Methods for Equality Constrained Optimization Frank Edward Curtis Department of IE/MS, Northwestern University with Richard Byrd and Jorge.
Session: Computational Wave Propagation: Basic Theory Igel H., Fichtner A., Käser M., Virieux J., Seriani G., Capdeville Y., Moczo P.  The finite-difference.
1 Applications on Signal Recovering Miguel Argáez Carlos A. Quintero Computational Science Program El Paso, Texas, USA April 16, 2009.
Paula Gonzalez 1, Leticia Velazquez 1,2, Miguel Argaez 1,2, Carlos Castillo-Chávez 3, Eli Fenichel 4 1 Computational Science Program, University of Texas.
Visual Recognition Tutorial
Lecture 5 A Priori Information and Weighted Least Squared.
280 SYSTEM IDENTIFICATION The System Identification Problem is to estimate a model of a system based on input-output data. Basic Configuration continuous.
Numerical Optimization
Finite Element Method Introduction General Principle
Engineering Optimization
Chapter 10: Iterative Improvement
Efficient Methodologies for Reliability Based Design Optimization
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Nonlinear Filtering of Stochastic Volatility Aleksandar Zatezalo, University of Rijeka, Faculty of Philosophy in Rijeka, Rijeka, Croatia
Maximum likelihood (ML)
III Solution of pde’s using variational principles
Interval-based Inverse Problems with Uncertainties Francesco Fedele 1,2 and Rafi L. Muhanna 1 1 School of Civil and Environmental Engineering 2 School.
Simultaneous inversion of seabed and water column sound speed profiles in range-dependent shallow-water environments Megan S. Ballard and Kyle M. Becker.
Finite Differences Finite Difference Approximations  Simple geophysical partial differential equations  Finite differences - definitions  Finite-difference.
NEESR-SG: High-Fidelity Site Characterization by Experimentation, Field Observation, and Inversion-Based Modeling Dominic Assimaki 2 (Co-PI), Jacobo Bielak.
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.
Chapter 17 Boundary Value Problems. Standard Form of Two-Point Boundary Value Problem In total, there are n 1 +n 2 =N boundary conditions.
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
Combined Central and Subspace Clustering for Computer Vision Applications Le Lu 1 René Vidal 2 1 Computer Science Department, Johns Hopkins University,
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Deterministic vs. Random Maximum A Posteriori Maximum Likelihood Minimum.
Linear Programming Chapter 6. Large Scale Optimization.
Strategies for Solving Large-Scale Optimization Problems Judith Hill Sandia National Laboratories October 23, 2007 Modeling and High-Performance Computing.
Frank Edward Curtis Northwestern University Joint work with Richard Byrd and Jorge Nocedal January 31, 2007 Inexact Methods for PDE-Constrained Optimization.
An Optimization Method on Joint Inversion of Different Types of Seismic Data M. Argaez¹, R. Romero 3, A. Sosa¹, L. Thompson² L. Velazquez¹, A. Velasco².
MULTI-DISCIPLINARY INVERSE DESIGN George S. Dulikravich Dept. of Mechanical and Aerospace Eng. The University of Texas at Arlington
Computational Intelligence: Methods and Applications Lecture 23 Logistic discrimination and support vectors Włodzisław Duch Dept. of Informatics, UMK Google:
Solution of a Partial Differential Equations using the Method of Lines
Xianwu Ling Russell Keanini Harish Cherukuri Department of Mechanical Engineering University of North Carolina at Charlotte Presented at the 2003 IPES.
A Passive Approach to Sensor Network Localization Rahul Biswas and Sebastian Thrun International Conference on Intelligent Robots and Systems 2004 Presented.
Akram Bitar and Larry Manevitz Department of Computer Science
On implicit-factorization block preconditioners Sue Dollar 1,2, Nick Gould 3, Wil Schilders 2,4 and Andy Wathen 1 1 Oxford University Computing Laboratory,
Institute of Biophysics and Biomedical Engineering - Bulgarian Academy of Sciences OLYMPIA ROEVA 105 Acad. George Bonchev Str Sofia, Bulgaria
1  The Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
Exact Differentiable Exterior Penalty for Linear Programming Olvi Mangasarian UW Madison & UCSD La Jolla Edward Wild UW Madison December 20, 2015 TexPoint.
Chapter 4 Sensitivity Analysis, Duality and Interior Point Methods.
On Optimization Techniques for the One-Dimensional Seismic Problem M. Argaez¹ J. Gomez¹ J. Islas¹ V. Kreinovich³ C. Quintero ¹ L. Salayandia³ M.C. Villamarin¹.
We have recently implemented a microwave imaging algorithm which incorporated scalar 3D wave propagation while reconstructing a 2D dielectric property.
Inexact SQP methods for equality constrained optimization Frank Edward Curtis Department of IE/MS, Northwestern University with Richard Byrd and Jorge.
Model Fusion and its Use in Earth Sciences R. Romero, O. Ochoa, A. A. Velasco, and V. Kreinovich Joint Annual Meeting NSF Division of Human Resource Development.
Non-Linear Programming © 2011 Daniel Kirschen and University of Washington 1.
Optimization in Engineering Design 1 Introduction to Non-Linear Optimization.
Lecture Fall 2001 Controlling Animation Boundary-Value Problems Shooting Methods Constrained Optimization Robot Control.
Linear Programming Chapter 9. Interior Point Methods  Three major variants  Affine scaling algorithm - easy concept, good performance  Potential.
A Hybrid Optimization Approach for Automated Parameter Estimation Problems Carlos A. Quintero 1 Miguel Argáez 1, Hector Klie 2, Leticia Velázquez 1 and.
A Hybrid Optimization Approach for Automated Parameter Estimation Problems Carlos A. Quintero 1 Miguel Argáez 1, Hector Klie 2, Leticia Velázquez 1 and.
Bounded Nonlinear Optimization to Fit a Model of Acoustic Foams
Fang Liu and Arthur Weglein Houston, Texas May 12th, 2006
On Optimization Techniques for the One-Dimensional Seismic Problem
FTCS Explicit Finite Difference Method for Evaluating European Options
Hidden Markov Models Part 2: Algorithms
Energy Resources Engineering Department Stanford University, CA, USA
CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4: KFUPM CISE301_Topic1.
Akram Bitar and Larry Manevitz Department of Computer Science
Presentation transcript:

Remarks: 1.When Newton’s method is implemented has second order information while Gauss-Newton use only first order information. 2.The only differences between the systems (6) and (7) are the terms C and B that depend only on the choice of the method LB or IPM. 3. does not change when either method is implemented Step 1 Select a method j=LB or IPM. Choose an initial point and according to the method selected. Step 2 For k=0,1,2,… until Step 3 Choose according to the method selected Step 4 Solve (7) for step and calculate Step 5 (Force positivity) Calculate according to the method selected Step 6 (Sufficient decrease) Find where t is the smallest nonnegative integer such that satisfies Step 7 (Update) Set Step 8 Return to Step 2 Where Numerical Comparison of PDE Constrained Optimization Schemes for Solving Earthquake Modeling Problems L. Velazquez¹, C. Burstede ², A.A. Sosa ¹, M. Argaez¹, O. Ghattas ² ¹ Computational Science Program, The University of Texas at El Paso (UTEP) ²Center for Computational Geosciences and Optimization, The University of Texas at Austin (UTA) Summary We are implementing a Primal-Dual Interior-Point method to solve an inverse seismic wave problem. We compare the numerical behavior of the logarithmic barrier (LB), primal-dual interior-point (IPM), projected conjugate gradient (PRCG), and primal-dual active sets (PDAS) methods for solving one-dimensional partial differential equations (PDE) constrained optimization problems arising on earthquake applications. Our main interest is to identify an effective strategy that allows to incorporate efficiently physical bound constraints into the problem. We run several test cases and identify that the strategy IPM works best. The problem that we present here needs from the expertise of researchers from different areas (geologists, engineers, computational scientists) to develop the capability for estimating the geological structure and mechanical properties of the earth structure. Our contribution comes to help in the development of a new optimization approach to the new inversion methods based on PDE’s. The forward problem is based on the elastic wave equation for displacement (state), shear-modulus, and force subject to additional boundary conditions: Contact Information Uram A. Sosa, Graduate Student Computational Science Program This work is being funded by NSF Grants NEESR-SG CMMI and Crest Cyber-ShARE HRD Acknowledgements References 1.Numerical Comparison of Constrained PDEs Optimization Schemes for Solving Earthquake Modeling Problems. L. Velazquez, C. Burstede, A.A. Sosa, M. Argaez, and O. Ghattas, Technical Report. 2.Numerical Optimization. J. Nocedal, and S. J. Wright,. 3.An Introduction to Seismology Earthquakes and Earth Structure, S. Stein and M. Wysession, Blackwell Publishing,, 2006 Logarithmic Barrier Method Then the space-time discretized inverse PDE constrained problem is: Where and are the physical bounds. The regularization term varies depending on the method chosen. We can select Tikhonov regularization or Total Variation regularization We solve problem (2) through a sequence of log-barrier sub-problems as parameter goes to zero. The lagrangian function associated to (3) is Seismic Wave Propagation Problem Where y is the Lagrange multiplier associated to the equality constraints. Where F is a square nonlinear function, We can reduce the nonlinear system (6) in terms of and then solve for Forward and Inverse Modeling At the heart of the site characterization problem using active (or passive) dynamic sources lies an inverse wave-based problem. Inverse problems are notoriously more difficult than the corresponding forward wave propagation problems. In the forward problem, one wishes to determine the soil response due to a prescribed excitation under the assumption that the source and the material properties are known. By contrast, in the inverse problem one wants to estimate the spatial distribution of the soil properties that results in a predicted response that most closely matches the observed records generated by either an active source or a seismic signal. The forward problems are, thus, but a mere “inner iteration” of the inverse problem, which entails multiple forward wave propagation simulations. It is thus important that forward wave simulations are carried out fast and accurately. Where is the Lagrange multiplier associated with the inequality constraints. The methodology is to keep the iterates positive except at the solution of the problem. Primal-Dual Interior-Point Method The lagrangian associated to (2) is: Optimality Conditions Nonlinear System For We apply Newton’s method to (4) or (5), and reduce the system to obtain: Reduced Nonlinear System Algorithm We can solve (7) using Newton’s method where: or we can apply Gauss-Newton’s method having: We use four random initial points for solving two test problems (step, wild) with two different choices of level and grid coarse (6,3) and (7,5), respectively. The numerical results of PRCG and PDAS, and the Matlab code were provided by the UT team. The experimentation shows that Interior-Point Methods, without regularization, to be competitive in terms of robustness, accuracy, and total number of conjugate gradient iterations. Numerical Results