Verification and Control of Safety-Factor Profile in Tokamaks

Size: px
Start display at page:

Download "Verification and Control of Safety-Factor Profile in Tokamaks"

Transcription

1 Verification and Control of Safety-Factor Profile in Tokamaks Aditya Gahlawat, Matthew M. Peet, and Emmanuel Witrant Illinois Institute of Technology Chicago, Illinois International Federation of Automatic Control World Congress Università Cattolica del Sacro Cuore Milan, Italy September, 2

2 Nuclear Fusion A Renewable Energy Source Fusion energy is the potential energy difference between particles in free state and particles bound together by the strong nuclear force. E from the strong nuclear force for the 2 H + 3 H to 4 He + n reaction is 3.5 MeV/nucleon. E from the Coulomb Barrier for the 2 H + 3 H to 4 He + n reaction is +.MeV/nucleon Nuclear Fission of U 235 only releases.85 MeV/nucleon Unfortunately.MeV/nucleon means a temperature of 2 6 K. Temperature at center of sun is K. From Maxwell-Boltzmann distribution, we only need = 6 K for a statistically significant reaction rate A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Introduction 2 / 28

3 Tokamaks Magnetic Confinement of Plasma Magnetic Confinement At high temperature, atoms ionize. Hydrogen 2 H ion + electron. Charged particles oscillate in a uniform magnetic field. But a uniform field must eventually end. Particles will eventually escape. Tokamaks loop the field back on itself. Particles rotate indefinitely. Inertial Confinement Compress the fuel quickly Plasma does not have time to expand spatially before creating additional reactions. Similar to a hydrogen bomb. A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Introduction 3 / 28

4 Magnetic Confinement of Plasma in Tokamaks Poloidal and Toroidal Fields The plasma is contained through the combined action of toroidal and solenoid field coils. The toroidal coils produce a magnetic field, B φ. Field lines are orthogonal to the Z-axis. The solenoid produces a plasma current which produces a poloidal magnetic field, B θ. Field lines in the R Z plane. A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Introduction 4 / 28

5 The Safety-Factor and Safety-Factor Profile A Useful Heuristic The Safety Factor, q is the number toroidal field rotations for every poloidal rotation. Triggers internal transport barriers which increase energy confinement The higher the safety-factor, the better the plasma is contained. The Safety-Factor Profile is the distribution of the safety-factor along an idealized radius. q(x,t) = φ(x,t)/ x ψ(x,t)/ x = B φ a 2 x ψ(x,t)/ x, where x = normalized radius B φ = toroidal magnetic field at the plasma center a = radius of the last closed magnetic surface (LCMS) φ = magnetic flux of the toroidal field ψ = magnetic field of the poloidal field To control q(x,t), we control ψ x (x,t) = ψ(x,t)/ x. A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Introduction 5 / 28

6 The Dynamics of the Poloidal Flux Gradient To Control the Safety-Factor Profile, we regulate ψ x (x,t) = x ψ(x,t). ψ x (x,t) = ( ) η (x,t) t µ a 2 x x x (xψ ( x(x,t)) +R η (x,t)j ni (x,t) ). x where R = magnetic center location µ = permeability of free space η (x,t) = plasma resistivity j ni (x,t) = non-inductive current density with the boundary conditions ψ x (,t) = and ψ x (,t) =. () The dynamics are coupled to electron temperature via Plasma Resistivity, η. Depends on dynamics of temperature, density, etc. Nonlinear coupling Assume a separation of time-scales A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Introduction 6 / 28

7 Dynamical System Representation Lets represent this PDE as an abstract differential system where A and B are the operators ẋ(t) = Ax(t)+Bu(t) (Aψ)(x) := µ a 2 x (Bj ni )(x) := x We ignore the bootstrap current. ( η (x) ( η (x)j eni (x) ) ) x (xψ(x)) This System generates a strongly continuous semigroup on X = L 2 [,] with domain x D A = {y L 2 [,] : y,y x,y xx L 2 [,],y() = y() = }. A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Introduction 7 / 28

8 Linear Operator Inequalities The Lyapunov Inequality For linear dynamical systems, we have the following characterization of stability. Suppose the operator A generates a strongly continuous semigroup on Hilbert space X with domain D A. Theorem. The system ẋ(t) = Ax(t) is stable if and only if there exist a positive operator P L(D A D A ) such that x,(a P +PA)x X < x 2 X for all x D A. Stability is equivalent to a feasibility problem with operator-valued variables linear inequality constraints A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Control of PDEs 8 / 28

9 Linear Operator Inequalities Controlling Linear PDEs The Variable Substitution Trick: Theorem 2. The system ẋ(t) = Ax(t)+Bu(t) is stabilizable via full-state feedback if and only if there exist operators P > and Z such that PA +AP +BZ +Z B < Then K = ZP. Here the inequality PA +AP +BZ +Z B < means for all x = P y, y D A. x,(pa +AP +BZ +Z B)x X If P : D A D A, then this is no harder than the Lyapunov inequality. A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Control of PDEs 9 / 28

10 Tractable or Intractable? Convex Optimization Problem: max bx subject to Ax C The problem is convex optimization if C is a convex cone. b and A are affine. Computational Tractability: Convex Optimization over C is, in general, tractable if The set membership test for y C is in P. x is finite dimensional. A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Control of PDEs / 28

11 The Stabilization Problem is Convex Optimization Problem: Find P L(Z) and Z L(D A ) such that PA +AP +BZ +Z B < P > Inequality represents the convex cone of positive operators on D A with inner product X. Composition and adjoint are linear operations. Convex combinations of positive operators are positive. Problems The space of operators is infinite-dimensional. Verifying positivity of an operator is hard. A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Control of PDEs / 28

12 Solving Linear Operator Inequalities A Finite-Dimensional Subspace Question: How to parameterize the set of operators? Later, we will enforce positivity. Classes of Operators: x R C[ τ,] (Ax)(s) = M(s)x(s)+ N(s, t)x(t)dt M(s) is the multiplier of a Multiplier Operator. N(s,t) is the kernel of an Integral Operator. Question: How to parameterize multiplier and integral operators We consider polynomial multipliers and kernels M(s) = c T D(s) D(s) is a monomial basis c is a vector of decision variables. For a finite basis, the set of operators is finite-dimensional Now, how do we enforce positivity on D A? A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Control of PDEs 2 / 28

