Copositive matrices and periodic dynamical systems

Similar documents
On the structure of the 5 x 5 copositive cone

The extreme rays of the 5 5 copositive cone

Lecture 7: Positive Semidefinite Matrices

Scaling relationship between the copositive cone and Parrilo s first level approximation

MATH 320: PRACTICE PROBLEMS FOR THE FINAL AND SOLUTIONS

Considering Copositivity Locally

YORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #1. July 11, 2013 Solutions

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.

Copositive Plus Matrices

ELA

Math 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination

JORDAN NORMAL FORM. Contents Introduction 1 Jordan Normal Form 1 Conclusion 5 References 5

Chapter 1. Preliminaries

Convexity of the Joint Numerical Range

MIT Algebraic techniques and semidefinite optimization May 9, Lecture 21. Lecturer: Pablo A. Parrilo Scribe:???

ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA

Duke University, Department of Electrical and Computer Engineering Optimization for Scientists and Engineers c Alex Bronstein, 2014

Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5

Foundations of Matrix Analysis

Math Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88

Linear Algebra: Characteristic Value Problem

Lecture 1: Systems of linear equations and their solutions

1 Linear Algebra Problems

Problems in Linear Algebra and Representation Theory

Multivariate Statistical Analysis

Lecture 2: Linear Algebra Review

On approximations, complexity, and applications for copositive programming Gijben, Luuk

Elementary linear algebra

Exercise Sheet 1.

Properties of Matrices and Operations on Matrices

A Little Beyond: Linear Algebra

Linear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8.

MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix.

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

Topics in Graph Theory

Scaling of Symmetric Matrices by Positive Diagonal Congruence

NORMS ON SPACE OF MATRICES

1. General Vector Spaces

Mic ael Flohr Representation theory of semi-simple Lie algebras: Example su(3) 6. and 20. June 2003

Conceptual Questions for Review

j=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent.

3. Vector spaces 3.1 Linear dependence and independence 3.2 Basis and dimension. 5. Extreme points and basic feasible solutions

c Igor Zelenko, Fall

Linear Algebra Review. Vectors

Matrix Theory, Math6304 Lecture Notes from October 25, 2012

Math 121 Homework 4: Notes on Selected Problems

Mathematical foundations - linear algebra

Advanced Mathematical Programming IE417. Lecture 24. Dr. Ted Ralphs

Study Guide for Linear Algebra Exam 2

A New Certificate For Copositivity

Chapter Two Elements of Linear Algebra

WOMP 2001: LINEAR ALGEBRA. 1. Vector spaces

Fall 2016 MATH*1160 Final Exam

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM

LINEAR ALGEBRA REVIEW

1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det

ELE/MCE 503 Linear Algebra Facts Fall 2018

(f + g)(s) = f(s) + g(s) for f, g V, s S (cf)(s) = cf(s) for c F, f V, s S

Stat 159/259: Linear Algebra Notes

2. Every linear system with the same number of equations as unknowns has a unique solution.

Semidefinite Programming

Algebraic aspects of Hadamard matrices

Math 408 Advanced Linear Algebra

homogeneous 71 hyperplane 10 hyperplane 34 hyperplane 69 identity map 171 identity map 186 identity map 206 identity matrix 110 identity matrix 45

Review problems for MA 54, Fall 2004.

I. Multiple Choice Questions (Answer any eight)

1 Invariant subspaces

LINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS

An LMI description for the cone of Lorentz-positive maps II

1 Last time: least-squares problems

Symmetric and self-adjoint matrices

Chapter 1: Systems of Linear Equations

A proof of the Jordan normal form theorem

Semidefinite Programming Basics and Applications

Approximation Algorithms

4 Film Extension of the Dynamics: Slowness as Stability

IDEAL CLASSES AND RELATIVE INTEGERS

E2 212: Matrix Theory (Fall 2010) Solutions to Test - 1

