Semismooth Hybrid Systems. Paul I. Barton and Mehmet Yunt Process Systems Engineering Laboratory Massachusetts Institute of Technology

Similar documents
A quasisecant method for minimizing nonsmooth functions

Nonsmooth Dynamic Optimization of Systems with Varying Structure. Mehmet Yunt

ON A CLASS OF NONSMOOTH COMPOSITE FUNCTIONS

Sensitivity Analysis for Nonsmooth Dynamic Systems. Kamil Ahmad Khan

Hybrid Systems - Lecture n. 3 Lyapunov stability

A Continuation Method for the Solution of Monotone Variational Inequality Problems

Algorithms for Nonsmooth Optimization

Limited Memory Bundle Algorithm for Large Bound Constrained Nonsmooth Minimization Problems

Introduction. New Nonsmooth Trust Region Method for Unconstraint Locally Lipschitz Optimization Problems

Marjo Haarala. Large-Scale Nonsmooth Optimization

Hybrid Systems Course Lyapunov stability

ON GAP FUNCTIONS OF VARIATIONAL INEQUALITY IN A BANACH SPACE. Sangho Kum and Gue Myung Lee. 1. Introduction

Comparison of formulations and solution methods for image restoration problems

On Second-order Properties of the Moreau-Yosida Regularization for Constrained Nonsmooth Convex Programs

Lehrstuhl B für Mechanik Technische Universität München D Garching Germany

MS&E 318 (CME 338) Large-Scale Numerical Optimization

A level set method for solving free boundary problems associated with obstacles

On Nesterov s Random Coordinate Descent Algorithms - Continued

On the Inherent Robustness of Suboptimal Model Predictive Control

Lecture 6: September 17

The nonsmooth Newton method on Riemannian manifolds

EE291E Lecture Notes 3 Autonomous Hybrid Automata

LIMITED MEMORY BUNDLE METHOD FOR LARGE BOUND CONSTRAINED NONSMOOTH OPTIMIZATION: CONVERGENCE ANALYSIS

Newton-type Methods for Solving the Nonsmooth Equations with Finitely Many Maximum Functions

Research Article Sufficient Optimality and Sensitivity Analysis of a Parameterized Min-Max Programming

Comparison of Modern Stochastic Optimization Algorithms

Inverse Problems and Optimal Design in Electricity and Magnetism

A second order primal-dual algorithm for nonsmooth convex composite optimization

Introduction. A Modified Steepest Descent Method Based on BFGS Method for Locally Lipschitz Functions. R. Yousefpour 1

ON REGULARITY CONDITIONS FOR COMPLEMENTARITY PROBLEMS

Generalized Derivatives for Solutions of Parametric Ordinary Differential Equations with Non-differentiable Right-Hand Sides

A globally and R-linearly convergent hybrid HS and PRP method and its inexact version with applications

AN INTERIOR-POINT METHOD FOR NONLINEAR OPTIMIZATION PROBLEMS WITH LOCATABLE AND SEPARABLE NONSMOOTHNESS

STABILITY ANALYSIS AND CONTROL DESIGN

LCPI method to find optimal solutions of nonlinear programming problems

Dynamical Systems Revisited: Hybrid Systems with Zeno Executions

University of California. Berkeley, CA fzhangjun johans lygeros Abstract

FIXED POINTS IN THE FAMILY OF CONVEX REPRESENTATIONS OF A MAXIMAL MONOTONE OPERATOR

A COMPARATIVE STUDY ON OPTIMIZATION METHODS FOR THE CONSTRAINED NONLINEAR PROGRAMMING PROBLEMS

APPROXIMATING SUBDIFFERENTIALS BY RANDOM SAMPLING OF GRADIENTS

A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE

Coordinate Update Algorithm Short Course Subgradients and Subgradient Methods

Spectral gradient projection method for solving nonlinear monotone equations

Journal of Convex Analysis (accepted for publication) A HYBRID PROJECTION PROXIMAL POINT ALGORITHM. M. V. Solodov and B. F.

Lecture 19 Algorithms for VIs KKT Conditions-based Ideas. November 16, 2008

Nonsmooth analysis of connected oil well system

Subgradient Method. Ryan Tibshirani Convex Optimization

ALGEBRAIC DEGREE OF POLYNOMIAL OPTIMIZATION. 1. Introduction. f 0 (x)

AN ELECTRIC circuit containing a switch controlled by

Kaisa Joki Adil M. Bagirov Napsu Karmitsa Marko M. Mäkelä. New Proximal Bundle Method for Nonsmooth DC Optimization

LARGE SCALE NONLINEAR OPTIMIZATION