13 Optimization of Polynomials Problem: max b T x n subject to A (y)+ x ia i(y) y i= The A i are matrices of polynomials in y. e.g. Using multi-index notation, A i(y) = α A i,α y α Computationally Intractable The problem: Is p(x) for all x R n? (i.e. p R + [x]? ) is NP-hard. A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Control of PDEs 3 / 28

14 Sum-of-Squares (SOS) Programming Problem: max b T x n subject to A (y)+ x i A i (y) Σ s i= Definition 3. Σ s R + [x] is the cone of sum-of-squares matrices. If S Σ s, then for some G i R[x], r S(y) = G i (y) T G i (y) i= Computationally Tractable: S Σ s is an SDP constraint. A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Control of PDEs 4 / 28

15 SOS Programming: Why is M Σ s an SDP? Let Zd n (x) be the vector of monomial bases in dimension n of degree d or less. e.g., if x R 2, then Z2(x) T = [ ] x x 2 x x 2 x 2 x 2 2 and [ [ Z 2 x x (x)t = 2 Z = (x) x x2] Z (x) ] Feasibility Test: Lemma 4. Suppose M is polynomial of degree 2d. M Σ s iff there exists some Q such that M(x) = Z d (x) T QZ d (x). A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Control of PDEs 5 / 28

16 Problem: Optimizing Locally Positive Functions Solution: Positivstellensatz Results Let X := { x : p } i(x) i =,...,k q j (x) = j =,...,m Theorem 5 (Putinar). Suppose X is compact+ and v(x) for x X. Then there exist s i Σ s and t i R[x] such that v(x) k m s i (x)p i (x)+ t i (x)q i (x) s = i= i= A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Control of PDEs 6 / 28

17 Control of Tokamaks Choosing Our Operators Recall that for the Tokamak problem, we have (Aψ)(x) := µ a 2 x (Bj ni )(x) := x and X = L 2 [,] with domain ( η (x) ( η (x)j eni (x) ) ) x (xψ(x)) D A = {y L 2 [,] : y,y x,y xx L 2 [,],y() = y() = }. We parameterize our operator P simply using a multiplier as (Px)(s) = M(s)x(s) An important choice is that of the controller: K : D A X (Kψ)(x) = K (x)ψ(x)+ d dx (Z 2(x)ψ(x)) The structure of K and P imposes a structure on Z = KP: (Zψ)(x) = (KPψ)(x) = Z (x)ψ(x)+ d dx (Z 2(x)ψ(x)) A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Positivity of Operators 7 / 28

18 Control of Tokamaks Enforcing Positivity First Constraint: Enforcing positivity of P is easy. if and only if x,px = x(s)m(s)x(s)ds M(s) for alls [,] Second Constraint: Enforcing negativity of PA +AP +BZ +Z B can be reformulated as x,(pa +AP+BZ+Z B)x = x(s)r (s)x(s)ds+ ẋ(s)r 2 (s)ẋ(s)ds where R and R 2 are linear in variables Z, Z 2, and M (Next Slide). We require both R (s) and R 2 (s) for all s [,]. A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Positivity of Operators 8 / 28