Solutions to Final Exam

Chapter 1. Matrix Algebra

LMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009

Chapter 2 Spectra of Finite Graphs

L(C G (x) 0 ) c g (x). Proof. Recall C G (x) = {g G xgx 1 = g} and c g (x) = {X g Ad xx = X}. In general, it is obvious that

Chapter 4 Euclid Space

Chapter 5 Eigenvalues and Eigenvectors

Linear Algebra Massoud Malek

The Singular Value Decomposition and Least Squares Problems

Linear algebra 2. Yoav Zemel. March 1, 2012

Homework 2. Solutions T =

REPRESENTATION THEORY WEEK 7

Vectors To begin, let us describe an element of the state space as a point with numerical coordinates, that is x 1. x 2. x =

APPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.

Chapter 1 Vector Spaces

MATH 583A REVIEW SESSION #1

Lecture Summaries for Linear Algebra M51A

Absolute value equations

Vector spaces. EE 387, Notes 8, Handout #12

Math 113 Winter 2013 Prof. Church Midterm Solutions

Math 121 Homework 5: Notes on Selected Problems

MATH SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER Given vector spaces V and W, V W is the vector space given by

Transcription:

Extreme copositive matrices and periodic dynamical systems Weierstrass Institute (WIAS), Berlin Optimization without borders Dedicated to Yuri Nesterovs 60th birthday February 11, 2016 and periodic dynamical systems

Outline 1 Definition and general properties Zeros and zero patterns 2 and periodic dynamical systems

Copositive cone Definition and general properties Zeros and zero patterns Definition A real symmetric n n matrix A such that x T Ax 0 for all x R n + is called copositive. the set of all such matrices is a regular convex cone, the copositive cone C n related cones completely positive cone C n = conv{xx T x 0} sum N n +S n + of nonnegative and positive semi-definite cone doubly nonnegative cone N n S + n C n N n S + n N n +S + n C n and periodic dynamical systems

NP-hardness Definition and general properties Zeros and zero patterns Theorem (Murty, Kabadi 1987) Checking whether an n n integer matrix is not copositive is NP-complete. Theorem (Burer 2009) Any mixed binary-continuous optimization problem with linear constraints and (non-convex) quadratic objective function can be written as a copositive program min c, x : x C n Ax = b and periodic dynamical systems

Description in low dimensions Definition and general properties Zeros and zero patterns Theorem (Diananda 1962) Let n 4. Then the copositive cone C n equals the sum of the nonnegative cone N n and the positive semi-definite cone S + n. the Horn form (discovered by Alfred Horn) 1 1 1 1 1 1 1 1 1 1 H = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 is an example of a matrix in C 5 \(N 5 +S + 5 ) matrices in C n \(N n +S + n ) are called exceptional and periodic dynamical systems

Dimension 5 Definition and general properties Zeros and zero patterns Theorem (Dickinson, Dür, Gijben, H. 2013) The linear affine section D 5,1 = {A C 5 diag(a) = 1} possesses a semi-definite description: A D 5,1 if and only if the 6-th order polynomial on R 5 given by p A (x) = is a sum of squares. 5 A ij x 2 i,j=1 i xj 2 ( 5 k=1 every copositive matrix A with diag A > 0 can be diagonally scaled to a copositive matrix A = DAD with diag A = 1 for every matrix A C 5 \(N 5 +S 5 + ) there exists a positive definite diagonal matrix D such that p DAD is not SOS x 2 k ) and periodic dynamical systems

Extreme rays Definition and general properties Zeros and zero patterns Definition Let K R n be a regular convex cone. An nonzero element u K is called extreme if it cannot be decomposed into a non-trivial sum of linearly independent elements of K. in [Hall, Newman 63] the extreme rays of C n belonging to N n +S n + have been described: the extreme rays of N n, generated by E ii and E ij + E ji rank 1 matrices A = xx T with x having both positive and negative elements in [Hoffman, Pereira 1973] the extreme elements of C n with elements in { 1, 0, +1} have been described and periodic dynamical systems