Embedded Systems 5. Synchronous Composition. Lee/Seshia Section 6.2

Strategies for Numerical Integration of Discontinuous DAE Models

Sliding Modes in Control and Optimization

Convergence of Stationary Points of Sample Average Two-Stage Stochastic Programs: A Generalized Equation Approach

PDE-Constrained and Nonsmooth Optimization

Numerical optimization

Affine covariant Semi-smooth Newton in function space

Convergence of a Gauss Pseudospectral Method for Optimal Control

Nonlinear Optimization for Optimal Control

Relationships between upper exhausters and the basic subdifferential in variational analysis

Variational Analysis and Tame Optimization

SOR- and Jacobi-type Iterative Methods for Solving l 1 -l 2 Problems by Way of Fenchel Duality 1

Contents. Preface. 1 Introduction Optimization view on mathematical models NLP models, black-box versus explicit expression 3

One Mirror Descent Algorithm for Convex Constrained Optimization Problems with Non-Standard Growth Properties

Primal-dual Subgradient Method for Convex Problems with Functional Constraints

A FRITZ JOHN APPROACH TO FIRST ORDER OPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS

20 J.-S. CHEN, C.-H. KO AND X.-R. WU. : R 2 R is given by. Recently, the generalized Fischer-Burmeister function ϕ p : R2 R, which includes

Motivation Subgradient Method Stochastic Subgradient Method. Convex Optimization. Lecture 15 - Gradient Descent in Machine Learning

Uniqueness of Generalized Equilibrium for Box Constrained Problems and Applications

Optimality Conditions for Nonsmooth Convex Optimization

4y Springer NONLINEAR INTEGER PROGRAMMING

Multiobjective optimization methods

Lecture 25: November 27

Data Science - Convex optimization and application

On the Inherent Robustness of Suboptimal Model Predictive Control

Stable Adaptive Momentum for Rapid Online Learning in Nonlinear Systems

Subdifferential representation of convex functions: refinements and applications

A Remark on the Regularity of Solutions of Maxwell s Equations on Lipschitz Domains

Global Optimality Conditions in Maximizing a Convex Quadratic Function under Convex Quadratic Constraints

Near-Potential Games: Geometry and Dynamics

A Proximal Method for Identifying Active Manifolds

Systematic Tuning of Nonlinear Power System Controllers

WHEN ARE THE (UN)CONSTRAINED STATIONARY POINTS OF THE IMPLICIT LAGRANGIAN GLOBAL SOLUTIONS?

Accelerated Block-Coordinate Relaxation for Regularized Optimization

Scientific Computing: Optimization

Part 4. Decomposition Algorithms

Subgradient Descent. David S. Rosenberg. New York University. February 7, 2018

Convergence of Simultaneous Perturbation Stochastic Approximation for Nondifferentiable Optimization

system of equations. In particular, we give a complete characterization of the Q-superlinear

Lecture Note 7: Switching Stabilization via Control-Lyapunov Function

Numerical Optimization Professor Horst Cerjak, Horst Bischof, Thomas Pock Mat Vis-Gra SS09

Numerical Modeling of Methane Hydrate Evolution

1. f(β) 0 (that is, β is a feasible point for the constraints)

6. Multiple Reactions

Ville-Pekka Eronen Marko M. Mäkelä Tapio Westerlund. Nonsmooth Extended Cutting Plane Method for Generally Convex MINLP Problems

A derivative-free nonmonotone line search and its application to the spectral residual method

McMaster University. Advanced Optimization Laboratory. Title: A Proximal Method for Identifying Active Manifolds. Authors: Warren L.

A convergence result for an Outer Approximation Scheme

Hybrid Routhian Reduction of Lagrangian Hybrid Systems

Transcription:

Semismooth Hybrid Systems Paul I. Barton and Mehmet Yunt Process Systems Engineering Laboratory Massachusetts Institute of Technology

Continuous Time Hybrid Automaton (deterministic) 4/21

Hybrid Automaton Epoch and Mode Sequences Epoch 1 Mode 1 Mode 2 Epoch 3 Epoch 2

Control Parameterization

Jacobian http://numericatech.com

Nonsmoothness Example 6/21

Nonsmoothness Example

Discontinuous Example

Discontinuous Example

Classification of Optimization Problems with Hybrid Systems Embedded Mode sequence does not vary - usually smooth multi-stage dynamic optimization Semismooth hybrid systems nonsmooth, mode sequence can vary Continuous but not semismooth hybrid systems Discontinuous hybrid systems

Nonsmooth Analysis Locally Lipschitz Continuous Functions

