Linear-quadratic control problem with a linear term on semiinfinite interval: theory and applications
|
|
- Kimberly Benson
- 5 years ago
- Views:
Transcription
1 Linear-quadratic control problem with a linear term on semiinfinite interval: theory and applications L. Faybusovich T. Mouktonglang Department of Mathematics, University of Notre Dame, Notre Dame, IN USA 15 December 3 Abstract We describe a complete solution of the linear-quadratic control problem on a semiinfinite interval with the linear term in the objective function. Some applications are considered. 1 Introduction In this paper we consider a standard linear-quadratic control problem on the semiinfinite interval. The only difference is that the problem has an extra linear term in the cost function which makes it time-dependent. The major motivation for this extension comes from [FT] where we consider applications of very efficient primal-dual interior-point algorithms to the computational analysis of multi-criteria linear-quadratic control problems in minimax form. To compute a primal-dual direction it is necessary to solve several linear-quadratic control problems with the same quadratic and different linear parts in the performance index. Another natural motivation comes from the multi-target linear-quadratic control problem (which is, of course, a particular case of multi-criteria LQ problem but admits a much simpler solution than the general problem [FM]). Surprisingly, the solution of LQ problem with an extra term is quite simple and described here in the standard L setting in full generality. Main Result Denote by L n [, ) the Hilbert space of square integrable functions f : [, + ) R n. This paper is based upon work supported in part by National Science Foundation Grant No
2 Let Y = L n [, ) L m [, ), X = {(x, u) Y : ẋ = Ax + Bu, x is absolutely continuous,x() = }, A is an n by n matrix and B is an n by m matrix; Let Σ11 Σ Σ = 1 Σ 1 Σ be a symmetric (m + n) (m + n) matrix. Σ 11 in an n by n matrix and Σ is an m by m matrix; (y, v) Y. Consider the following linear-quadratic control problem: J(x, u) = 1 x x <, Σ > dt (1) u u + [< y, x > + < v, u >] dt min () ẋ = Ax + Bu, x() = x (3) Here x R n is a fixed vector and <, > is the standard scalar product in a finite-dimensional Euclidean space. We assume that (x, u) is in an affine subspace with the linear part equal to X. To describe the solution of (1)-(3) we need the following result. Theorem 1 Let A be an antistable n by n matrix ( i.e. real parts of all eigenvalues of A are positive). Consider the following system of linear differential equations: ẋ = Ax + f, (4) where f L n [, ). There exists a unique solution L(f) of (4) such that L(f) L n [, ). Moreover the map f L(f) is linear and bounded. Explicitly: L(f)(t) = e Aτ f(τ + t)dτ (5) Proof Since A is antistable, there exist a positive definite symmetric matrix H such that A T H + HA = I, (6) where I is the identity matrix (see e.g. [Leonov]). Let x be any solution to (4). Consider W (t) =< x(t), Hx(t) >. Then, using (6), we easily obtain: dw dt = x(t) + < x(t), Hf(t) >,
3 where x(t) =< x(t), x(t) >. Using Cauchy-Schwarz inequality, we obtain dw dt x(t) x(t) Hf(t) x(t) x(t) H f(t), where H is the Matrix norm induced by the Euclidean norm on R n. It is quite obvious that and hence, x(t) H f(t) 1 x(t) + H f(t) dw dt x(t) Integrating (7) from to t, we obtain: H f(t). (7) Consequently, W (t) W () x(τ) dτ H f(τ) dτ. Let now x(τ) dτ 4 H f(τ) dτ + [W (t) W ()] (8) x(t) = e Aτ f(τ + t)dτ = One can easily see that x is the solution to (4) such that x() = One can easily see from (9) that x(t) e Aτ dτ t e Aτ f(τ)dτ e A(τ t) f(τ)dτ (9) f(τ) dτ for any t. Hence x and consequently W are bounded on [, + ). Using (8), we conclude that x(t) dt < i.e. x(t) given by (9) is in L n [, + ). Since x is a solution to (4), we conclude that ẋ L n [, + ) and hence x(t), t + (see appendix for the proof). But then using (8) again, we conclude that x(τ) dτ 4 H f(τ) dτ W () 3
4 (4 H + H )( f(τ) dτ + C e Aτ dτ f(τ) dτ) f(τ) dτ (1) for some constant C. Observe now that (4) may have only one solution in L n [, + ). Indeed, if x 1 and x are two such solutions and x = x 1 x, then x L n [, + ) and ẋ = Ax. Since A is antistable and x L n [, + ), we immediately conclude that x. We can conclude now by (1) that the linear map f L(f) is bounded. Consider the following linear-quadratic control problem: 1 x x <, Σ > dt min (11) u u x X (1) u As is well-known, the following algebraic Riccati equation plays the crucial role in the description of optimal solution to (11),(1): Here KLK + Kà + ÃT K Q = (13) à = A BΣ 1 Σ 1, Q = Σ 11 Σ 1 Σ 1 Σ 1, L = BΣ 1 BT. (14) Observe that (13) is defined under the assumption that Σ is invertible. Recall, that a symmetric solution K = K T to (13) is called stabilizing if the matrix à + LK is stable. the following result is a well-known (for a concise proof see e.g [Lancaster],[Faybusovich]). Theorem The following conditions are equivalent: i) Σ is a positive definite (symmetric) matrix and (13) has a stabilizing solution. ii) The pair (A, B) is stabilizable and there exists ɛ > such that Γ(x, u) = for all (x, u) X. [ x < u ] [ x, Σ u ] > dt ɛ ( x + u )dt Remark. The condition ii) means that the quadratic functional Γ(x, u) is strictly convex on X. 4
5 Theorem 3 Suppose that the pair (A, B) is stabilizable. Then X is a closed vector subspace in Y. Let ṗ + A Z = { T p B T : p L n p [, + ), p is absolutely continuous, ṗ L n [, + )} Then Z is an orthogonal complement of X in Y. (i.e. Z = X ) Proof Let (x, u) X, and (ṗ + A T p, B T p) Z. We are going to show that x ṗ + A α = <, T p u B T > dt = p Indeed, α = = = [< x, ṗ + A T p > + < u, B T p >]dt [< Ax + Bu, p > + < x, ṗ >]dt d dt < x, p > dt = lim < x(t ), p(t ) >. T + Observe that x() =, since (x, u) X. But lim T x(t ) = lim T p(t ) =, since both x and p are in L n [, + ), absolutely continuous and are such that ẋ L n [, + ), ṗ L n [, + ) (see Appendix). Hence, α =. We next show that any (φ, ψ) Y admits the following representation: [ φ ψ ] [ x = u ] [ ṗ + A T p B T p ] (15) with (x, u) X and (ṗ+a T p, B T p) Z. This will easily imply that Z = X and both X and Z are closed. If Σ is the identity matrix, Theorem easily implies that the corresponding algebraic Riccati equation (13) has a stabilizing solution K. Observe that in this case à = A, Q = I n, L = BB T. We can rewrite (15) in the form: ṗ = x A T p φ (16) We also have Substituting (17) into (18), we obtain u = B T p + ψ (17) ẋ = Ax + Bu, x() = (18) ẋ = Ax + BB T p + Bψ. (19) We are looking for the solution to (16),(19)in the form. p = K x + ρ, () 5
6 where K is the stabilizing solution to the algebraic Riccati equation (13). Substituting () into (16),(19), we obtain: ẋ = Ax + BB T K x + BB T ρ + Bψ, (1) K ẋ + ρ = x A T K x A T ρ φ. () Finally, substituting (1) into (), we obtain i.e. (K A + A T K + K BB T K I)x + ρ = A T ρ φ K Bψ K BB T ρ, ρ = (A T + K BB T )ρ φ K Bψ. (3) Since the matrix A + BB T K is stable, the matrix (A + BB T K ) is antistable hence we can apply Theorem 4. (Observe that φ K Bψ L n [, + )) Thus (3) possesses a unique solution ρ L n [, + ), ρ = L(φ + K Bψ). (4) Reversing our reasoning, we see that if ρ is defined as in (4), x is defined as (1) with x() =, and p is defined as in (), we then obtain the representation (15). We are now in position to describe a solution of the LQ-problem on a semiinfinite interval. Theorem 4 Suppose that the conditions of theorem are satisfied. Then the problem (1)-(3) has a unique solution which can be described as follows. There exists a stabilizing solution K to the Riccati equation (13). Then the matrix C = (Ã + LK ) is antistable, (K B Σ 1 )Σ 1 v + y Ln [, + ). Let ρ be a unique solution from L n [, + ) of the system of differential equations ρ = C T ρ + (K B Σ 1 )Σ 1 v + y (which exists according to Theorem 1); x is the solution to the system of differential equations ẋ = (Ã + LK )x + Lρ BΣ 1 v, x() = x, p = K x + ρ, u = Σ 1 (BT p v Σ 1 x). Remark. Observe that by (5) we have the following explicit description of ρ: ρ(t) = e CT τ ((K B Σ 1 )Σ 1 v + y)(t + τ)dτ Sketch of the proof Since conditions of Theorem are satisfied, we know that the functional in (1)-(3) is strictly convex, the matrix Σ is positive definite and the algebraic Riccati equation (13) has (a unique) stabilizing solution K. 6
7 The necessary and sufficient optimality condition for (1)-(3) obviously takes the form: x y Σ + X, (x, u) statifies (3). u v Or using the description of X from Theorem 3: Σ 11 x + Σ 1 u + y = ṗ + A T p, Σ 1 x + Σ u + v = B T p for some p satisfying condition of Theorem 3. We are looking for p in the form: p = K x + ρ, where K is the stabilizing solution to the algebraic Riccati equation (13). We finish the proof exactly as in Theorem 3. Remark. The extension of Theorem 4 to the discrete time case is pretty straightforward. 3 Some Applications Consider, first, the tracking problem: [< x φ, x φ > + < u ψ, u ψ >]dt min, (5) ẋ = Ax + Bu, x() = x. (6) Here (φ, ψ) Y. It is quite clear that (5),(6) is equivalent to 1 [< x, x > + < u, u >]dt [< x, φ > + < u, ψ >]dt min, ẋ = Ax + Bu, x() = x and hence can be solve using Theorem 4. Observe that for x =,(5),(6) is the problem of finding the orthogonal projection of (φ, ψ) Y onto the closed subspace X. In [FM] we have considered the following minimax problem. Let (V, <, > V ) be a Hilbert space, T its closed vector subspace, v, v 1,..., v l be vectors in V. Consider: max v v i min, (7) 1 i l v v + T. (8) 7
8 In case, V = Y, T = X, we arrive at multi-target linear-quadratic control problem on a semiinfinite interval. We have shown in [FM] that the optimal solution of this problem is contained in the convex hull W = conv IR (π T v 1,, π T v m ). Hence, it has the form: v opt = m i=1 µ opt i π T (v i ), where µ opt m i, i=1 µopt = 1. Finding µ opt i can be reduced to solving a finite-dimensional second-order cone programming. Indeed, let m v(µ) = µ i π T v i We have v(µ) v i = i=1 v(µ) π T v i + ν i, where ν i = π T v i is the norm of the orthogonal projection of the vector v i onto the orthogonal complement T of T in Y. Furthermore, v(µ) π T v i = µ T (i)γ µ(i), where µ j (i) = µ j forj i, µ i (i) = µ i 1 and Γ = ( π T v i, π T v j ). Let Γ = B T B be the Cholesky decomposition of Γ. Then v(µ) π T v i = B µ = Bµ b i, where b i = Be i the i-th column of B. Hence, Bµ bi v(µ) v i = ν i and we can rewrite the original problem (7),(8) in the following equivalent form: t min, (9) Bµ bi ν t, i = 1,,..., m, (3) i µ IR m. (31) (See [FM] for details.) The problem (9)- (31) is the second order cone programming problem which can be easily solved using the standard interiorpoint software. Here π T stands for the orthogonal projector of V onto T. In [FM], we have considered linear-quadratic control problem on a finite interval. In the present paper we described the procedure of calculating π X on a semiinfinite interval. Thus we can solve a multi-target LQ problem on semiinfinite interval. Using Theorem 4, one can easily see that for finding π T v i, i = 1,,..., m, it suffices to solve an algebraic Riccati equation K A + A T K + K BB T K I = only once. 8
9 4 Appendix Let H n 1 ([, + )) = {x L n ([, + )), is absolutely continuous and ẋ L n ([, + ))}. This is one of the standard Sobolev spaces. Then the proof of the following Lemma is obtained e.g. from a proof of a similar result in [Leonov]. Lemma 1 Let x H n 1 ([, + )). Then Proof We have: < x(τ), ẋ(τ) > dτ lim x(t) = t + Since, x(t), ẋ(t) L n ([, + )), we have: is finite. But have x(τ) dτ + lim < x(τ), ẋ(τ) > dτ t + ẋ(τ) dτ < x(τ), ẋ(τ) > dτ = 1 x(t) 1 x(). Hence, the limit lim t + x(t) exists, and since x(t) dt <, we References lim x(t) =. t + [Leonov] G.A. Leonov, Mathematical Problems of Control Theory, World Scientific, 1. [Lancaster] P. Lancaster and L. Rodman, Algebraic Riccati Equations, Oxford Science Publications, [Faybusovich] L. Faybusovich, Algebraic Riccati Equation and Symplectic Algbra, International Journal of Control, vol.43, pp (1986). [FM] L. Faybusovich and T. Mouktonglang, Multi-target linear quadratic control problem and second-order cone programming (to appear in System and Control letters) [FT] L.Faybusovich and T.Tsuchiya, Primal-dual Algorithms and Infinitedimensional Jordan Algebras of finite rank, Math. programming, Ser. B, vol. 97(3), pp
Implementation of Infinite Dimensional Interior Point Method for Solving Multi-criteria Linear Quadratic Control Problem
Implementation of Infinite Dimensional Interior Point Method for Solving Multi-criteria Linear Quadratic Control Problem L. Faybusovich Department of Mathematics, University of Notre Dame, Notre Dame,
More informationDeterministic Kalman Filtering on Semi-infinite Interval
Deterministic Kalman Filtering on Semi-infinite Interval L. Faybusovich and T. Mouktonglang Abstract We relate a deterministic Kalman filter on semi-infinite interval to linear-quadratic tracking control
More informationWe describe the generalization of Hazan s algorithm for symmetric programming
ON HAZAN S ALGORITHM FOR SYMMETRIC PROGRAMMING PROBLEMS L. FAYBUSOVICH Abstract. problems We describe the generalization of Hazan s algorithm for symmetric programming Key words. Symmetric programming,
More informationME 234, Lyapunov and Riccati Problems. 1. This problem is to recall some facts and formulae you already know. e Aτ BB e A τ dτ
ME 234, Lyapunov and Riccati Problems. This problem is to recall some facts and formulae you already know. (a) Let A and B be matrices of appropriate dimension. Show that (A, B) is controllable if and
More information2. Review of Linear Algebra
2. Review of Linear Algebra ECE 83, Spring 217 In this course we will represent signals as vectors and operators (e.g., filters, transforms, etc) as matrices. This lecture reviews basic concepts from linear
More informationLecture 3: Review of Linear Algebra
ECE 83 Fall 2 Statistical Signal Processing instructor: R Nowak Lecture 3: Review of Linear Algebra Very often in this course we will represent signals as vectors and operators (eg, filters, transforms,
More informationLecture 3: Review of Linear Algebra
ECE 83 Fall 2 Statistical Signal Processing instructor: R Nowak, scribe: R Nowak Lecture 3: Review of Linear Algebra Very often in this course we will represent signals as vectors and operators (eg, filters,
More informationBalanced Truncation 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.242, Fall 2004: MODEL REDUCTION Balanced Truncation This lecture introduces balanced truncation for LTI
More informationSemidefinite 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 informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 17
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 17 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory May 29, 2012 Andre Tkacenko
More informationModern 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 informationThe 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 informationECEEN 5448 Fall 2011 Homework #4 Solutions
ECEEN 5448 Fall 2 Homework #4 Solutions Professor David G. Meyer Novemeber 29, 2. The state-space realization is A = [ [ ; b = ; c = [ which describes, of course, a free mass (in normalized units) with
More information3 Gramians and Balanced Realizations
3 Gramians and Balanced Realizations In this lecture, we use an optimization approach to find suitable realizations for truncation and singular perturbation of G. It turns out that the recommended realizations
More informationA PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE
Yugoslav Journal of Operations Research 24 (2014) Number 1, 35-51 DOI: 10.2298/YJOR120904016K A PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE BEHROUZ
More informationMarch 8, 2010 MATH 408 FINAL EXAM SAMPLE
March 8, 200 MATH 408 FINAL EXAM SAMPLE EXAM OUTLINE The final exam for this course takes place in the regular course classroom (MEB 238) on Monday, March 2, 8:30-0:20 am. You may bring two-sided 8 page
More informationMatrix Mathematics. Theory, Facts, and Formulas with Application to Linear Systems Theory. Dennis S. Bernstein
Matrix Mathematics Theory, Facts, and Formulas with Application to Linear Systems Theory Dennis S. Bernstein PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD Contents Special Symbols xv Conventions, Notation,
More informationDiscrete and continuous dynamic systems
Discrete and continuous dynamic systems Bounded input bounded output (BIBO) and asymptotic stability Continuous and discrete time linear time-invariant systems Katalin Hangos University of Pannonia Faculty
More informationChapter 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 informationPrimal-dual algorithms and infinite-dimensional Jordan algebras of finite rank
Math. Program., Ser. B 97: 471 493 (003) Digital Object Identifier (DOI) 10.1007/s10107-003-044-4 Leonid Faybusovich Takashi Tsuchiya Primal-dual algorithms and infinite-dimensional Jordan algebras of
More informationw T 1 w T 2. w T n 0 if i j 1 if i = j
Lyapunov Operator Let A F n n be given, and define a linear operator L A : C n n C n n as L A (X) := A X + XA Suppose A is diagonalizable (what follows can be generalized even if this is not possible -
More informationMarch 5, 2012 MATH 408 FINAL EXAM SAMPLE
March 5, 202 MATH 408 FINAL EXAM SAMPLE Partial Solutions to Sample Questions (in progress) See the sample questions for the midterm exam, but also consider the following questions. Obviously, a final
More informationMath 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.
Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,
More informationMath Ordinary Differential Equations
Math 411 - Ordinary Differential Equations Review Notes - 1 1 - Basic Theory A first order ordinary differential equation has the form x = f(t, x) (11) Here x = dx/dt Given an initial data x(t 0 ) = x
More informationIr O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )
Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O
More informationHomework If the inverse T 1 of a closed linear operator exists, show that T 1 is a closed linear operator.
Homework 3 1 If the inverse T 1 of a closed linear operator exists, show that T 1 is a closed linear operator Solution: Assuming that the inverse of T were defined, then we will have to have that D(T 1
More informationIf Y and Y 0 satisfy (1-2), then Y = Y 0 a.s.
20 6. CONDITIONAL EXPECTATION Having discussed at length the limit theory for sums of independent random variables we will now move on to deal with dependent random variables. An important tool in this
More informationGramians based model reduction for hybrid switched systems
Gramians based model reduction for hybrid switched systems Y. Chahlaoui Younes.Chahlaoui@manchester.ac.uk Centre for Interdisciplinary Computational and Dynamical Analysis (CICADA) School of Mathematics
More informationIn English, this means that if we travel on a straight line between any two points in C, then we never leave C.
Convex sets In this section, we will be introduced to some of the mathematical fundamentals of convex sets. In order to motivate some of the definitions, we will look at the closest point problem from
More informationDenis ARZELIER arzelier
COURSE ON LMI OPTIMIZATION WITH APPLICATIONS IN CONTROL PART II.2 LMIs IN SYSTEMS CONTROL STATE-SPACE METHODS PERFORMANCE ANALYSIS and SYNTHESIS Denis ARZELIER www.laas.fr/ arzelier arzelier@laas.fr 15
More informationCompact operators on Banach spaces
Compact operators on Banach spaces Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto November 12, 2017 1 Introduction In this note I prove several things about compact
More informationL. Vandenberghe EE236C (Spring 2016) 18. Symmetric cones. definition. spectral decomposition. quadratic representation. log-det barrier 18-1
L. Vandenberghe EE236C (Spring 2016) 18. Symmetric cones definition spectral decomposition quadratic representation log-det barrier 18-1 Introduction This lecture: theoretical properties of the following
More informationMath Linear Algebra II. 1. Inner Products and Norms
Math 342 - Linear Algebra II Notes 1. Inner Products and Norms One knows from a basic introduction to vectors in R n Math 254 at OSU) that the length of a vector x = x 1 x 2... x n ) T R n, denoted x,
More information2. 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 informationISOLATED SEMIDEFINITE SOLUTIONS OF THE CONTINUOUS-TIME ALGEBRAIC RICCATI EQUATION
ISOLATED SEMIDEFINITE SOLUTIONS OF THE CONTINUOUS-TIME ALGEBRAIC RICCATI EQUATION Harald K. Wimmer 1 The set of all negative-semidefinite solutions of the CARE A X + XA + XBB X C C = 0 is homeomorphic
More information6.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 informationLinear System Theory
Linear System Theory Wonhee Kim Chapter 6: Controllability & Observability Chapter 7: Minimal Realizations May 2, 217 1 / 31 Recap State space equation Linear Algebra Solutions of LTI and LTV system Stability
More informationFEL3210 Multivariable Feedback Control
FEL3210 Multivariable Feedback Control Lecture 8: Youla parametrization, LMIs, Model Reduction and Summary [Ch. 11-12] Elling W. Jacobsen, Automatic Control Lab, KTH Lecture 8: Youla, LMIs, Model Reduction
More informationJordan-algebraic aspects of optimization:randomization
Jordan-algebraic aspects of optimization:randomization L. Faybusovich, Department of Mathematics, University of Notre Dame, 255 Hurley Hall, Notre Dame, IN, 46545 June 29 2007 Abstract We describe a version
More informationConvexity of the Reachable Set of Nonlinear Systems under L 2 Bounded Controls
1 1 Convexity of the Reachable Set of Nonlinear Systems under L 2 Bounded Controls B.T.Polyak Institute for Control Science, Moscow, Russia e-mail boris@ipu.rssi.ru Abstract Recently [1, 2] the new convexity
More informationChapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors
Chapter 7 Canonical Forms 7.1 Eigenvalues and Eigenvectors Definition 7.1.1. Let V be a vector space over the field F and let T be a linear operator on V. An eigenvalue of T is a scalar λ F such that there
More informationINF-SUP CONDITION FOR OPERATOR EQUATIONS
INF-SUP CONDITION FOR OPERATOR EQUATIONS LONG CHEN We study the well-posedness of the operator equation (1) T u = f. where T is a linear and bounded operator between two linear vector spaces. We give equivalent
More informationSPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS
SPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS TSOGTGEREL GANTUMUR Abstract. After establishing discrete spectra for a large class of elliptic operators, we present some fundamental spectral properties
More informationSpectral theory for compact operators on Banach spaces
68 Chapter 9 Spectral theory for compact operators on Banach spaces Recall that a subset S of a metric space X is precompact if its closure is compact, or equivalently every sequence contains a Cauchy
More informationChap. 3. Controlled Systems, Controllability
Chap. 3. Controlled Systems, Controllability 1. Controllability of Linear Systems 1.1. Kalman s Criterion Consider the linear system ẋ = Ax + Bu where x R n : state vector and u R m : input vector. A :
More informationLecture 9 Monotone VIs/CPs Properties of cones and some existence results. October 6, 2008
Lecture 9 Monotone VIs/CPs Properties of cones and some existence results October 6, 2008 Outline Properties of cones Existence results for monotone CPs/VIs Polyhedrality of solution sets Game theory:
More informationChapter 1 Foundations of Elliptic Boundary Value Problems 1.1 Euler equations of variational problems
Chapter 1 Foundations of Elliptic Boundary Value Problems 1.1 Euler equations of variational problems Elliptic boundary value problems often occur as the Euler equations of variational problems the latter
More informationUsing Schur Complement Theorem to prove convexity of some SOC-functions
Journal of Nonlinear and Convex Analysis, vol. 13, no. 3, pp. 41-431, 01 Using Schur Complement Theorem to prove convexity of some SOC-functions Jein-Shan Chen 1 Department of Mathematics National Taiwan
More informationNORMS ON SPACE OF MATRICES
NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system
More informationPutzer s Algorithm. Norman Lebovitz. September 8, 2016
Putzer s Algorithm Norman Lebovitz September 8, 2016 1 Putzer s algorithm The differential equation dx = Ax, (1) dt where A is an n n matrix of constants, possesses the fundamental matrix solution exp(at),
More informationControllability, Observability, Full State Feedback, Observer Based Control
Multivariable Control Lecture 4 Controllability, Observability, Full State Feedback, Observer Based Control John T. Wen September 13, 24 Ref: 3.2-3.4 of Text Controllability ẋ = Ax + Bu; x() = x. At time
More informationLagrange Duality. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST)
Lagrange Duality Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2017-18, HKUST, Hong Kong Outline of Lecture Lagrangian Dual function Dual
More informationNONTRIVIAL SOLUTIONS FOR SUPERQUADRATIC NONAUTONOMOUS PERIODIC SYSTEMS. Shouchuan Hu Nikolas S. Papageorgiou. 1. Introduction
Topological Methods in Nonlinear Analysis Journal of the Juliusz Schauder Center Volume 34, 29, 327 338 NONTRIVIAL SOLUTIONS FOR SUPERQUADRATIC NONAUTONOMOUS PERIODIC SYSTEMS Shouchuan Hu Nikolas S. Papageorgiou
More informationInner product spaces. Layers of structure:
Inner product spaces Layers of structure: vector space normed linear space inner product space The abstract definition of an inner product, which we will see very shortly, is simple (and by itself is pretty
More informationConvex Optimization M2
Convex Optimization M2 Lecture 3 A. d Aspremont. Convex Optimization M2. 1/49 Duality A. d Aspremont. Convex Optimization M2. 2/49 DMs DM par email: dm.daspremont@gmail.com A. d Aspremont. Convex Optimization
More informationGoal. Robust A Posteriori Error Estimates for Stabilized Finite Element Discretizations of Non-Stationary Convection-Diffusion Problems.
Robust A Posteriori Error Estimates for Stabilized Finite Element s of Non-Stationary Convection-Diffusion Problems L. Tobiska and R. Verfürth Universität Magdeburg Ruhr-Universität Bochum www.ruhr-uni-bochum.de/num
More informationStability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games
Stability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games Alberto Bressan ) and Khai T. Nguyen ) *) Department of Mathematics, Penn State University **) Department of Mathematics,
More informationOptimality Conditions for Constrained Optimization
72 CHAPTER 7 Optimality Conditions for Constrained Optimization 1. First Order Conditions In this section we consider first order optimality conditions for the constrained problem P : minimize f 0 (x)
More information4 Linear operators and linear functionals
4 Linear operators and linear functionals The next section is devoted to studying linear operators between normed spaces. Definition 4.1. Let V and W be normed spaces over a field F. We say that T : V
More informationNormed & Inner Product Vector Spaces
Normed & Inner Product Vector Spaces ECE 174 Introduction to Linear & Nonlinear Optimization Ken Kreutz-Delgado ECE Department, UC San Diego Ken Kreutz-Delgado (UC San Diego) ECE 174 Fall 2016 1 / 27 Normed
More informationA Concise Course on Stochastic Partial Differential Equations
A Concise Course on Stochastic Partial Differential Equations Michael Röckner Reference: C. Prevot, M. Röckner: Springer LN in Math. 1905, Berlin (2007) And see the references therein for the original
More informationProblem Set 6: Solutions Math 201A: Fall a n x n,
Problem Set 6: Solutions Math 201A: Fall 2016 Problem 1. Is (x n ) n=0 a Schauder basis of C([0, 1])? No. If f(x) = a n x n, n=0 where the series converges uniformly on [0, 1], then f has a power series
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science : Dynamic Systems Spring 2011
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.4: Dynamic Systems Spring Homework Solutions Exercise 3. a) We are given the single input LTI system: [
More informationRegularity and approximations of generalized equations; applications in optimal control
SWM ORCOS Operations Research and Control Systems Regularity and approximations of generalized equations; applications in optimal control Vladimir M. Veliov (Based on joint works with A. Dontchev, M. Krastanov,
More informationMay 9, 2014 MATH 408 MIDTERM EXAM OUTLINE. Sample Questions
May 9, 24 MATH 48 MIDTERM EXAM OUTLINE This exam will consist of two parts and each part will have multipart questions. Each of the 6 questions is worth 5 points for a total of points. The two part of
More informationOn rank one perturbations of Hamiltonian system with periodic coefficients
On rank one perturbations of Hamiltonian system with periodic coefficients MOUHAMADOU DOSSO Université FHB de Cocody-Abidjan UFR Maths-Info., BP 58 Abidjan, CÔTE D IVOIRE mouhamadou.dosso@univ-fhb.edu.ci
More informationFall TMA4145 Linear Methods. Exercise set 10
Norwegian University of Science and Technology Department of Mathematical Sciences TMA445 Linear Methods Fall 207 Exercise set 0 Please justify your answers! The most important part is how you arrive at
More informationChapter 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 informationRobust Stability. Robust stability against time-invariant and time-varying uncertainties. Parameter dependent Lyapunov functions
Robust Stability Robust stability against time-invariant and time-varying uncertainties Parameter dependent Lyapunov functions Semi-infinite LMI problems From nominal to robust performance 1/24 Time-Invariant
More informationFunctional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...
Functional Analysis Franck Sueur 2018-2019 Contents 1 Metric spaces 1 1.1 Definitions........................................ 1 1.2 Completeness...................................... 3 1.3 Compactness......................................
More informationApplied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in
More informationLecture 6. Foundations of LMIs in System and Control Theory
Lecture 6. Foundations of LMIs in System and Control Theory Ivan Papusha CDS270 2: Mathematical Methods in Control and System Engineering May 4, 2015 1 / 22 Logistics hw5 due this Wed, May 6 do an easy
More information16.31 Fall 2005 Lecture Presentation Mon 31-Oct-05 ver 1.1
16.31 Fall 2005 Lecture Presentation Mon 31-Oct-05 ver 1.1 Charles P. Coleman October 31, 2005 1 / 40 : Controllability Tests Observability Tests LEARNING OUTCOMES: Perform controllability tests Perform
More informationFunctional Analysis Review
Outline 9.520: Statistical Learning Theory and Applications February 8, 2010 Outline 1 2 3 4 Vector Space Outline A vector space is a set V with binary operations +: V V V and : R V V such that for all
More informationUSE OF SEMIDEFINITE PROGRAMMING FOR SOLVING THE LQR PROBLEM SUBJECT TO RECTANGULAR DESCRIPTOR SYSTEMS
Int. J. Appl. Math. Comput. Sci. 21 Vol. 2 No. 4 655 664 DOI: 1.2478/v16-1-48-9 USE OF SEMIDEFINITE PROGRAMMING FOR SOLVING THE LQR PROBLEM SUBJECT TO RECTANGULAR DESCRIPTOR SYSTEMS MUHAFZAN Department
More informationConvex Optimization & Parsimony of L p-balls representation
Convex Optimization & Parsimony of L p -balls representation LAAS-CNRS and Institute of Mathematics, Toulouse, France IMA, January 2016 Motivation Unit balls associated with nonnegative homogeneous polynomials
More informationLargest dual ellipsoids inscribed in dual cones
Largest dual ellipsoids inscribed in dual cones M. J. Todd June 23, 2005 Abstract Suppose x and s lie in the interiors of a cone K and its dual K respectively. We seek dual ellipsoidal norms such that
More informationRaktim Bhattacharya. . AERO 632: Design of Advance Flight Control System. Norms for Signals and Systems
. AERO 632: Design of Advance Flight Control System Norms for Signals and. Raktim Bhattacharya Laboratory For Uncertainty Quantification Aerospace Engineering, Texas A&M University. Norms for Signals ...
More informationPROBLEMS. (b) (Polarization Identity) Show that in any inner product space
1 Professor Carl Cowen Math 54600 Fall 09 PROBLEMS 1. (Geometry in Inner Product Spaces) (a) (Parallelogram Law) Show that in any inner product space x + y 2 + x y 2 = 2( x 2 + y 2 ). (b) (Polarization
More informationDO NOT OPEN THIS QUESTION BOOKLET UNTIL YOU ARE TOLD TO DO SO
QUESTION BOOKLET EECS 227A Fall 2009 Midterm Tuesday, Ocotober 20, 11:10-12:30pm DO NOT OPEN THIS QUESTION BOOKLET UNTIL YOU ARE TOLD TO DO SO You have 80 minutes to complete the midterm. The midterm consists
More informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More informationOn the projection onto a finitely generated cone
Acta Cybernetica 00 (0000) 1 15. On the projection onto a finitely generated cone Miklós Ujvári Abstract In the paper we study the properties of the projection onto a finitely generated cone. We show for
More informationDeterministic Dynamic Programming
Deterministic Dynamic Programming 1 Value Function Consider the following optimal control problem in Mayer s form: V (t 0, x 0 ) = inf u U J(t 1, x(t 1 )) (1) subject to ẋ(t) = f(t, x(t), u(t)), x(t 0
More informationZ i Q ij Z j. J(x, φ; U) = X T φ(t ) 2 h + where h k k, H(t) k k and R(t) r r are nonnegative definite matrices (R(t) is uniformly in t nonsingular).
2. LINEAR QUADRATIC DETERMINISTIC PROBLEM Notations: For a vector Z, Z = Z, Z is the Euclidean norm here Z, Z = i Z2 i is the inner product; For a vector Z and nonnegative definite matrix Q, Z Q = Z, QZ
More informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
More informationStrong Duality and Dual Pricing Properties in Semi-infinite Linear Programming A Non-Fourier-Motzkin Elimination Approach
Strong Duality and Dual Pricing Properties in Semi-infinite Linear Programming A Non-Fourier-Motzkin Elimination Approach Qinghong Zhang Department of Mathematics and Computer Science Northern Michigan
More informationOptimization: Interior-Point Methods and. January,1995 USA. and Cooperative Research Centre for Robust and Adaptive Systems.
Innite Dimensional Quadratic Optimization: Interior-Point Methods and Control Applications January,995 Leonid Faybusovich John B. Moore y Department of Mathematics University of Notre Dame Mail Distribution
More informationNOTES ON LINEAR ODES
NOTES ON LINEAR ODES JONATHAN LUK We can now use all the discussions we had on linear algebra to study linear ODEs Most of this material appears in the textbook in 21, 22, 23, 26 As always, this is a preliminary
More informationAn interior-point trust-region polynomial algorithm for convex programming
An interior-point trust-region polynomial algorithm for convex programming Ye LU and Ya-xiang YUAN Abstract. An interior-point trust-region algorithm is proposed for minimization of a convex quadratic
More informationLinear Ordinary Differential Equations
MTH.B402; Sect. 1 20180703) 2 Linear Ordinary Differential Equations Preliminaries: Matrix Norms. Denote by M n R) the set of n n matrix with real components, which can be identified the vector space R
More informationLinear Algebra Massoud Malek
CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product
More informationSPECTRAL THEORY EVAN JENKINS
SPECTRAL THEORY EVAN JENKINS Abstract. These are notes from two lectures given in MATH 27200, Basic Functional Analysis, at the University of Chicago in March 2010. The proof of the spectral theorem for
More informationFinal Exam Solutions
EE55: Linear Systems Final Exam SIST, ShanghaiTech Final Exam Solutions Course: Linear Systems Teacher: Prof. Boris Houska Duration: 85min YOUR NAME: (type in English letters) I Introduction This exam
More informationStabilization of Heat Equation
Stabilization of Heat Equation Mythily Ramaswamy TIFR Centre for Applicable Mathematics, Bangalore, India CIMPA Pre-School, I.I.T Bombay 22 June - July 4, 215 Mythily Ramaswamy Stabilization of Heat Equation
More informationLecture 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 informationLecture 4 Continuous time linear quadratic regulator
EE363 Winter 2008-09 Lecture 4 Continuous time linear quadratic regulator continuous-time LQR problem dynamic programming solution Hamiltonian system and two point boundary value problem infinite horizon
More information(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define
Homework, Real Analysis I, Fall, 2010. (1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define ρ(f, g) = 1 0 f(x) g(x) dx. Show that
More informationAlgebra C Numerical Linear Algebra Sample Exam Problems
Algebra C Numerical Linear Algebra Sample Exam Problems Notation. Denote by V a finite-dimensional Hilbert space with inner product (, ) and corresponding norm. The abbreviation SPD is used for symmetric
More informationTrace Class Operators and Lidskii s Theorem
Trace Class Operators and Lidskii s Theorem Tom Phelan Semester 2 2009 1 Introduction The purpose of this paper is to provide the reader with a self-contained derivation of the celebrated Lidskii Trace
More informationAn inexact subgradient algorithm for Equilibrium Problems
Volume 30, N. 1, pp. 91 107, 2011 Copyright 2011 SBMAC ISSN 0101-8205 www.scielo.br/cam An inexact subgradient algorithm for Equilibrium Problems PAULO SANTOS 1 and SUSANA SCHEIMBERG 2 1 DM, UFPI, Teresina,
More information