Dimension 5 Definition and general properties Zeros and zero patterns Theorem (H. 2012) The extreme elements A C 5 \(N 5 +S + 5 ) of C 5 are exactly the matrices DPMP T D, where D is a diagonal positive definite matrix, P is a permutation matrix, and M is either the Horn form H or is given by a matrix T = 1 cosψ 4 cos(ψ 4 +ψ 5 ) cos(ψ 2 +ψ 3 ) cosψ 3 cosψ 4 1 cosψ 5 cos(ψ 5 +ψ 1 ) cos(ψ 3 +ψ 4 ) cos(ψ 4 +ψ 5 ) cosψ 5 1 cosψ 1 cos(ψ 1 +ψ 2 ) cos(ψ 2 +ψ 3 ) cos(ψ 5 +ψ 1 ) cosψ 1 1 cosψ 2 cosψ 3 cos(ψ 3 +ψ 4 ) cos(ψ 1 +ψ 2 ) cosψ 2 1 where ψ k > 0 for k = 1,...,5 and 5 k=1 ψ k < π., and periodic dynamical systems

Definition (Baumert 1965) Definition and general properties Zeros and zero patterns let A C n be a copositive matrix a non-zero vector x 0 is called a zero of A if x T Ax = 0 the set supp x = {i x i > 0} is called the support of x the set V A = {supp x x is a zero of A} is called the zero pattern of A Example: Horn form 1 1 1 1 1 a 1 1 1 1 1 H = 1 1 1 1 1 1 1 1 1 1 : x = a+b b 0, a, b 0, a+b > 0 1 1 1 1 1 0 and cyclically permuted vectors V H consists of {1, 2},{1, 2, 3} and cyclically permuted sets and periodic dynamical systems

Example: T-matrix Definition and general properties Zeros and zero patterns T = 1 cosψ 4 cos(ψ 4 +ψ 5 ) cos(ψ 2 +ψ 3 ) cosψ 3 cosψ 4 1 cosψ 5 cos(ψ 5 +ψ 1 ) cos(ψ 3 +ψ 4 ) cos(ψ 4 +ψ 5 ) cosψ 5 1 cosψ 1 cos(ψ 1 +ψ 2 ) cos(ψ 2 +ψ 3 ) cos(ψ 5 +ψ 1 ) cosψ 1 1 cosψ 2 cosψ 3 cos(ψ 3 +ψ 4 ) cos(ψ 1 +ψ 2 ) cosψ 2 1 has zeros given by the columns of the matrix sinψ 5 0 0 sinψ 2 sin(ψ 3 +ψ 4 ) sin(ψ 4 +ψ 5 ) sinψ 1 0 0 sinψ 3 sinψ 4 sin(ψ 1 +ψ 5 ) sinψ 2 0 0 0 sinψ 5 sin(ψ 1 +ψ 2 ) sinψ 3 0 0 0 sinψ 1 sin(ψ 2 +ψ 3 ) sinψ 4 and homothetic images the zero pattern is {{1,2,3},{2,3,4},{3,4,5},{4,5,1},{5,1,2}} and periodic dynamical systems

Properties Definition and general properties Zeros and zero patterns Theorem (Diananda 1962) Let A C n be a copositive matrix, let x be a zero of A, and let I = supp x. Then the principal submatrix A I,I is positive semi-definite. Theorem (Baumert 1966) Let A be a copositive matrix and let x be a zero of A. Then Ax 0. if A, B C n and x is a zero of A+B, then x is a zero of A and B (Baumert 1965) if x is a zero of A C n and supp x n 1, then A N n +S + n and periodic dynamical systems

Outline 1 Definition and general properties Zeros and zero patterns 2 and periodic dynamical systems