Nonsmooth Analysis: Generalized Gradient Differentiable functions gradients Convex functions subdifferentials Locally Lipschitz continuous functions generalized gradient* *F. H. Clarke, Optimization and Nonsmooth Analysis, Classics in Applied Mathematics 5, SIAM, 1990

Nonsmooth Analysis: Calculation of the Generalized Gradient

Nonsmooth Analysis: Optimization using Generalized Gradients

Nonsmooth Analysis: Descent Direction Main issue: the whole generalized gradient usually cannot be calculated.

Nonsmooth Optimization: Bundle Methods 1,2 Question: How do we obtain a direction of descent given only an element of the generalized gradient and the objective value at x? Answer: Keep a set of auxiliary points close to x called the bundle. Create a piecewise linear approximation of the generalized directional derivative at x using the bundle and improve the approximation if necessary. Calculate an approximation to the generalized gradient using the piecewise linear approximation. Calculate a direction of descent for the piecewise linear approximation Update the bundle as necessary. Bundle methods require the existence of the directional derivative with certain continuity properties w.r.t. to the direction (semismoothness) for convergence 3. 1. Nonsmooth Optimization, Analysis and Algorithms and Applications to Optimal Control, Marko Makela and Pekka Neittaanmaki, World Scientific, Singapore, 1992. 2. Krzysztof C. Kiwiel, Methods of Descent for Nondifferentiable Optimization, Lecture Notes in Mathematics, no. 1133, Springer-Verlag, Berlin, 1985. 3. R. Mifflin, Semismooth and Semiconvex Functions in Constrained Optimization, SIAM Journal of Control and Optimization, vol. 15, no. 6, pp. 959-972, November 1977.

Semismooth Hybrid Systems Under which assumptions are the states of the hybrid system semismooth mappings of the parameters and time? Two distinct classes: Class A: Continuous Vector Field Across Transitions Class B: Discontinuous Vector Field Across Transitions

Semismooth Hybrid Systems: Class A Class A Semismooth Hybrid Systems: Reset functions are identities All functions are continuously differentiable w.r.t. parameters and states A single continuous vector field can be constructed on the product space of states and parameters irrespective of modes The dynamics do not explicitly depend on time Transitions have a reversible nature. Transitions depend on parameters and states As a consequence, the states are locally Lipschitz continuous and semismooth functions with respect to the parameters

Class A Semismooth Hybrid Systems Tumor Chemotherapy Example 1 This hybrid system satisfies the conditions to be a class A semismooth hybrid system 1. Model modified from J. C. Panetta & J. Adam, A mathematical model of cycle-specific chemotherapy. Mathematical and Computer Modeling, 22, 67-82, 1995

Class A Semismooth Hybrid Systems Flux Balance Analysis Models I R4 R1 R3 X Y Z R2 R5 Metabolism Chemical Reactions Internal External R1 X Y R4 X R2 Y X R5 -Z R3 Y Z R1 R2 R3 R4 R5 X -1 1 0 1 0 Y 1-1 -1 0 0 Z 0 0 1 0-1 Stoichiometry Matrix, A

Class A Semismooth Hybrid Systems Flux Balance Analysis Models II Reactions inside the organism occur at a very fast time scale: quasi steady-state approximation Steady-state does not determine all fluxes uniquely The metabolism can be formulated as a linear program where the metabolism is assumed to optimize an objective (e.g., growth of biomass) The linear program is solved to determine the fluxes

Class A Semismooth Hybrid Systems Flux Balance Analysis Models III The dynamics of the mass of external chemical species and reaction volume are:

Class A Semismooth Hybrid Systems Flux Balance Analysis Models IV Flux Balance Models can be analyzed as hybrid systems The discrete state is determined by the embedded linear program Substitute with equivalent KKT conditions to yield a complementarity system The solution of the linear program is determined by a selection of columns of the stoichiometry matrix Each selection represents a potential discrete state There are exponentially many discrete states, hence mixed-integer reformulations are not practical

Semismooth Hybrid Systems: Class A Flux Balance Analysis Models V v and b are locally Lipschitz continuous functions of their bounds. States are locally Lipschitz continuous and semismooth functions of the parameters and time. Assumptions The linear program has always a unique solution for the elements of v and b of interest, f, v L, v U, b L, b U are continuously differentiable functions of their arguments.

Class A Semismooth Hybrid Systems Flux Balance Analysis Models VI: S. Cerevisiae

Class A Semismooth Hybrid Systems Flux Balance Analysis Models VII: S. Cerevisiae* Ethanol membrane exchange rate and biomass production rate as functions of the glucose and oxygen membrane exchange bounds * FBA model courtesy of Jared Hjersted and Professor Michael A. Henson, University of Massachusetts, Amherst

