The eigenvalue map and spectral sets
|
|
- Eustace Flowers
- 5 years ago
- Views:
Transcription
1 The eigenvalue map and spectral sets p. 1/30 The eigenvalue map and spectral sets M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland *************** International Conference on complementarity problems and related topics Beijing Jiaotong University May 18-19, 2016 (Joint work with Juyoung Jeong)
2 The eigenvalue map and spectral sets p. 2/30 Motivation Let S n = Space of all n n real symmetric matrices, S n + = the semidefinite cone. For X S n, let λ (X) and λ (X) denote respectively, the vectors of eigenvalues of X written in the decreasing and increasing order. Suppose (X,Y) is a complementary pair with respect to S+: n X S+, n Y S+, n and X,Y = 0. Then X and Y commute: X = U diag(x 1,x 2,...,x n )U T and Y = U diag(y 1,y 2,...,y n )U T.
3 The eigenvalue map and spectral sets p. 3/30 Here, U is orthogonal and x 1,x 2,...,x n are eigenvalues of x, etc. Then: x i 0, y i 0, and x i y i = 0 for all i. Thus, λ (X) 0, λ (Y) 0, and λ (X),λ (Y) = 0. So, if (X,Y) is a complementary pair in S+, n then (λ (X),λ (X)) is a complementary pair in R+. n Do we have results of this type in Euclidean Jordan algebras?
4 The eigenvalue map and spectral sets p. 4/30 To simplify notation, let λ(x) := λ (X). Note S+ n = λ 1 (R+) n and R+ n is a permutation invariant closed convex cone. The map λ is nonlinear, yet the inverse image of R+ n under λ is a closed convex cone. This motivates us to explore properties of sets E := λ 1 (Q), where Q is permutation invariant in R n.
5 The eigenvalue map and spectral sets p. 5/30 Outline Permutation invariant sets and cones in R n Euclidean Jordan algebras Spectral sets and cones The transfer principle A dimensionality result Commutation principles Cross complementarity concepts
6 The eigenvalue map and spectral sets p. 6/30 Permutation invariant set in R n A permutation matrix is a 0 1 matrix with exactly one 1 in each row and column. Σ n is the set of all n n permutation matrices. Σ n is a group. A set Q in R n is permutation invariant if σ(q) = Q σ Σ n.
7 The eigenvalue map and spectral sets p. 7/30 Majorization An n n real matrix A is doubly stochastic if is nonnegative and each row/column sum is one. Birkhoff s Theorem: A is doubly stochastic iff it is a convex combination of permutation matrices. For vectors x and y in R n, we say x is majorized by y and write x y if x = Ay for some doubly stochastic matrix A.
8 The eigenvalue map and spectral sets p. 8/30 Examples of permutation invariant sets R n and R+. n {x R n : x 1 +x 2 + +x n = 0}. For p = 1,2,...,n, let s p (x) = sum of smallest p entries of x. Q p := {x R n : s p (x) 0}. Note: R+ n = Q 1 Q 2 Q n. For any nonempty set S in R n, is permutation invariant. Q := Σ n (S)
9 The eigenvalue map and spectral sets p. 9/30 Euclidean Jordan algebra (V,,, ) is a Euclidean Jordan algebra if V is a finite dimensional real inner product space and the bilinear Jordan product x y satisfies: x y = y x x (x 2 y) = x 2 (x y) x y,z = x,y z K = {x 2 : x V} is the symmetric cone in V.
10 The eigenvalue map and spectral sets p. 10/30 Examples of Euclidean Jordan algebras Any EJA is a product of the following: S n = Herm(R n n ) - n n real symmetric matrices. Herm(C n n ) - n n complex Hermitian matrices. Herm(Q n n ) - n n quaternion Hermitian matrices. Herm(O 3 3 ) octonion Hermitian matrices. L n (n 3)- Jordan spin algebra. The above algebras are (the only) simple algebras.
11 The eigenvalue map and spectral sets p. 11/30 The eigenvalue map Spectral representation in an EJA of rank n: x = λ 1 e 1 +λ 2 e λ n e n, where {e 1,e 2,...,e n } is a Jordan frame, λ 1,λ 2,...,λ n are eigenvalues of x. The eigenvalue map λ : V R n is defined by λ(x) := (λ 1,λ 2,...,λ n ), where λ 1 λ 2... λ n. Note: The eigenvalue map is continuous, positive homogeneous, and nonlinear.
12 The eigenvalue map and spectral sets p. 12/30 Spectral sets Let V be a Euclidean Jordan algebra of rank n. A set E in V is a spectral set if for some permutation invariant set Q in R n, E = λ 1 (Q). We will see that λ 1 behaves more like a linear transformation. Examples: A symmetric cone in a EJA, its interior, its boundary are spectral sets.
13 The eigenvalue map and spectral sets p. 13/30 Characterization of spectral sets In V, let x y if λ(x) = λ(y). For a set Q in R n, Q := λ 1 (Q). For a set E in V, let E := Σ n (λ(e)). Theorem: For a set E in V, the following are equivalent: 1. E is a spectral set. 2. x y, y E x E. 3. E = E. Note: Product of spectral sets need not be spectral. Example: R S+ 2 in R S 2.
14 The eigenvalue map and spectral sets p. 14/30 Automorphism invariance A : V V is an automorphism if A is linear, invertible, and A(x y) = Ax Ay. In V = S n, automorphisms are of the form for some orthogonal U. X UXU T Theorem: Every spectral set is automorphism invariant. Converse holds ifv is simple. Note: Converse may not hold in general V.
15 The eigenvalue map and spectral sets p. 15/30 The transfer principle Let Q be permutation invariant set in R n and The transfer principle: E = λ 1 (Q). Describes properties of Q that get transferred to E. We will look at topological, convexity, and linear properties.
16 The eigenvalue map and spectral sets p. 16/30 Topological properties Q is permutation invariant in R n. Then, 1. λ 1 (Q) = λ 1 (Q). (closure) 2. [λ 1 (Q)] = λ 1 (Q ). (interior) 3. (λ 1 (Q)) = λ 1 ( (Q)). (boundary) Note: f 1 (A) f 1 (A) when f and A are arbitrary. Cor: If Q is closed/open/compact, then so is E. Note: If E is is closed/open/compact, then so is Q.
17 The eigenvalue map and spectral sets p. 17/30 Convexity/conic properties Let Q be permutation invariant in R n. 1. If Q is convex, then so is λ 1 (Q). 2. conv(λ 1 (Q)) = λ 1 (conv(q)). (convex hull) 3. If Q is a cone, then so is λ 1 (Q). We will prove the first item. The proof relies on majorization: In any simple algebra, λ(x+y) λ(x)+λ(y). Assume V is simple and let Q be convex.
18 The eigenvalue map and spectral sets p. 18/30 Let x,y λ 1 (Q). For 0 t 1, λ(tx+(1 t)y) tλ(x)+(1 t)λ(y), so λ(tx+(1 t)y) = A[tλ(x)+(1 t)λ(y)] for some doubly stochastic matrix A. By Birkhoff s theorem, this A is a convex combination of permutation matrices. Since P[tλ(x)+(1 t)λ(y)] Q for any permutation matrix P, we see that A[tλ(x)+(1 t)λ(y)] Q. Hence, λ(tx+(1 t)y) Q, so tx+(1 t)y λ 1 (Q).
19 The eigenvalue map and spectral sets p. 19/30 Linear properties For Q permutation invariant in R n, 1. αλ 1 (Q) = λ 1 (αq) (α R). 2. λ 1 (Q 1 +Q 2 ) = λ 1 (Q 1 )+λ 1 (Q 2 ). 3. [λ 1 (Q)] = λ 1 (Q ) ( -dual operation). Proof of second item relies on: λ(x+y) λ(x)+λ(y). Proof of third item relies on Schur type majorization: diag(x) x. Cor: If Q is a (closed) convex cone in R n, then λ 1 (Q) is a (closed) convex cone in V.
20 The eigenvalue map and spectral sets p. 20/30 Spectral cones Let Q be a permutation invariant convex cone in R n. Then K := λ 1 (Q) is called a spectral cone. Symmetric cones in EJAs are spectral cones. What is the dimension of a spectral cone? Recall: If K is a convex cone, dim(k) := dim(k K). Theorem: dim(k) {0,1,m 1,m}, where m = dim(v). What are spectral cones with these dimensions?
21 The eigenvalue map and spectral sets p. 21/30 Dimensions of spectral cones 1. K = {0}: dimension zero. 2. K nonzero, K {te : t R}: dimension one. 3. K = {x V : trace(x) = 0}: dimension n K is a spectral cone with interior: dimension n.
22 The eigenvalue map and spectral sets p. 22/30 Commutation principle in EJA Suppose E is a spectral set in V and f : V V is Frechet differentiable. Theorem (Ramirez, Seeger, and Sossa, 2013) Ifais a local minimizer of min f(x), x E then,aoperator commutes withf (a). Cor: If K is a spectral cone in V and a K, b K, and a,b = 0, then, a and b operator commute.
23 The eigenvalue map and spectral sets p. 23/30 Recall that a and b operator commute in V means: a = a 1 e 1 +a 2 e a n e n and b = b 1 e 1 +b 2 e b n e n, where {e 1,e 2,...,e n } is a Jordan frame, and a 1,a 2,...,a n are eigenvalues of a, etc. When K = λ 1 (Q), ā := (a 1,a 2,...,a n ) Q, b := (b 1,b 2,...,b n ) Q and ā, b = 0.
24 The eigenvalue map and spectral sets p. 24/30 This means that if (a,b) is a complementary pair of a spectral cone K = λ 1 (Q) in V, then some eigenvalue vectors ā, b form a complementarity pair of the cone Q in R n. This result can be sharpened. Based on Normal decomposition systems introduced by A. Lewis in 1996, we state a specialized commutation principle.
25 The eigenvalue map and spectral sets p. 25/30 Theorem (Gowda-Jeong, 2016) Suppose V is R n or a simple EJA. Let K = λ 1 (Q) be a spectral cone in V with Q permutation invariant in R n. If a K, b K, and a,b = 0, then, there exists a Jordan frame {e 1,e 2,...,e n } such that a = λ 1 (a)e 1 +λ 2 (a)e λ n(a)e n and b = λ 1 (b)e 1 +λ 2 (b)e λ n(b)e n. Hence, λ (a) Q, λ (b) Q, λ (a),λ (b) = 0.
26 The eigenvalue map and spectral sets p. 26/30 Summarizing: If V is R n or a simple EJA, K = λ 1 (Q) is a spectral cone in V, and (a,b) is a complementary pair with respect to K, then, (λ (X),λ (X)) is a complementary pair with respect to Q. This may lead to a new type of problem: Cross complementarity problem: Given permutation invariant Q in R n, f : R n R n, Find x R n such that x Q, y = f(x) Q, x,y = 0.
27 The eigenvalue map and spectral sets p. 27/30 Spectral functions f : R n R is a permutation invariant function if f(σ(x)) = f(x) for all x R n and σ Σ n. F : V R is a spectral function if there exists f permutation invariant such that F = f λ. Example: A set E in V is spectral iff its characteristic function is a spectral function. Many properties of f get transferred to F.
28 The eigenvalue map and spectral sets p. 28/30 Transfer of convexity property Theorem: SupposeQis convex and permutation invariant inr n, f : Q R is convex and permutation invariant. Then,F := f λis convex. Moreover, x y inv impliesf(x) F(y). Illustration: For 1 p, x sp,p := λ(x) p is a norm on V.
29 The eigenvalue map and spectral sets p. 29/30 Concluding remarks In this talk, we introduced spectral sets and cones in Euclidean Jordan algebras. We showed that many properties of underlying permutation invariant sets transfer to spectral sets/cones. Because these are generalizations of symmetric cones, it may be useful and worthwhile to look at complementarity problems on spectral cones.
30 The eigenvalue map and spectral sets p. 30/30 References (1) M.S. Gowda, Positive maps and doubly stochastic transformations on EJAs, to appear in LAA. (2) M.S. Gowda and J. Jeong, Commutation principles in EJAs and normal decomposition systems, Research Report, UMBC, April (3) J. Jeong and M.S. Gowda, Spectral sets and functions in EJAs, Research Report, UMBC, February (4) A.S. Lewis, Group invariance and convex matrix analysis, SIMAX, 17 (1996), (5) H. Ramirez, A. Seeger, and D. Sossa, Commutation principle in EJAs, SIOPT, 2013.
Spectral sets and functions on Euclidean Jordan algebras
Spectral sets and functions on Euclidean Jordan algebras Juyoung Jeong Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland 21250, USA juyoung1@umbc.edu
More informationOn the game-theoretic value of a linear transformation on a symmetric cone
On the game-theoretic value of a linear transformation ona symmetric cone p. 1/25 On the game-theoretic value of a linear transformation on a symmetric cone M. Seetharama Gowda Department of Mathematics
More informationStrict diagonal dominance and a Geršgorin type theorem in Euclidean
Strict diagonal dominance and a Geršgorin type theorem in Euclidean Jordan algebras Melania Moldovan Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland
More informationPermutation invariant proper polyhedral cones and their Lyapunov rank
Permutation invariant proper polyhedral cones and their Lyapunov rank Juyoung Jeong Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland 21250, USA juyoung1@umbc.edu
More informationPositive and doubly stochastic maps, and majorization in Euclidean Jordan algebras
Positive and doubly stochastic maps, and majorization in Euclidean Jordan algebras M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland
More informationOn the game-theoretic value of a linear transformation relative to a self-dual cone
On the game-theoretic value of a linear transformation relative to a self-dual cone M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland
More informationComplementarity properties of Peirce-diagonalizable linear transformations on Euclidean Jordan algebras
Optimization Methods and Software Vol. 00, No. 00, January 2009, 1 14 Complementarity properties of Peirce-diagonalizable linear transformations on Euclidean Jordan algebras M. Seetharama Gowda a, J. Tao
More informationSCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE
SCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE BABHRU JOSHI AND M. SEETHARAMA GOWDA Abstract. We consider the semidefinite cone K n consisting of all n n real symmetric positive semidefinite matrices.
More informationKey words. Complementarity set, Lyapunov rank, Bishop-Phelps cone, Irreducible cone
ON THE IRREDUCIBILITY LYAPUNOV RANK AND AUTOMORPHISMS OF SPECIAL BISHOP-PHELPS CONES M. SEETHARAMA GOWDA AND D. TROTT Abstract. Motivated by optimization considerations we consider cones in R n to be called
More informationWeakly homogeneous variational inequalities and solvability of nonlinear equations over cones
Weakly homogeneous variational inequalities and solvability of nonlinear equations over cones M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore,
More informationSome inequalities involving determinants, eigenvalues, and Schur complements in Euclidean Jordan algebras
positivity manuscript No. (will be inserted by the editor) Some inequalities involving determinants, eigenvalues, and Schur complements in Euclidean Jordan algebras M. Seetharama Gowda Jiyuan Tao February
More informationM. Seetharama Gowda. J. Tao. G. Ravindran
Some complementarity properties of Z and Lyapunov-like transformations on symmetric cones M. Seetharama Gowda Department of Mathematics and Statistics, University of Maryland, Baltimore County, Baltimore,
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 informationWeakly homogeneous variational inequalities and solvability of nonlinear equations over cones
Weakly homogeneous variational inequalities and solvability of nonlinear equations over cones M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore,
More informationSome characterizations of cone preserving Z-transformations
Annals of Operations Research manuscript No. (will be inserted by the editor) Some characterizations of cone preserving Z-transformations M. Seetharama Gowda Yoon J. Song K.C. Sivakumar This paper is dedicated,
More informationLinear Algebra: Matrix Eigenvalue Problems
CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given
More informationLINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM
LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F is R or C. Definition 1. A linear operator
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 informationLecture 5. Ch. 5, Norms for vectors and matrices. Norms for vectors and matrices Why?
KTH ROYAL INSTITUTE OF TECHNOLOGY Norms for vectors and matrices Why? Lecture 5 Ch. 5, Norms for vectors and matrices Emil Björnson/Magnus Jansson/Mats Bengtsson April 27, 2016 Problem: Measure size of
More informationThe Jordan Algebraic Structure of the Circular Cone
The Jordan Algebraic Structure of the Circular Cone Baha Alzalg Department of Mathematics, The University of Jordan, Amman 1194, Jordan Abstract In this paper, we study and analyze the algebraic structure
More informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 2 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 5, 2012 Andre Tkacenko
More informationMath Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88
Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant
More informationOn common linear/quadratic Lyapunov functions for switched linear systems
On common linear/quadratic Lyapunov functions for switched linear systems M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland, USA
More informationWeakly homogeneous variational inequalities and solvability of nonlinear equations over cones
Weakly homogeneous variational inequalities and solvability of nonlinear equations over cones M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore,
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More informationPolynomial complementarity problems
Polynomial complementarity problems M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland 21250, USA gowda@umbc.edu December 2, 2016
More informationM. Seetharama Gowda a, J. Tao b & Roman Sznajder c a Department of Mathematics and Statistics, University of Maryland
This article was downloaded by: [University of Maryland Baltimore County] On: 03 April 2013, At: 09:11 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954
More informationChap 3. Linear Algebra
Chap 3. Linear Algebra Outlines 1. Introduction 2. Basis, Representation, and Orthonormalization 3. Linear Algebraic Equations 4. Similarity Transformation 5. Diagonal Form and Jordan Form 6. Functions
More informationThe Nearest Doubly Stochastic Matrix to a Real Matrix with the same First Moment
he Nearest Doubly Stochastic Matrix to a Real Matrix with the same First Moment William Glunt 1, homas L. Hayden 2 and Robert Reams 2 1 Department of Mathematics and Computer Science, Austin Peay State
More informationAssignment 1: From the Definition of Convexity to Helley Theorem
Assignment 1: From the Definition of Convexity to Helley Theorem Exercise 1 Mark in the following list the sets which are convex: 1. {x R 2 : x 1 + i 2 x 2 1, i = 1,..., 10} 2. {x R 2 : x 2 1 + 2ix 1x
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 informationALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA
ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND
More informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 0: Vector spaces 0.1 Basic notation Here are some of the fundamental sets and spaces
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 information2.1. Jordan algebras. In this subsection, we introduce Jordan algebras as well as some of their basic properties.
FULL NESTEROV-TODD STEP INTERIOR-POINT METHODS FOR SYMMETRIC OPTIMIZATION G. GU, M. ZANGIABADI, AND C. ROOS Abstract. Some Jordan algebras were proved more than a decade ago to be an indispensable tool
More informationTutorials in Optimization. Richard Socher
Tutorials in Optimization Richard Socher July 20, 2008 CONTENTS 1 Contents 1 Linear Algebra: Bilinear Form - A Simple Optimization Problem 2 1.1 Definitions........................................ 2 1.2
More informationIE 521 Convex Optimization
Lecture 1: 16th January 2019 Outline 1 / 20 Which set is different from others? Figure: Four sets 2 / 20 Which set is different from others? Figure: Four sets 3 / 20 Interior, Closure, Boundary Definition.
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 informationLinear algebra and applications to graphs Part 1
Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces
More informationThe Jordan Normal Form and its Applications
The and its Applications Jeremy IMPACT Brigham Young University A square matrix A is a linear operator on {R, C} n. A is diagonalizable if and only if it has n linearly independent eigenvectors. What happens
More informationInvertibility and stability. Irreducibly diagonally dominant. Invertibility and stability, stronger result. Reducible matrices
Geršgorin circles Lecture 8: Outline Chapter 6 + Appendix D: Location and perturbation of eigenvalues Some other results on perturbed eigenvalue problems Chapter 8: Nonnegative matrices Geršgorin s Thm:
More informationSymmetric matrices and dot products
Symmetric matrices and dot products Proposition An n n matrix A is symmetric iff, for all x, y in R n, (Ax) y = x (Ay). Proof. If A is symmetric, then (Ax) y = x T A T y = x T Ay = x (Ay). If equality
More informationProperties of Linear Transformations from R n to R m
Properties of Linear Transformations from R n to R m MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Topic Overview Relationship between the properties of a matrix transformation
More informationON POSITIVE SEMIDEFINITE PRESERVING STEIN TRANSFORMATION
J. Appl. Math. & Informatics Vol. 33(2015), No. 1-2, pp. 229-234 http://dx.doi.org/10.14317/jami.2015.229 ON POSITIVE SEMIDEFINITE PRESERVING STEIN TRANSFORMATION YOON J. SONG Abstract. In the setting
More informationPh.D. Katarína Bellová Page 1 Mathematics 2 (10-PHY-BIPMA2) EXAM - Solutions, 20 July 2017, 10:00 12:00 All answers to be justified.
PhD Katarína Bellová Page 1 Mathematics 2 (10-PHY-BIPMA2 EXAM - Solutions, 20 July 2017, 10:00 12:00 All answers to be justified Problem 1 [ points]: For which parameters λ R does the following system
More informationMATH 425-Spring 2010 HOMEWORK ASSIGNMENTS
MATH 425-Spring 2010 HOMEWORK ASSIGNMENTS Instructor: Shmuel Friedland Department of Mathematics, Statistics and Computer Science email: friedlan@uic.edu Last update April 18, 2010 1 HOMEWORK ASSIGNMENT
More informationFoundations of Matrix Analysis
1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the
More informationLecture: Introduction to LP, SDP and SOCP
Lecture: Introduction to LP, SDP and SOCP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2015.html wenzw@pku.edu.cn Acknowledgement:
More informationThe Q Method for Symmetric Cone Programming
The Q Method for Symmetric Cone Programming Farid Alizadeh Yu Xia October 5, 010 Communicated by F. Potra Abstract The Q method of semidefinite programming, developed by Alizadeh, Haeberly and Overton,
More informationLinear Algebra. Preliminary Lecture Notes
Linear Algebra Preliminary Lecture Notes Adolfo J. Rumbos c Draft date April 29, 23 2 Contents Motivation for the course 5 2 Euclidean n dimensional Space 7 2. Definition of n Dimensional Euclidean Space...........
More information1. General Vector Spaces
1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule
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 informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 2
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 2 Instructor: Farid Alizadeh Scribe: Xuan Li 9/17/2001 1 Overview We survey the basic notions of cones and cone-lp and give several
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 informationSummer School: Semidefinite Optimization
Summer School: Semidefinite Optimization Christine Bachoc Université Bordeaux I, IMB Research Training Group Experimental and Constructive Algebra Haus Karrenberg, Sept. 3 - Sept. 7, 2012 Duality Theory
More informationSTRUCTURE AND DECOMPOSITIONS OF THE LINEAR SPAN OF GENERALIZED STOCHASTIC MATRICES
Communications on Stochastic Analysis Vol 9, No 2 (2015) 239-250 Serials Publications wwwserialspublicationscom STRUCTURE AND DECOMPOSITIONS OF THE LINEAR SPAN OF GENERALIZED STOCHASTIC MATRICES ANDREAS
More informationLinear Algebra. Preliminary Lecture Notes
Linear Algebra Preliminary Lecture Notes Adolfo J. Rumbos c Draft date May 9, 29 2 Contents 1 Motivation for the course 5 2 Euclidean n dimensional Space 7 2.1 Definition of n Dimensional Euclidean Space...........
More informationLecture 1: Convex Sets January 23
IE 521: Convex Optimization Instructor: Niao He Lecture 1: Convex Sets January 23 Spring 2017, UIUC Scribe: Niao He Courtesy warning: These notes do not necessarily cover everything discussed in the class.
More informationThe Q Method for Second-Order Cone Programming
The Q Method for Second-Order Cone Programming Yu Xia Farid Alizadeh July 5, 005 Key words. Second-order cone programming, infeasible interior point method, the Q method Abstract We develop the Q method
More informationSYLLABUS. 1 Linear maps and matrices
Dr. K. Bellová Mathematics 2 (10-PHY-BIPMA2) SYLLABUS 1 Linear maps and matrices Operations with linear maps. Prop 1.1.1: 1) sum, scalar multiple, composition of linear maps are linear maps; 2) L(U, V
More informationThe Q Method for Symmetric Cone Programmin
The Q Method for Symmetric Cone Programming The Q Method for Symmetric Cone Programmin Farid Alizadeh and Yu Xia alizadeh@rutcor.rutgers.edu, xiay@optlab.mcma Large Scale Nonlinear and Semidefinite Progra
More informationOPTIMIZATION OVER SYMMETRIC CONES UNDER UNCERTAINTY
OPTIMIZATION OVER SYMMETRIC CONES UNDER UNCERTAINTY By BAHA M. ALZALG A dissertation submitted in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY WASHINGTON STATE UNIVERSITY
More informationLMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009
LMI MODELLING 4. CONVEX LMI MODELLING Didier HENRION LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ Universidad de Valladolid, SP March 2009 Minors A minor of a matrix F is the determinant of a submatrix
More informationLinear Algebra Lecture Notes-II
Linear Algebra Lecture Notes-II Vikas Bist Department of Mathematics Panjab University, Chandigarh-64 email: bistvikas@gmail.com Last revised on March 5, 8 This text is based on the lectures delivered
More informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
More informationFischer-Burmeister Complementarity Function on Euclidean Jordan Algebras
Fischer-Burmeister Complementarity Function on Euclidean Jordan Algebras Lingchen Kong, Levent Tunçel, and Naihua Xiu 3 (November 6, 7; Revised December, 7) Abstract Recently, Gowda et al. [] established
More informationREPRESENTATION THEORY WEEK 7
REPRESENTATION THEORY WEEK 7 1. Characters of L k and S n A character of an irreducible representation of L k is a polynomial function constant on every conjugacy class. Since the set of diagonalizable
More informationLecture 6 - Convex Sets
Lecture 6 - Convex Sets Definition A set C R n is called convex if for any x, y C and λ [0, 1], the point λx + (1 λ)y belongs to C. The above definition is equivalent to saying that for any x, y C, the
More informationC&O367: Nonlinear Optimization (Winter 2013) Assignment 4 H. Wolkowicz
C&O367: Nonlinear Optimization (Winter 013) Assignment 4 H. Wolkowicz Posted Mon, Feb. 8 Due: Thursday, Feb. 8 10:00AM (before class), 1 Matrices 1.1 Positive Definite Matrices 1. Let A S n, i.e., let
More informationMATH 240 Spring, Chapter 1: Linear Equations and Matrices
MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear
More informationSection 3.9. Matrix Norm
3.9. Matrix Norm 1 Section 3.9. Matrix Norm Note. We define several matrix norms, some similar to vector norms and some reflecting how multiplication by a matrix affects the norm of a vector. We use matrix
More informationCS 143 Linear Algebra Review
CS 143 Linear Algebra Review Stefan Roth September 29, 2003 Introductory Remarks This review does not aim at mathematical rigor very much, but instead at ease of understanding and conciseness. Please see
More informationNonlinear Programming Algorithms Handout
Nonlinear Programming Algorithms Handout Michael C. Ferris Computer Sciences Department University of Wisconsin Madison, Wisconsin 5376 September 9 1 Eigenvalues The eigenvalues of a matrix A C n n are
More informationEcon 204 Supplement to Section 3.6 Diagonalization and Quadratic Forms. 1 Diagonalization and Change of Basis
Econ 204 Supplement to Section 3.6 Diagonalization and Quadratic Forms De La Fuente notes that, if an n n matrix has n distinct eigenvalues, it can be diagonalized. In this supplement, we will provide
More informationProperties of Matrices and Operations on Matrices
Properties of Matrices and Operations on Matrices A common data structure for statistical analysis is a rectangular array or matris. Rows represent individual observational units, or just observations,
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2017 LECTURE 5
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 17 LECTURE 5 1 existence of svd Theorem 1 (Existence of SVD) Every matrix has a singular value decomposition (condensed version) Proof Let A C m n and for simplicity
More informationREFLECTIONS IN A EUCLIDEAN SPACE
REFLECTIONS IN A EUCLIDEAN SPACE PHILIP BROCOUM Let V be a finite dimensional real linear space. Definition 1. A function, : V V R is a bilinear form in V if for all x 1, x, x, y 1, y, y V and all k R,
More information1. Foundations of Numerics from Advanced Mathematics. Linear Algebra
Foundations of Numerics from Advanced Mathematics Linear Algebra Linear Algebra, October 23, 22 Linear Algebra Mathematical Structures a mathematical structure consists of one or several sets and one or
More information10-725/36-725: Convex Optimization Prerequisite Topics
10-725/36-725: Convex Optimization Prerequisite Topics February 3, 2015 This is meant to be a brief, informal refresher of some topics that will form building blocks in this course. The content of the
More informationSemidefinite 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 informationJordan Normal Form. Chapter Minimal Polynomials
Chapter 8 Jordan Normal Form 81 Minimal Polynomials Recall p A (x) =det(xi A) is called the characteristic polynomial of the matrix A Theorem 811 Let A M n Then there exists a unique monic polynomial q
More informationChapter 5 Eigenvalues and Eigenvectors
Chapter 5 Eigenvalues and Eigenvectors Outline 5.1 Eigenvalues and Eigenvectors 5.2 Diagonalization 5.3 Complex Vector Spaces 2 5.1 Eigenvalues and Eigenvectors Eigenvalue and Eigenvector If A is a n n
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 informationLinear Algebra. Workbook
Linear Algebra Workbook Paul Yiu Department of Mathematics Florida Atlantic University Last Update: November 21 Student: Fall 2011 Checklist Name: A B C D E F F G H I J 1 2 3 4 5 6 7 8 9 10 xxx xxx xxx
More informationEE Applications of Convex Optimization in Signal Processing and Communications Dr. Andre Tkacenko, JPL Third Term
EE 150 - Applications of Convex Optimization in Signal Processing and Communications Dr. Andre Tkacenko JPL Third Term 2011-2012 Due on Thursday May 3 in class. Homework Set #4 1. (10 points) (Adapted
More informationNOTES ON BILINEAR FORMS
NOTES ON BILINEAR FORMS PARAMESWARAN SANKARAN These notes are intended as a supplement to the talk given by the author at the IMSc Outreach Programme Enriching Collegiate Education-2015. Symmetric bilinear
More information1 9/5 Matrices, vectors, and their applications
1 9/5 Matrices, vectors, and their applications Algebra: study of objects and operations on them. Linear algebra: object: matrices and vectors. operations: addition, multiplication etc. Algorithms/Geometric
More informationReal Symmetric Matrices and Semidefinite Programming
Real Symmetric Matrices and Semidefinite Programming Tatsiana Maskalevich Abstract Symmetric real matrices attain an important property stating that all their eigenvalues are real. This gives rise to many
More informationLinear Algebra. Session 12
Linear Algebra. Session 12 Dr. Marco A Roque Sol 08/01/2017 Example 12.1 Find the constant function that is the least squares fit to the following data x 0 1 2 3 f(x) 1 0 1 2 Solution c = 1 c = 0 f (x)
More informationInequality Constraints
Chapter 2 Inequality Constraints 2.1 Optimality Conditions Early in multivariate calculus we learn the significance of differentiability in finding minimizers. In this section we begin our study of the
More informationMATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018
MATH 57: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 18 1 Global and Local Optima Let a function f : S R be defined on a set S R n Definition 1 (minimizers and maximizers) (i) x S
More informationLinGloss. A glossary of linear algebra
LinGloss A glossary of linear algebra Contents: Decompositions Types of Matrices Theorems Other objects? Quasi-triangular A matrix A is quasi-triangular iff it is a triangular matrix except its diagonal
More informationJordan normal form notes (version date: 11/21/07)
Jordan normal form notes (version date: /2/7) If A has an eigenbasis {u,, u n }, ie a basis made up of eigenvectors, so that Au j = λ j u j, then A is diagonal with respect to that basis To see this, let
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 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 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 informationProblems in Linear Algebra and Representation Theory
Problems in Linear Algebra and Representation Theory (Most of these were provided by Victor Ginzburg) The problems appearing below have varying level of difficulty. They are not listed in any specific
More informationQuantum Computing Lecture 2. Review of Linear Algebra
Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces
More informationLinear Algebra. Min Yan
Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................
More informationA Field Extension as a Vector Space
Chapter 8 A Field Extension as a Vector Space In this chapter, we take a closer look at a finite extension from the point of view that is a vector space over. It is clear, for instance, that any is a linear
More information