Framework scalar discrete-time time-variant dynamical system d 1 x t+d + c t,i x t+i = 0, t 0 i=0 coefficients n-periodic, c t+n,i = c t,i solution space L is d-dimensional, n > d L can be parameterized by initial values x 0,...,x d 1 if c t,0 0 for all t, then the system is reversible and periodic dynamical systems

Monodromy let x = (x t ) t 0 be a solution then y = (x t+n ) t 0 is also a solution Definition The linear map M : L L taking x to y is called the monodromy of the periodic system. Its eigenvalues are called Floquet multipliers. x is periodic if and only if it is an eigenvector of M with eigenvalue 1 detm = ( 1) nd n 1 t=0 c t,0 and periodic dynamical systems

Evaluation functionals let x = (x t ) t 0 be a solution for every t, define a linear map e t by e t (x) = x t e t belongs to the dual space L e t+n = M e t e 0,...,e d 1 span L e t evolves according to d 1 e t+d + c t,i e t+i = 0 i=0 and periodic dynamical systems

Shift-invariant forms Definition A symmetric bilinear form B on L is called shift-invariant if B(e t+n, e s+n ) = B(e t, e s ) t, s 0 B is shift-invariant if and only if B(w, w ) = B(M w,m w ) for all w, w L B = x x for x periodic are shift-invariant a positive semi-definite form B is shift-invariant if and only if M[(ker B) ] = (ker B) and the restriction of M to (ker B) is similar to a unitary operator in particular, n dim ker B eigenvalues of M lie on the unit circle and periodic dynamical systems

let n 5 and let u = {u 1,...,u n } R n + with supp u 1 = {1, 2,..., n 2} =: I 1 supp u 2 = {2, 3,..., n 1} =: I 2. supp u n = {n, 1,..., n 3} =: I n supports form an orbit under circular shift a copositive matrix having such zeros might not exist and periodic dynamical systems

Associated dynamical system to a collection u of nonnegative vectors u 1,..., u n with supp u k = I k associate an n-periodic dynamical system d c t,i x t+i = 0 i=0 with c t = (u t ) It, t = 1,...,n order d = n 3 system is reversible all coefficients are positive detm = n j=1 uj j / n j=1 uj j+d > 0 and periodic dynamical systems

Periodic solutions let L per be the subspace of periodic solutions Lemma An n-periodic infinite sequence x = (x 0, x 1,...) is a solution if and only if the vector (x 1,..., x n ) T R n is orthogonal to all zeros u j, j = 1,...,n. In particular, diml per equals the corank of the matrix U composed of u 1,...,u n. corank of U = multiplicity of Floquet multiplier 1 and periodic dynamical systems

Example: zeros of T -matrix n = 5, d = 2, u given by columns of sinψ 5 0 0 sinψ 2 sin(ψ 3 +ψ 4 ) sin(ψ 4 +ψ 5 ) sinψ 1 0 0 sinψ 3 sinψ 4 sin(ψ 1 +ψ 5 ) sinψ 2 0 0 0 sinψ 5 sin(ψ 1 +ψ 2 ) sinψ 3 0 0 0 sinψ 1 sin(ψ 2 +ψ 3 ) sinψ 4 linearly independent solutions of the associated dynamical system are given by x 1 =(1, cosψ 4,cos(ψ 4 +ψ 5 ), cos(ψ 4 +ψ 5 +ψ 1 ),cos(ψ 4 +ψ 5 +ψ 1 +ψ 2 ),...) x 2 =(0,sinψ 4, sin(ψ 4 +ψ 5 ),sin(ψ 4 +ψ 5 +ψ 1 ), sin(ψ 4 +ψ 5 +ψ 1 +ψ 2 ),...) and periodic dynamical systems

Main correspondence let A u S n be the linear subspace of symmetric n n matrices A satisfying (Au k ) Ik = 0 to every A A u associate a symmetric bilinear form B on the dual solution space L by B(e t, e s ) = A ts, t, s = 1,...,d let Λ : A B be the corresponding linear map for A being copositive Au k 0 is a necessary condition Λ maps quadratic forms on R n to quadratic forms on R d and periodic dynamical systems