Class A Semismooth Hybrid Systems Flux Balance Analysis Models VIII: S. Cerevisiae The biomass and ethanol concentrations after 1 hour for different feed rates and oxygen concentrations.

Class B Semismooth Hybrid Systems Restrictions on the structure of the hybrid system A subset of the states which have identity resets across all transitions is considered in objective function and constraints All functions are continuously differentiable w.r.t. parameters and states The vector fields may be discontinuous across transitions The initial discrete state is not a function of the parameters and initial continuous state cannot trigger an event at the initial time Events occur when the evolution of the continuous state reaches non-intersecting smooth surfaces in the state space Intersection of these surfaces is only allowed if all intersecting surfaces correspond to transitions to the same mode

Class B Semismooth Hybrid Systems Restrictions on the execution of the hybrid system No Zeno or deadlock phenomena Transversality condition: when the continuous evolution reaches an event triggering surface, it does so non-tangentially to the surface

Class B Semismooth Hybrid Systems Flux Balance Analysis Models IX A change in the stoichiometry matrix or the objective for a FBA model can also be analyzed in the framework of hybrid systems Local Lipschitz continuity and semismoothness can be recovered if the transitions and events satisfy conditions for class B systems

Class B Semismooth Hybrid Systems Diver Example I

Semismooth Hybrid Systems: Class B: Diver Example II

Semismooth Hybrid Systems: Class B: Diver Example III The constraint is nonsmooth. The hybrid system has discontinuous vector fields. There are resetting states. The transitions are not reversible

Semismooth Hybrid System: Calculation of an Element of the Generalized Gradient Under the assumptions for semismooth hybrid systems, the following formula is used to calculate an element of the generalized gradient: One of the limits can exactly be calculated with the algorithms used to calculate parametric sensitivities in case the discrete state trajectory is constant I. I. S. Galán, W. F. Feehery, P. I. Barton, "Parametric Sensitivity Functions for Hybrid Discrete/Continuous Systems", Applied Numerical Mathematics, 31(1):17-48, (1999)

Semismooth Hybrid Systems: Optimization Once an element of the generalized gradient is obtained, a direct method can be used for optimization

Optimization Tumor Chemotherapy Example II The hybrid system satisfies the conditions to be a class A semismooth hybrid system

Optimization Tumor Chemotherapy Example III The optimal drug profile for a thirty day treatment is determined using control vector parameterization. The aim is to minimize the number of tumor cells (Q + P) subject to the constraint that the healthy cell population is above a certain number at the end of thirty days. min P( i, p, t ) + Q( i, p, t ) p f st. : Y( i, p, t ) 1 10 p = f f 30 j j { u, u :1, 2,...,30} A t = B j 0 u 20.0 A j 0 u 20.0 B f 6

Optimization Tumor Chemotherapy Example IV Exact penalty is used with a freely available bundle solver I. Multi-start is needed due to nonconvexity of the optimization problem. I. Ladislav Lukšan, Jan Vlček, Algorithm 811: NDA: algorithms for nondifferentiable optimization, ACM Transactions on Mathematical Software, 27(2) :193-213, (2001)

Optimization Tumor Chemotherapy Example IV Tumor Cell Population and Healthy Cell Population Evolution P +Q Y Initial 1.0e12 1.0e9 Final 1.8e10 1.0e6

Optimization Tumor Chemotherapy Example VI Drug A concentration and doses Drug B concentration and doses

Optimization Drug doses were obtained in case drug resistance is ignored. Smooth problem solved with SNOPT using multi-start. Doses applied to the original model. P +Q Y Initial 1.0e12 1.0e9 Final (Original) Final (Smooth) 1.8e10 3.9e10 1.0e6 1.0e6

Conclusions Finding the optimal mode sequence is a fundamental challenge in the optimization of hybrid systems Broad class of semismooth hybrid systems for which nonsmooth optimization can find optimal mode sequences Mixed-integer formulations also possible Global mixed-integer dynamic optimization

Future Work Exploit structure of semismooth hybrid automata in nonsmooth optimization methods Methods for nonsemismooth and discontinuous hybrid automata?

THE END

Another Simple Example I

Another Simple Example II Analysis of the nonsmoothness requires some mathematics: Nonsmooth Analysis.

Semismooth Hybrid Systems: Class A: Valves Q is the flow across the valve, pressures P in and P out are the states of the system, valve opening, u, is the parameter. Slight reformulation is necessary to make the equations continuously differentiable at zero pressure difference due to the square root.

Semismooth Hybrid Systems: Class A: Models with Friction Certain models with friction are of class A. The friction force is a continuously differentiable function of the states and parameters.