19 Enforcing Positivity As promised: R (s) := µ a 2b where b (x, ( x, ( d )M(x)+b 2 x, dx ( d )Z (x)+b 3 x, dx ) d Z 2 (x) dx R 2 (s) := µ a 2c (x)m(x)+c 2 (x)z 2 (x). ) d ( η,x = f(x) dx x η ) ( x 2 +f (x) η ) x +η,x +f (x)η + f(x)η ) x d b 2 (x, = f (x)+f(x) d dx dx, ) b 3 (x, d dx d dx +( ) d 2 f(x)η +f(x)η,x dx 2, = η,x f (x)+η f (x)+η,x f(x) d dx +η f(x) d2 dx 2, c (x) = η f(x),c 2 (x) = 2η f(x) and f(x) = x 2 ( x). A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Positivity of Operators 9 / 28

20 Simulation safety factor profile safety factor error q time x.5 Figure: Time evolution of the safety factor profile or the q-profile. q q ref time.5 x Figure: Time evolution of the q-profile Error, q(x,t) q ref (x). Here x is the normalized spatial variable. A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Positivity of Operators 2 / 28

21 Simulation Note: Although not discussed, we also constraint j ni 3MA We use finite difference methods to obtain the numerical solution of the closed loop system. To simulate the controller under realistic scenarios we use the plasma resistivity η (x,t) data from the Tore Supra Tokamak. The other data used from the Tore Supra Tokamak are: I p (plasma current) =.6MA B φ (toroidal magnetic field at the plasma center) =.9T a(radius of the last closed magnetic surface) =.72m R (magnetic center location) = 2.38m. From this data the boundary conditions for ψ x (x,t) are calculated to be ψ x (,t) = and ψ x (,t) =.285. A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Positivity of Operators 2 / 28

22 Simulation ψ x profile ψ x error ψ x sim.5.5 time.5 x Figure: Time evolution of ψ x-profile. ψ x ψ x,ref time.5 x Figure: ψ x-profile error, ψ x ψ x,ref. Here ψ x,ref is obtained from the reference q-profile, q ref. A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Positivity of Operators 22 / 28

23 Simulation Control effort x 6 4 j eni time x.5 Figure: External non-inductive current deposit, j eni(x,t). A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Positivity of Operators 23 / 28

24 Ongoing Work The Non-Inductive Source Term We can improve our model of actuator control ( R η (x,t)j ni (x,t) ) x The control is via the Non-Inductive Source Term, j ni. Spatially-distributed A sum of Gaussians j ni (x,t) = a e (x b )2 c +a 2 e (x b 2 )2 c 2 +a 3 e (x b 3 )2 c 3 We can parameterize a Gaussian as a e (x b ) 2 c = ap a (x)+bp b (x)+cp c (x) = [ p a (x) p b (x) p c (x) ] We can look for a controller as u = K(x)ψ x (x)+ d dx (K 2(x)ψ(x))dx a b = P(x) T u c A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Positivity of Operators 24 / 28

25 Ongoing Work: Observing PDE systems Heat Equation Example Problem: Feedback requires a knowledge of the heat distribution. Sensors can only measure heat at a single point. Consider the dynamics of heat flux. w t (x,t) = w xx (x,t) Suppose we only observe at a single point, y(t) = w(,t) and control the gradient at the same point: w z (,t) = u(t) To know the state, we want Luenberger Observer, L: ẑ(t) = (A+LC +BF)ẑ(t) Ly(y) with both A+LC and A+BF stable. Then ẑ(s,t) z(s,t). A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Positivity of Operators 25 / 28

26 Ongoing Work: Observer-Based Controller The Heat Equation Observer state estimate Estimation error.5.5 w obs (z,t).5.5 w(z,t) w o (z,t) time.2.4 z time.5 z Figure: Estimate of the State Figure: Error in the Observed State A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Positivity of Operators 26 / 28

27 Ongoing Work: Observer-Based Controller The Heat Equation System solution Control error 2 2 w(z,t) w(z,t) w ref (z,t) time.2.4 z time.2.4 z.6.8 Figure: Effect of Observer-Based Boundary Control Figure: Error in Observer-Based Boundary Control A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Positivity of Operators 27 / 28

28 Concluding Remarks: Research Directions Directions: Theory of Linear Operator Inequalities Duality Optimal H Control Other Research: Immunology/Cancer Identify Feedback Mechanisms Decentralized Control Parallel Algorithms for SOS/Polya GPU Computing Analysis/Synthesis Tokamaks Observers Temperature/Density Coupling RF-Heating Some algorithms are available for download at: Thanks for Listening A. Gahlawat, M. Peet, E. Witrant SOS for Tokamaks: Conclusion 28 / 28

Analysis and Boundary Control of Parabolic PDEs using Sum-of-Squares Polynomials

Analysis and Boundary Control of Parabolic PDEs using Sum-of-Squares Polynomials 1/56 Analysis and Boundary Control of Parabolic PDEs using Sum-of-Squares Polynomials Aditya Gahlawat Mechanical, Materials and Aerospace Engineering Illinois Institute of Technology, Chicago, USA Grenoble

More information

Modern Optimal Control

Modern Optimal Control Modern Optimal Control Matthew M. Peet Arizona State University Lecture 19: Stabilization via LMIs Optimization Optimization can be posed in functional form: min x F objective function : inequality constraints

More information

Analysis of Systems with State-Dependent Delay

Analysis of Systems with State-Dependent Delay Analysis of Systems with State-Dependent Delay Matthew M. Peet Arizona State University Tempe, AZ USA American Institute of Aeronautics and Astronautics Guidance, Navigation and Control Conference Boston,

More information

Nonlinear Systems Theory

Nonlinear Systems Theory Nonlinear Systems Theory Matthew M. Peet Arizona State University Lecture 2: Nonlinear Systems Theory Overview Our next goal is to extend LMI s and optimization to nonlinear systems analysis. Today we

More information

Grammians. Matthew M. Peet. Lecture 20: Grammians. Illinois Institute of Technology

Grammians. Matthew M. Peet. Lecture 20: Grammians. Illinois Institute of Technology Grammians Matthew M. Peet Illinois Institute of Technology Lecture 2: Grammians Lyapunov Equations Proposition 1. Suppose A is Hurwitz and Q is a square matrix. Then X = e AT s Qe As ds is the unique solution

More information

Optimization of Polynomials

Optimization of Polynomials Optimization of Polynomials Matthew M. Peet Arizona State University Thanks to S. Lall and P. Parrilo for guidance and supporting material Lecture 03: Optimization of Polynomials Overview In this lecture,

More information

LMIs for Observability and Observer Design

LMIs for Observability and Observer Design LMIs for Observability and Observer Design Matthew M. Peet Arizona State University Lecture 06: LMIs for Observability and Observer Design Observability Consider a system with no input: ẋ(t) = Ax(t), x(0)

More information

LMI Methods in Optimal and Robust Control

LMI Methods in Optimal and Robust Control LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 15: Nonlinear Systems and Lyapunov Functions Overview Our next goal is to extend LMI s and optimization to nonlinear

More information

Permutations and Polynomials Sarah Kitchen February 7, 2006

Permutations and Polynomials Sarah Kitchen February 7, 2006 Permutations and Polynomials Sarah Kitchen February 7, 2006 Suppose you are given the equations x + y + z = a and 1 x + 1 y + 1 z = 1 a, and are asked to prove that one of x,y, and z is equal to a. We

More information

Model based optimization and estimation of the field map during the breakdown phase in the ITER tokamak

Model based optimization and estimation of the field map during the breakdown phase in the ITER tokamak Model based optimization and estimation of the field map during the breakdown phase in the ITER tokamak Roberto Ambrosino 1 Gianmaria De Tommasi 2 Massimiliano Mattei 3 Alfredo Pironti 2 1 CREATE, Università

More information

Lecture Note 5: Semidefinite Programming for Stability Analysis

Lecture Note 5: Semidefinite Programming for Stability Analysis ECE7850: Hybrid Systems:Theory and Applications Lecture Note 5: Semidefinite Programming for Stability Analysis Wei Zhang Assistant Professor Department of Electrical and Computer Engineering Ohio State

More information

Selected Examples of CONIC DUALITY AT WORK Robust Linear Optimization Synthesis of Linear Controllers Matrix Cube Theorem A.

Selected Examples of CONIC DUALITY AT WORK Robust Linear Optimization Synthesis of Linear Controllers Matrix Cube Theorem A. . Selected Examples of CONIC DUALITY AT WORK Robust Linear Optimization Synthesis of Linear Controllers Matrix Cube Theorem A. Nemirovski Arkadi.Nemirovski@isye.gatech.edu Linear Optimization Problem,

More information

ANALYSIS AND CONTROL OF PARABOLIC PARTIAL DIFFERENTIAL EQUATIONS WITH APPLICATION TO TOKAMAKS USING SUM-OF-SQUARES POLYNOMIALS ADITYA GAHLAWAT

ANALYSIS AND CONTROL OF PARABOLIC PARTIAL DIFFERENTIAL EQUATIONS WITH APPLICATION TO TOKAMAKS USING SUM-OF-SQUARES POLYNOMIALS ADITYA GAHLAWAT ANALYSIS AND CONTROL OF PARABOLIC PARTIAL DIFFERENTIAL EQUATIONS WITH APPLICATION TO TOKAMAKS USING SUM-OF-SQUARES POLYNOMIALS BY ADITYA GAHLAWAT Submitted in partial fulfillment of the requirements for

More information

Semidefinite Programming Basics and Applications

Semidefinite Programming Basics and Applications Semidefinite Programming Basics and Applications Ray Pörn, principal lecturer Åbo Akademi University Novia University of Applied Sciences Content What is semidefinite programming (SDP)? How to represent

More information

Lecture 6 Verification of Hybrid Systems

Lecture 6 Verification of Hybrid Systems Lecture 6 Verification of Hybrid Systems Ufuk Topcu Nok Wongpiromsarn Richard M. Murray AFRL, 25 April 2012 Outline: A hybrid system model Finite-state abstractions and use of model checking Deductive

More information

Semidefinite Programming Duality and Linear Time-invariant Systems

Semidefinite Programming Duality and Linear Time-invariant Systems Semidefinite Programming Duality and Linear Time-invariant Systems Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University 2 July 2004 Workshop on Linear Matrix Inequalities in Control LAAS-CNRS,

More information

Constructing Lyapunov-Krasovskii Functionals For Linear Time Delay Systems

Constructing Lyapunov-Krasovskii Functionals For Linear Time Delay Systems Constructing Lyapunov-Krasovskii Functionals For Linear Time Delay Systems Antonis Papachristodoulou, Matthew Peet and Sanjay Lall Abstract We present an algorithmic methodology for constructing Lyapunov-Krasovskii

More information

Semidefinite Programming

Semidefinite Programming Semidefinite Programming Basics and SOS Fernando Mário de Oliveira Filho Campos do Jordão, 2 November 23 Available at: www.ime.usp.br/~fmario under talks Conic programming V is a real vector space h, i

More information

Support Vector Machines

Support Vector Machines Support Vector Machines Support vector machines (SVMs) are one of the central concepts in all of machine learning. They are simply a combination of two ideas: linear classification via maximum (or optimal

More information

Learning From Data Lecture 25 The Kernel Trick

Learning From Data Lecture 25 The Kernel Trick Learning From Data Lecture 25 The Kernel Trick Learning with only inner products The Kernel M. Magdon-Ismail CSCI 400/600 recap: Large Margin is Better Controling Overfitting Non-Separable Data 0.08 random

More information

The norms can also be characterized in terms of Riccati inequalities.

The norms can also be characterized in terms of Riccati inequalities. 9 Analysis of stability and H norms Consider the causal, linear, time-invariant system ẋ(t = Ax(t + Bu(t y(t = Cx(t Denote the transfer function G(s := C (si A 1 B. Theorem 85 The following statements

More information

Semidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization

Semidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization Semidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization Instructor: Farid Alizadeh Author: Ai Kagawa 12/12/2012

More information

6.241 Dynamic Systems and Control

6.241 Dynamic Systems and Control 6.241 Dynamic Systems and Control Lecture 24: H2 Synthesis Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology May 4, 2011 E. Frazzoli (MIT) Lecture 24: H 2 Synthesis May

More information

LMI Methods in Optimal and Robust Control

LMI Methods in Optimal and Robust Control LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 14: LMIs for Robust Control in the LF Framework ypes of Uncertainty In this Lecture, we will cover Unstructured,

More information

Lecture 10: Linear Matrix Inequalities Dr.-Ing. Sudchai Boonto

Lecture 10: Linear Matrix Inequalities Dr.-Ing. Sudchai Boonto Dr-Ing Sudchai Boonto Department of Control System and Instrumentation Engineering King Mongkuts Unniversity of Technology Thonburi Thailand Linear Matrix Inequalities A linear matrix inequality (LMI)

More information

Convex Optimization. (EE227A: UC Berkeley) Lecture 28. Suvrit Sra. (Algebra + Optimization) 02 May, 2013

Convex Optimization. (EE227A: UC Berkeley) Lecture 28. Suvrit Sra. (Algebra + Optimization) 02 May, 2013 Convex Optimization (EE227A: UC Berkeley) Lecture 28 (Algebra + Optimization) 02 May, 2013 Suvrit Sra Admin Poster presentation on 10th May mandatory HW, Midterm, Quiz to be reweighted Project final report

More information

Machine Learning. Support Vector Machines. Manfred Huber

Machine Learning. Support Vector Machines. Manfred Huber Machine Learning Support Vector Machines Manfred Huber 2015 1 Support Vector Machines Both logistic regression and linear discriminant analysis learn a linear discriminant function to separate the data

More information

POLYNOMIAL OPTIMIZATION WITH SUMS-OF-SQUARES INTERPOLANTS

POLYNOMIAL OPTIMIZATION WITH SUMS-OF-SQUARES INTERPOLANTS POLYNOMIAL OPTIMIZATION WITH SUMS-OF-SQUARES INTERPOLANTS Sercan Yıldız syildiz@samsi.info in collaboration with Dávid Papp (NCSU) OPT Transition Workshop May 02, 2017 OUTLINE Polynomial optimization and

More information

Convex Optimization. (EE227A: UC Berkeley) Lecture 6. Suvrit Sra. (Conic optimization) 07 Feb, 2013

Convex Optimization. (EE227A: UC Berkeley) Lecture 6. Suvrit Sra. (Conic optimization) 07 Feb, 2013 Convex Optimization (EE227A: UC Berkeley) Lecture 6 (Conic optimization) 07 Feb, 2013 Suvrit Sra Organizational Info Quiz coming up on 19th Feb. Project teams by 19th Feb Good if you can mix your research

More information

Analysis and synthesis: a complexity perspective

Analysis and synthesis: a complexity perspective Analysis and synthesis: a complexity perspective Pablo A. Parrilo ETH ZürichZ control.ee.ethz.ch/~parrilo Outline System analysis/design Formal and informal methods SOS/SDP techniques and applications

More information

INTRODUCTION TO MAGNETIC NUCLEAR FUSION

INTRODUCTION TO MAGNETIC NUCLEAR FUSION INTRODUCTION TO MAGNETIC NUCLEAR FUSION S.E. Sharapov Euratom/CCFE Fusion Association, Culham Science Centre, Abingdon, Oxfordshire OX14 3DB, UK With acknowledgments to B.Alper for use of his transparencies

More information

Chapter 1. Preliminaries. The purpose of this chapter is to provide some basic background information. Linear Space. Hilbert Space.

Chapter 1. Preliminaries. The purpose of this chapter is to provide some basic background information. Linear Space. Hilbert Space. Chapter 1 Preliminaries The purpose of this chapter is to provide some basic background information. Linear Space Hilbert Space Basic Principles 1 2 Preliminaries Linear Space The notion of linear space

More information

2. Dual space is essential for the concept of gradient which, in turn, leads to the variational analysis of Lagrange multipliers.

2. Dual space is essential for the concept of gradient which, in turn, leads to the variational analysis of Lagrange multipliers. Chapter 3 Duality in Banach Space Modern optimization theory largely centers around the interplay of a normed vector space and its corresponding dual. The notion of duality is important for the following

More information

Convex optimization. Javier Peña Carnegie Mellon University. Universidad de los Andes Bogotá, Colombia September 2014

Convex optimization. Javier Peña Carnegie Mellon University. Universidad de los Andes Bogotá, Colombia September 2014 Convex optimization Javier Peña Carnegie Mellon University Universidad de los Andes Bogotá, Colombia September 2014 1 / 41 Convex optimization Problem of the form where Q R n convex set: min x f(x) x Q,

More information

An Introduction to Linear Matrix Inequalities. Raktim Bhattacharya Aerospace Engineering, Texas A&M University

An Introduction to Linear Matrix Inequalities. Raktim Bhattacharya Aerospace Engineering, Texas A&M University An Introduction to Linear Matrix Inequalities Raktim Bhattacharya Aerospace Engineering, Texas A&M University Linear Matrix Inequalities What are they? Inequalities involving matrix variables Matrix variables

More information

Integration - Past Edexcel Exam Questions

Integration - Past Edexcel Exam Questions Integration - Past Edexcel Exam Questions 1. (a) Given that y = 5x 2 + 7x + 3, find i. - ii. - (b) ( 1 + 3 ) x 1 x dx. [4] 2. Question 2b - January 2005 2. The gradient of the curve C is given by The point

More information

Legendre s Equation. PHYS Southern Illinois University. October 18, 2016

Legendre s Equation. PHYS Southern Illinois University. October 18, 2016 Legendre s Equation PHYS 500 - Southern Illinois University October 18, 2016 PHYS 500 - Southern Illinois University Legendre s Equation October 18, 2016 1 / 11 Legendre s Equation Recall We are trying

More information

Delay-independent stability via a reset loop

Delay-independent stability via a reset loop Delay-independent stability via a reset loop S. Tarbouriech & L. Zaccarian (LAAS-CNRS) Joint work with F. Perez Rubio & A. Banos (Universidad de Murcia) L2S Paris, 20-22 November 2012 L2S Paris, 20-22

More information

arzelier

arzelier COURSE ON LMI OPTIMIZATION WITH APPLICATIONS IN CONTROL PART II.1 LMIs IN SYSTEMS CONTROL STATE-SPACE METHODS STABILITY ANALYSIS Didier HENRION www.laas.fr/ henrion henrion@laas.fr Denis ARZELIER www.laas.fr/

More information

Design of next step tokamak: Consistent analysis of plasma flux consumption and poloidal field system

Design of next step tokamak: Consistent analysis of plasma flux consumption and poloidal field system Design of next step tokamak: Consistent analysis of plasma flux consumption and poloidal field system J.M. Ané 1, V. Grandgirard, F. Albajar 1, J.Johner 1 1Euratom-CEA Association, Cadarache, France Euratom-EPFL

More information

Linear Matrix Inequalities in Robust Control. Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University MTNS 2002

Linear Matrix Inequalities in Robust Control. Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University MTNS 2002 Linear Matrix Inequalities in Robust Control Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University MTNS 2002 Objective A brief introduction to LMI techniques for Robust Control Emphasis on

More information

EG4321/EG7040. Nonlinear Control. Dr. Matt Turner

EG4321/EG7040. Nonlinear Control. Dr. Matt Turner EG4321/EG7040 Nonlinear Control Dr. Matt Turner EG4321/EG7040 [An introduction to] Nonlinear Control Dr. Matt Turner EG4321/EG7040 [An introduction to] Nonlinear [System Analysis] and Control Dr. Matt

More information

Learning Control Lyapunov Functions from Counterexamples and Demonstrations

Learning Control Lyapunov Functions from Counterexamples and Demonstrations Noname manuscript No. (will be inserted by the editor) Learning Control Lyapunov Functions from Counterexamples and Demonstrations Hadi Ravanbakhsh Sriram Sankaranarayanan Received: date / Accepted: date

More information

MCE693/793: Analysis and Control of Nonlinear Systems

MCE693/793: Analysis and Control of Nonlinear Systems MCE693/793: Analysis and Control of Nonlinear Systems Lyapunov Stability - I Hanz Richter Mechanical Engineering Department Cleveland State University Definition of Stability - Lyapunov Sense Lyapunov

More information

What can be expressed via Conic Quadratic and Semidefinite Programming?

What can be expressed via Conic Quadratic and Semidefinite Programming? What can be expressed via Conic Quadratic and Semidefinite Programming? A. Nemirovski Faculty of Industrial Engineering and Management Technion Israel Institute of Technology Abstract Tremendous recent

More information

Verification Constraint Problems with Strengthening

Verification Constraint Problems with Strengthening Verification Constraint Problems with Strengthening Aaron R. Bradley and Zohar Manna Computer Science Department Stanford University Stanford, CA 94305-9045 {arbrad,manna}@cs.stanford.edu Abstract. The

More information

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................

More information

Modern Control Systems

Modern Control Systems Modern Control Systems Matthew M. Peet Arizona State University Lecture 09: Observability Observability For Static Full-State Feedback, we assume knowledge of the Full-State. In reality, we only have measurements

More information

LEGENDRE POLYNOMIALS AND APPLICATIONS. We construct Legendre polynomials and apply them to solve Dirichlet problems in spherical coordinates.

LEGENDRE POLYNOMIALS AND APPLICATIONS. We construct Legendre polynomials and apply them to solve Dirichlet problems in spherical coordinates. LEGENDRE POLYNOMIALS AND APPLICATIONS We construct Legendre polynomials and apply them to solve Dirichlet problems in spherical coordinates.. Legendre equation: series solutions The Legendre equation is

More information

Sec. 1.1: Basics of Vectors

Sec. 1.1: Basics of Vectors Sec. 1.1: Basics of Vectors Notation for Euclidean space R n : all points (x 1, x 2,..., x n ) in n-dimensional space. Examples: 1. R 1 : all points on the real number line. 2. R 2 : all points (x 1, x

More information

Lecture: Examples of LP, SOCP and SDP

Lecture: Examples of LP, SOCP and SDP 1/34 Lecture: Examples of LP, SOCP and SDP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2018.html wenzw@pku.edu.cn Acknowledgement:

More information

Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty

Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty V. Jeyakumar, G. M. Lee and G. Li Communicated by Sándor Zoltán Németh Abstract This paper deals with convex optimization problems

More information

Distributed Control of Coupled Inhomogeneous Diffusion in Tokamak Plasmas

Distributed Control of Coupled Inhomogeneous Diffusion in Tokamak Plasmas Distributed Control of Coupled Inhomogeneous Diffusion in Tokamak Plasmas Bojan Mavkov, Emmanuel Witrant, Christophe Prieur To cite this version: Bojan Mavkov, Emmanuel Witrant, Christophe Prieur. Distributed

More information

LMI Methods in Optimal and Robust Control

LMI Methods in Optimal and Robust Control LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 4: LMIs for State-Space Internal Stability Solving the Equations Find the output given the input State-Space:

More information

Self-Concordant Barrier Functions for Convex Optimization

Self-Concordant Barrier Functions for Convex Optimization Appendix F Self-Concordant Barrier Functions for Convex Optimization F.1 Introduction In this Appendix we present a framework for developing polynomial-time algorithms for the solution of convex optimization

More information

Tokamak Fusion Basics and the MHD Equations

Tokamak Fusion Basics and the MHD Equations MHD Simulations for Fusion Applications Lecture 1 Tokamak Fusion Basics and the MHD Equations Stephen C. Jardin Princeton Plasma Physics Laboratory CEMRACS 1 Marseille, France July 19, 21 1 Fusion Powers

More information

Prof. M. Saha Professor of Mathematics The University of Burdwan West Bengal, India

Prof. M. Saha Professor of Mathematics The University of Burdwan West Bengal, India CHAPTER 9 BY Prof. M. Saha Professor of Mathematics The University of Burdwan West Bengal, India E-mail : mantusaha.bu@gmail.com Introduction and Objectives In the preceding chapters, we discussed normed

More information

Semidefinite Programming

Semidefinite Programming Semidefinite Programming Notes by Bernd Sturmfels for the lecture on June 26, 208, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra The transition from linear algebra to nonlinear algebra has

More information

Math 250B Final Exam Review Session Spring 2015 SOLUTIONS

Math 250B Final Exam Review Session Spring 2015 SOLUTIONS Math 5B Final Exam Review Session Spring 5 SOLUTIONS Problem Solve x x + y + 54te 3t and y x + 4y + 9e 3t λ SOLUTION: We have det(a λi) if and only if if and 4 λ only if λ 3λ This means that the eigenvalues

More information

Reducing the Computational Cost of the Sum-of-Squares Stability Test for Time-Delayed Systems

Reducing the Computational Cost of the Sum-of-Squares Stability Test for Time-Delayed Systems Reducing the Computational Cost of the Sum-of-Squares Stability Test for Time-Delayed Systems Yashun Zhang Matthew Peet and Keqin Gu Abstract This paper considers the problem of reducing the computational

More information

Lagrange Multipliers

Lagrange Multipliers Optimization with Constraints As long as algebra and geometry have been separated, their progress have been slow and their uses limited; but when these two sciences have been united, they have lent each

More information

Plasma Breakdown Analysis in JFT-2M without the Use of Center Solenoid

Plasma Breakdown Analysis in JFT-2M without the Use of Center Solenoid 3st EPS Conference on Plasma Physics 28th June 2nd July, 24, Imperial College, London Plasma Breakdown Analysis in without the Use of Center Solenoid H. Tsutsui, S. Tsuji-Iio, R. Shimada, M. Sato, K. Tsuzuki,

More information

Chapter 4 Euclid Space

Chapter 4 Euclid Space Chapter 4 Euclid Space Inner Product Spaces Definition.. Let V be a real vector space over IR. A real inner product on V is a real valued function on V V, denoted by (, ), which satisfies () (x, y) = (y,

More information

Prashant Mhaskar, Nael H. El-Farra & Panagiotis D. Christofides. Department of Chemical Engineering University of California, Los Angeles

Prashant Mhaskar, Nael H. El-Farra & Panagiotis D. Christofides. Department of Chemical Engineering University of California, Los Angeles HYBRID PREDICTIVE OUTPUT FEEDBACK STABILIZATION OF CONSTRAINED LINEAR SYSTEMS Prashant Mhaskar, Nael H. El-Farra & Panagiotis D. Christofides Department of Chemical Engineering University of California,

More information

Output Stabilization of Time-Varying Input Delay System using Interval Observer Technique

Output Stabilization of Time-Varying Input Delay System using Interval Observer Technique Output Stabilization of Time-Varying Input Delay System using Interval Observer Technique Andrey Polyakov a, Denis Efimov a, Wilfrid Perruquetti a,b and Jean-Pierre Richard a,b a - NON-A, INRIA Lille Nord-Europe

More information

Input: System of inequalities or equalities over the reals R. Output: Value for variables that minimizes cost function

Input: System of inequalities or equalities over the reals R. Output: Value for variables that minimizes cost function Linear programming Input: System of inequalities or equalities over the reals R A linear cost function Output: Value for variables that minimizes cost function Example: Minimize 6x+4y Subject to 3x + 2y

More information

Lecture 8 Plus properties, merit functions and gap functions. September 28, 2008

Lecture 8 Plus properties, merit functions and gap functions. September 28, 2008 Lecture 8 Plus properties, merit functions and gap functions September 28, 2008 Outline Plus-properties and F-uniqueness Equation reformulations of VI/CPs Merit functions Gap merit functions FP-I book:

More information

EE363 homework 8 solutions

EE363 homework 8 solutions EE363 Prof. S. Boyd EE363 homework 8 solutions 1. Lyapunov condition for passivity. The system described by ẋ = f(x, u), y = g(x), x() =, with u(t), y(t) R m, is said to be passive if t u(τ) T y(τ) dτ

More information

Polynomials. In many problems, it is useful to write polynomials as products. For example, when solving equations: Example:

Polynomials. In many problems, it is useful to write polynomials as products. For example, when solving equations: Example: Polynomials Monomials: 10, 5x, 3x 2, x 3, 4x 2 y 6, or 5xyz 2. A monomial is a product of quantities some of which are unknown. Polynomials: 10 + 5x 3x 2 + x 3, or 4x 2 y 6 + 5xyz 2. A polynomial is a

More information

Multiplication of Polynomials

Multiplication of Polynomials Summary 391 Chapter 5 SUMMARY Section 5.1 A polynomial in x is defined by a finite sum of terms of the form ax n, where a is a real number and n is a whole number. a is the coefficient of the term. n is

More information

Control, Stabilization and Numerics for Partial Differential Equations

Control, Stabilization and Numerics for Partial Differential Equations Paris-Sud, Orsay, December 06 Control, Stabilization and Numerics for Partial Differential Equations Enrique Zuazua Universidad Autónoma 28049 Madrid, Spain enrique.zuazua@uam.es http://www.uam.es/enrique.zuazua

More information

A DARK GREY P O N T, with a Switch Tail, and a small Star on the Forehead. Any

A DARK GREY P O N T, with a Switch Tail, and a small Star on the Forehead. Any Y Y Y X X «/ YY Y Y ««Y x ) & \ & & } # Y \#$& / Y Y X» \\ / X X X x & Y Y X «q «z \x» = q Y # % \ & [ & Z \ & { + % ) / / «q zy» / & / / / & x x X / % % ) Y x X Y $ Z % Y Y x x } / % «] «] # z» & Y X»

More information

The moment-lp and moment-sos approaches

The moment-lp and moment-sos approaches The moment-lp and moment-sos approaches LAAS-CNRS and Institute of Mathematics, Toulouse, France CIRM, November 2013 Semidefinite Programming Why polynomial optimization? LP- and SDP- CERTIFICATES of POSITIVITY

More information

Lecture 12: Detailed balance and Eigenfunction methods

Lecture 12: Detailed balance and Eigenfunction methods Miranda Holmes-Cerfon Applied Stochastic Analysis, Spring 2015 Lecture 12: Detailed balance and Eigenfunction methods Readings Recommended: Pavliotis [2014] 4.5-4.7 (eigenfunction methods and reversibility),

More information

arxiv: v1 [math.oc] 31 Jan 2017

arxiv: v1 [math.oc] 31 Jan 2017 CONVEX CONSTRAINED SEMIALGEBRAIC VOLUME OPTIMIZATION: APPLICATION IN SYSTEMS AND CONTROL 1 Ashkan Jasour, Constantino Lagoa School of Electrical Engineering and Computer Science, Pennsylvania State University

More information

Comparing Convex Relaxations for Quadratically Constrained Quadratic Programming

Comparing Convex Relaxations for Quadratically Constrained Quadratic Programming Comparing Convex Relaxations for Quadratically Constrained Quadratic Programming Kurt M. Anstreicher Dept. of Management Sciences University of Iowa European Workshop on MINLP, Marseille, April 2010 The

More information

UC Berkeley Department of Electrical Engineering and Computer Science. EECS 227A Nonlinear and Convex Optimization. Solutions 5 Fall 2009

UC Berkeley Department of Electrical Engineering and Computer Science. EECS 227A Nonlinear and Convex Optimization. Solutions 5 Fall 2009 UC Berkeley Department of Electrical Engineering and Computer Science EECS 227A Nonlinear and Convex Optimization Solutions 5 Fall 2009 Reading: Boyd and Vandenberghe, Chapter 5 Solution 5.1 Note that

More information

Formation and Long Term Evolution of an Externally Driven Magnetic Island in Rotating Plasmas )

Formation and Long Term Evolution of an Externally Driven Magnetic Island in Rotating Plasmas ) Formation and Long Term Evolution of an Externally Driven Magnetic Island in Rotating Plasmas ) Yasutomo ISHII and Andrei SMOLYAKOV 1) Japan Atomic Energy Agency, Ibaraki 311-0102, Japan 1) University

More information

NUCLEAR fusion, the process by which two light nuclei

NUCLEAR fusion, the process by which two light nuclei IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY, VOL. 22, NO. 5, SEPTEMBER 2014 1725 Backstepping Control of the Toroidal Plasma Current Profile in the DIII-D Tokamak Mark D. Boyer, Justin Barton, Eugenio

More information

g(t) = f(x 1 (t),..., x n (t)).

g(t) = f(x 1 (t),..., x n (t)). Reading: [Simon] p. 313-333, 833-836. 0.1 The Chain Rule Partial derivatives describe how a function changes in directions parallel to the coordinate axes. Now we shall demonstrate how the partial derivatives

More information

A Hybrid Inductive Scenario for a Pulsed- Burn RFP Reactor with Quasi-Steady Current. John Sarff

A Hybrid Inductive Scenario for a Pulsed- Burn RFP Reactor with Quasi-Steady Current. John Sarff A Hybrid Inductive Scenario for a Pulsed- Burn RFP Reactor with Quasi-Steady Current John Sarff 12th IEA RFP Workshop Kyoto Institute of Technology, Kyoto, Japan Mar 26-28, 2007 The RFP fusion development

More information

Probabilistic Graphical Models. Theory of Variational Inference: Inner and Outer Approximation. Lecture 15, March 4, 2013

Probabilistic Graphical Models. Theory of Variational Inference: Inner and Outer Approximation. Lecture 15, March 4, 2013 School of Computer Science Probabilistic Graphical Models Theory of Variational Inference: Inner and Outer Approximation Junming Yin Lecture 15, March 4, 2013 Reading: W & J Book Chapters 1 Roadmap Two

More information

Available online at ScienceDirect. IFAC PapersOnLine 50-1 (2017)

Available online at   ScienceDirect. IFAC PapersOnLine 50-1 (2017) Available online at www.sciencedirect.com ScienceDirect IFAC PapersOnLine 5-1 217 6513 6518 Inversion of Separable Kernel Operators in Coupled Differential-Functional Equations and Application to Controller

More information

The Kernel Trick, Gram Matrices, and Feature Extraction. CS6787 Lecture 4 Fall 2017

The Kernel Trick, Gram Matrices, and Feature Extraction. CS6787 Lecture 4 Fall 2017 The Kernel Trick, Gram Matrices, and Feature Extraction CS6787 Lecture 4 Fall 2017 Momentum for Principle Component Analysis CS6787 Lecture 3.1 Fall 2017 Principle Component Analysis Setting: find the

More information

Copositive Programming and Combinatorial Optimization

Copositive Programming and Combinatorial Optimization Copositive Programming and Combinatorial Optimization Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria joint work with I.M. Bomze (Wien) and F. Jarre (Düsseldorf) IMA

More information

A. H. Hall, 33, 35 &37, Lendoi

A. H. Hall, 33, 35 &37, Lendoi 7 X x > - z Z - ----»»x - % x x» [> Q - ) < % - - 7»- -Q 9 Q # 5 - z -> Q x > z»- ~» - x " < z Q q»» > X»? Q ~ - - % % < - < - - 7 - x -X - -- 6 97 9

More information

Polynomial level-set methods for nonlinear dynamical systems analysis

Polynomial level-set methods for nonlinear dynamical systems analysis Proceedings of the Allerton Conference on Communication, Control and Computing pages 64 649, 8-3 September 5. 5.7..4 Polynomial level-set methods for nonlinear dynamical systems analysis Ta-Chung Wang,4

More information

Linear Algebra Practice Problems

Linear Algebra Practice Problems Linear Algebra Practice Problems Page of 7 Linear Algebra Practice Problems These problems cover Chapters 4, 5, 6, and 7 of Elementary Linear Algebra, 6th ed, by Ron Larson and David Falvo (ISBN-3 = 978--68-78376-2,

More information

CSC Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming

CSC Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming CSC2411 - Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming Notes taken by Mike Jamieson March 28, 2005 Summary: In this lecture, we introduce semidefinite programming

More information

6. Linear Quadratic Regulator Control

6. Linear Quadratic Regulator Control EE635 - Control System Theory 6. Linear Quadratic Regulator Control Jitkomut Songsiri algebraic Riccati Equation (ARE) infinite-time LQR (continuous) Hamiltonian matrix gain margin of LQR 6-1 Algebraic

More information

Stability of Linear Distributed Parameter Systems with Time-Delays

Stability of Linear Distributed Parameter Systems with Time-Delays Stability of Linear Distributed Parameter Systems with Time-Delays Emilia FRIDMAN* *Electrical Engineering, Tel Aviv University, Israel joint with Yury Orlov (CICESE Research Center, Ensenada, Mexico)

More information

Vector Calculus, Maths II

Vector Calculus, Maths II Section A Vector Calculus, Maths II REVISION (VECTORS) 1. Position vector of a point P(x, y, z) is given as + y and its magnitude by 2. The scalar components of a vector are its direction ratios, and represent

More information

Convex Optimization 1

Convex Optimization 1 Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski Convex Optimization 1 Many optimization objectives generated

More information

Vectors in Function Spaces

Vectors in Function Spaces Jim Lambers MAT 66 Spring Semester 15-16 Lecture 18 Notes These notes correspond to Section 6.3 in the text. Vectors in Function Spaces We begin with some necessary terminology. A vector space V, also

More information

LMI Methods in Optimal and Robust Control

LMI Methods in Optimal and Robust Control LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 1: Introductions Who Am I? Website: http://control.asu.edu Research Interests: Computation, Optimization and Control

More information

Numerical Methods for Large-Scale Nonlinear Systems

Numerical Methods for Large-Scale Nonlinear Systems Numerical Methods for Large-Scale Nonlinear Systems Handouts by Ronald H.W. Hoppe following the monograph P. Deuflhard Newton Methods for Nonlinear Problems Springer, Berlin-Heidelberg-New York, 2004 Num.

More information

C*-algebras - a case study

C*-algebras - a case study - a case study Definition Suppose that H is a Hilbert space. A C -algebra is an operator-norm closed -subalgebra of BpHq. are closed under ultraproducts and subalgebras so they should be captured by continous

More information

4. Algebra and Duality

4. Algebra and Duality 4-1 Algebra and Duality P. Parrilo and S. Lall, CDC 2003 2003.12.07.01 4. Algebra and Duality Example: non-convex polynomial optimization Weak duality and duality gap The dual is not intrinsic The cone

More information

11 a 12 a 21 a 11 a 22 a 12 a 21. (C.11) A = The determinant of a product of two matrices is given by AB = A B 1 1 = (C.13) and similarly.

11 a 12 a 21 a 11 a 22 a 12 a 21. (C.11) A = The determinant of a product of two matrices is given by AB = A B 1 1 = (C.13) and similarly. C PROPERTIES OF MATRICES 697 to whether the permutation i 1 i 2 i N is even or odd, respectively Note that I =1 Thus, for a 2 2 matrix, the determinant takes the form A = a 11 a 12 = a a 21 a 11 a 22 a

More information