Image of Λ Lemma The linear map Λ is injective and its image consists of those shift-invariant symmetric bilinear forms B which satisfy B(e t, e s ) = B(e t+n, e s ) t, s 0 : 3 s t n 3 the image of Λ may be {0} effectively finite number of linear conditions and periodic dynamical systems

with zeros u Theorem Let F u be the set of positive semi-definite shift-invariant symmetric bilinear forms B on L u satisfying the linear equality relations B(e t, e s ) = B(e t+n, e s ), 0 t < s < n : 3 s t n 3 and the linear inequalities B(e t, e t+2 ) B(e t+n, e t+2 ), t = 0,..., n 1. Then the face of C n defined by the zeros u j, j = 1,...,n, is given by F u = Λ 1 [F u ]. and periodic dynamical systems

Consequences the face of C n defined by u is given by linear equality and inequality constraints and a semi-definite constraint Corollary Given a vector set u = {u 1,..., u n } R n +, we can compute the face F u of the copositive cone C n which consists of matrices having u 1,..., u n as zeros by a semi-definite program. matrices in F u might have also other zeros a generic vector set will yield only the trivial solution set {0} and periodic dynamical systems

Periodic solutions Lemma Let x be an n-periodic solution, then the form B = x x is contained in the image of Λ and A = Λ 1 (B) is positive semi-definite and given by A = (B(e t, e s )) t,s=1,...,n. let P u be the convex hull of all forms x x, x an n-periodic solution the subset P u F u of positive semi-definite matrices equals Λ 1 [P u ] the maximal rank achieved by positive semi-definite matrices in F u equals the geometric multiplicity of the Floquet multiplier 1 and periodic dynamical systems

Maximal rank of bilinear forms Theorem if the maximal rank r max of the bilinear forms in the feasible set F u does not exceed d 2, then F u = P u S+ rmax if r max = d 1, then either F u = P u S+ rmax, or dim F u = 1 and F u is an exceptional extreme ray if r max = d, then F u = P u S+ rmax if and only if M = Id if and only if u 1,..., u n span a 3-dimensional space the exceptional extreme matrices in the case r max = d 1 are generalizations of the Horn form and periodic dynamical systems

Full rank, even n Theorem Let n be even, suppose the face F u contains an exceptional copositive matrix and the feasible set F u contains a positive definite form. Then F u R 2 +, one boundary ray is generated by a rank 1 positive semi-definite matrix, and the other boundary ray is generated by an extreme exceptional copositive matrix. examples of this kind appear for n 6 and periodic dynamical systems

Full rank, n odd Theorem Let n be odd, suppose the face F u contains an exceptional matrix and the feasible set F u contains a positive definite form. Then F u does not contain non-zero positive semi-definite matrices. If F u is 1-dimensional, then it is generated by an extreme exceptional copositive matrix. This matrix has no zeros other than the multiples of u 1,...,u n. If dim F u > 1, then the monodromym possesses the eigenvalue 1, and all boundary rays of F u are generated by extreme exceptional copositive matrices. the case dim F u = 1 generalizes the T -matrices and periodic dynamical systems

Existence of submanifolds of extreme rays Theorem For arbitrary n 5 there exists a submanifold M 2n C n of codimension 2n, consisting of exceptional extreme matrices A each of which has zeros u 1,...,u n with supports I 1,..., I n, and such that the submatrices A Ik,I k have rank n 4. Let n 5 be odd. Then there exists a submanifold M n C n of codimension n, consisting of exceptional extreme matrices A each of which has zeros u 1,...,u n with supports I 1,..., I n, and such that the submatrices A Ik,I k have rank n 3. and periodic dynamical systems

Thank you! and periodic dynamical systems