Supplemental Document to the Paper A Game-Theoretic Approach for Regulating Hazmat Transportation

Size: px
Start display at page:

Download "Supplemental Document to the Paper A Game-Theoretic Approach for Regulating Hazmat Transportation"

Transcription

1 manuscript doi: /trsc (supplemental document) Supplemental Document to the Paper A Game-Theoretic Approach for Regulating Hazmat Transportation Lucio Bianco, Massimiliano Caramia, Stefano Giordani Dipartimento di Ingegneria dell Impresa, Università di Roma Tor Vergata, Via del Politecnico, Roma, Italy, bianco@diiuniroma2it, caramia@diiuniroma2it, stefanogiordani@uniroma2it Veronica Piccialli Dipartimento di Ingegneria Civile e Ingegneria Informatica, Università di Roma Tor Vergata, Via del Politecnico, Roma, Italy, veronicapiccialli@uniroma2it This supplemental document contains two appendices to the main paper (available at The first appendix reports the proofs of two propositions in Section 4 of the main paper The second contains the complete list of the performance results obtained on test instance I 1 Appendix A: In this appendix we report the proofs of Propositions 1 and 2 in Section 4 of the main paper In order to facilitate the reading we rewrite next the Nash Equilibrium Problem (NEP) among the carriers k K, that appears in the main paper as NEP (5): min θ k (x;t,d) x s ij,s S(k),(i,j) A st x s ij for all k K (i,j) A + (i) x s ij 0, (j,i) A (i) x s ji =es i, i N, s S(k) (i,j) A, s S(k) (A1) 1

2 Bianco et al: Supplemental Document to the Paper A Game-Theoretic Approach for Regulating Hazmat Transportation 2 Article submitted to Transportation Science; manuscript no doi: /trsc (supplemental document) Proposition 1 (Section 4, main paper) The Nash equilibrium problem (A1) is equivalent to the Variational Inequality VI(D,F) 1, with D= p D k, k=1 x 1θ 1 (x;t,d) x 2θ 2 (x;t,d) F(x)= x pθ p (x;t,d) Furthermore, the Nash equilibrium problem (A1) admits at least one solution (A2) Proof: The objective function θ k (x;t,d) of player (carrier) k is a continuously differentiable quadratic function of x We now prove that it is convex with respect to the player s variables Indeed, the Hessian of θ k (x;t,d) with respect to x k is equal to the matrix where 2 x θ k k (x;t,d)= M sk 1 sk 1 M sk 2 sk 1 M sk 1 sk 2 M sk 1 sk ν k M sk 2 sk 2 M sk 2 sk ν k, M sk ν k s k 1 M sk ν k s k 2 M sk ν k s k ν k M ss =Diag ( 2d a (ρ a b s ) 2) m a=1, Msl =Diag ( 2d a ρ 2 ab s b l) m a=1, with s,l S(k)={s k 1,,sk ν k }, and where Diag(v) denotes the diagonal matrix having as elements on the diagonal the elements of vector v The Hessian matrix 2 x k θ k (x;t,d) can be rewritten as 2 x kθ k(x;t,d)=2 b k ( b k ) T H, (A3) where bk = b sk 1, H =Diag(d a ρ 2 a )m a=1, (A4) b sk ν k and the symbol denotes the Kronecker product 2 of two matrices By the the properties of the Kronecker product (see Horn and Johnson 1986) the Hessian matrix has eigenvalues equal to the product of the eigenvalues of H (that are equal to the non negative values d a ρ 2 a) and of the positive semidefinite rank one matrix b k ( b k ) T that are all non-negative Therefore, we have that the Hessian 2 θ x k k (x;t,d) is positive semidefinite, and hence the function θ k (x;t,d) is convex with respect x k It is well known (see, eg, Proposition 142 in Facchinei and Pang 2003) that given the convexity of θ k (x;t,d) and the convexity of the feasible sets D k, for each player (carrier) k = 1,,p, NEP (A1) is 1 A solution of the VI(D,F) is a point x D such that F(x) T (y x) 0 for all y D 2 Given a matrix A R m n and a matrix B R p q, A B is the block matrix of size mp nq, A B = A 11B A 1nB A m1b A mnb

3 Bianco et al: Supplemental Document to the Paper A Game-Theoretic Approach for Regulating Hazmat Transportation Article submitted to Transportation Science; manuscript no doi: /trsc (supplemental document) 3 equivalent to the variational inequality VI(D,F), where D is the Cartesian product of the feasible set of the players, and F is obtained by concatenating the gradients of the players objective functions with respect to their own variables In our case, the resulting D and F are given by (A2), where x kθ k (x;t,d) is a vector of mν k components whose generic element is given by θ k (x;t,d) x s a ( ) = c a b s +t a ρ a b s +d a ρ a b s ρ a b s x s + a ρ a b l x l a l S + l S(k),l =s d a ρ a b l ρ a b s x l a, (A5) with s S(k) and a A As for the second statement, since the sets D k are compact, and F(x) is a vector of continuous functions, a solution of the VI(D,F) (and, hence, an equilibrium of NEP (A1)) always exists Before giving the next proof we recall the expression of the Jacobian matrix JF(x), that is the constant (m S m S ) symmetric matrix given by H 11 H 12 H 1p H 21 H 22 H 2p JF(x)=, H p1 H p2 H pp where H kk, with k=1,,p, is the (mν k mν k ) matrix H kk = 2 x k θ k (x;t,d) (given by equation (A3)) and H kl, with k,l=1,,p and k l, is the (mν k mν l ) matrix b sk 1 b s l 1 H b s k 1 b s l ν l H H kl =H T lk = b sk ν k b sl 1 H b s k ν k b sl ν l H where H =Diag(d a ρ 2 a )m a=1 (A6) (A7) Proposition 2 (Section 4, main paper) For any value of the toll parameters t a and d a 0, with a = 1,,m: (i) the VI(D,F) is monotone; (ii) NEP (A1) is equivalent to the following convex optimization problem: min ϕ(x)=κ T x+ 1 2 xt JF(x)x st x s a x s a=e s i, i N, s S a A + (i) a A (i) x s a 0, a A, s S, (A8)

4 Bianco et al: Supplemental Document to the Paper A Game-Theoretic Approach for Regulating Hazmat Transportation 4 Article submitted to Transportation Science; manuscript no doi: /trsc (supplemental document) where JF(x) is defined by (A6), and κ= b 1 (c 1 +t 1 ρ 1 ) b 1 (c m +t m ρ m ) b S (c 1 +t 1 ρ 1 ) b S (c m +t m ρ m ) (iii) If ν k =1 for all k K and d a >0 for all a A, then there exists a unique equilibrium of NEP (A1), Proof: (i) The VI(D,F) is monotone on D if and only if the Jacobian matrix of F JF(x) is positive semidefinite for all x D Looking at expression (A6), it is obvious that it can be rewritten as: 2 b 1 ( b 1 ) T H b 1 ( b 2 ) T H b1 ( b p ) T H JF(x)= bp ( b 1 ) T H b p ( b 2 ) T H 2 b p ( b p ) T H where b k, with k=1,,p, and H are defined in (A4) Once defined the vector b1 b=, bp JF(x) can be rewritten as b1 ( b 1 ) T 0 0 JF(x)= ( B+bb T) 0 b2 ( b 2 ) T 0 H, B=, 0 0 b p ( b p ) T (A9) (A10) that is positive semidefinite again by the properties of the Kronecker product since H is positive semidefinite for all d a 0 and the matrix B+bb T is is a rank one update of the positive semidefinite matrix B Therefore, F is monotone (ii) By looking at expression (A6), it emerges that the Jacobian JF(x) is symmetric It is well known (see, eg, Theorem 131 in Facchinei and Pang 2003) that given a vector F(x) of continuously differentiable functions, if its Jacobian is symmetric, then there exists a real-valued function ϕ(x) such that ϕ(x) = F(x), and ϕ(x)= 1 0 F T (x 0 +t(x x 0 ))(x x 0 )dt In our case, by expression (A2) (and (A5)) of F(x), it follows that ϕ(x)=κ T x+ 1 2 xt JF(x)x, that is a quadratic function, with Hessian equal to JF(x) which has been proved to be positive semidefinite at point (i) Therefore, the well known minimum principle applied to problem (A8) is equivalent to solving the VI(D,F), and the thesis follows

5 Bianco et al: Supplemental Document to the Paper A Game-Theoretic Approach for Regulating Hazmat Transportation Article submitted to Transportation Science; manuscript no doi: /trsc (supplemental document) 5 (iii) The existence of an equilibrium is implied by Proposition 1 of the main paper As for the uniqueness, under the assumption ν k =1, for all k=1,,p, equation (A10) implies that 2(b 1 ) 2 b 1 b 2 b 1 b p b 2 b 1 2(b 2 ) 2 b 2 b p JF(x)= H b p b 1 b p b 2 2(b p ) 2 Therefore, this matrix can be equivalently rewritten as where the symbol denotes the Hadamard product 3 JF(x)= ( bb T +Diag(b b) ) H, Matrix H (defined in (A4)) is a diagonal matrix having eigenvalues equal to the elements of the diagonal, so that it is positive definite if we assume that all the diagonal elements of H are positive (ie, all the toll parameters d a and risk coefficient ρ a are positive) As for matrix bb T +Diag(b b), it is positive definite since it is a rank one update of the positive definite matrix Diag(b b) having as eigenvalues (b s ) 2 >0, for s S Therefore, since the Kronecker product of two positive definite matrices is positive definite, then matrix JF(x) is positive definite, implying strict monotonicity of the function F(x) that ensures uniqueness of the solution of the VI(D,F), and hence of the equilibria of the NEP (A1) Appendix B: For instance I 1, and for every set of weight parameters, Table B1 lists the results related to the optimal solution of model (1, main paper) of Marcotte et al (2009) used for the comparison, followed by the results of all the non-dominated solutions (ordered by non-decreasing carriers travel cost values) produced by our heuristic method (presented in Section 6 of the main paper) with carriers total travel cost less than four times the carriers total travel cost related to the optimal solution of problem (1, main paper) In particular, the table reports the performance ratios R tot /R min, Φ/Φ min (R min ), and C tot /C min, for each determined solution R tot Φ C tot Table B1: The results of test instance I 1 R tot R min Φ min (R min ) C min R min Φ min (R min ) C min R min Φ min (R min ) C min α = 075 2,16 1,12 1,05 α = 1 2,3 1,12 1,03 α = 05 1,94 1,12 1,07 S1 2,53 0,69 1,37 S2 2,53 0,69 1,37 S3 2,53 0,69 1,37 2,37 0,72 1,44 2,37 0,72 1,44 2,37 0,72 1,44 2,35 0,73 1,48 2,35 0,73 1,48 2,35 0,73 1,48 2,26 0,81 1,51 2,26 0,81 1,51 2,26 0,81 1,51 2,04 0,85 1,52 2,04 0,85 1,52 2,04 0,85 1,52 2,03 0,85 1,58 2,03 0,85 1,58 2,03 0,85 1,58 2,17 0,83 1,59 2,17 0,83 1,59 2,17 0,83 1,59 1,91 0,70 1,62 1,91 0,70 1,62 1,91 0,70 1,62 1,73 0,70 1,63 1,73 0,70 1,63 1,73 0,70 1,63 1,90 0,70 1,67 1,90 0,70 1,67 1,90 0,70 1,67 1,65 0,79 1,69 1,65 0,79 1,69 1,65 0,79 1,69 1,73 0,70 1,72 1,73 0,70 1,72 1,73 0,70 1,72 1,56 0,85 1,74 1,56 0,85 1,74 1,56 0,85 1,74 1,45 0,86 1,75 1,45 0,86 1,75 1,45 0,86 1,75 Φ C tot R tot Φ C tot 3 Given two matrices A and B of the same size the Hadamard product A B is the matrix having as elements the product of the elements of the two matices, ie (A B) ij =A ijb ij

6 Bianco et al: Supplemental Document to the Paper A Game-Theoretic Approach for Regulating Hazmat Transportation 6 Article submitted to Transportation Science; manuscript no doi: /trsc (supplemental document) 1,64 0,80 1,75 1,64 0,80 1,75 1,64 0,80 1,75 1,43 0,90 1,77 1,43 0,90 1,77 1,43 0,90 1,77 1,44 0,86 1,78 1,44 0,86 1,78 1,44 0,86 1,78 1,43 0,90 1,81 1,43 0,90 1,81 1,43 0,90 1,81 1,26 0,82 1,86 1,26 0,82 1,86 1,26 0,82 1,86 1,32 0,69 1,86 1,32 0,69 1,86 1,32 0,69 1,86 1,31 0,69 1,86 1,31 0,69 1,86 1,31 0,69 1,86 1,24 0,83 1,90 1,24 0,83 1,90 1,24 0,83 1,90 1,30 0,69 1,90 1,30 0,69 1,90 1,30 0,69 1,90 1,27 0,69 1,92 1,27 0,69 1,92 1,27 0,69 1,92 1,23 0,73 1,93 1,23 0,73 1,93 1,23 0,73 1,93 1,22 0,94 1,99 1,22 0,94 1,99 1,22 0,94 1,99 1,21 0,94 2,03 1,21 0,94 2,03 1,21 0,94 2,03 1,19 0,94 2,04 1,19 0,94 2,04 1,19 0,94 2,04 1,19 0,94 2,04 1,19 0,94 2,04 1,19 0,94 2,04 1,17 1,02 2,05 1,17 1,02 2,05 1,17 1,02 2,05 1,17 1,02 2,10 1,20 0,88 2,07 1,17 1,02 2,10 1,16 1,12 2,23 1,18 0,88 2,08 1,18 1,02 2,23 1,18 1,02 2,23 1,16 0,88 2,10 1,17 0,92 2,32 1,18 1,00 2,32 1,15 1,00 2,33 1,15 1,00 2,33 1,15 1,00 2,33 1,15 0,93 2,33 1,16 0,92 2,33 1,16 1,00 2,40 1,15 0,96 2,36 1,15 0,92 2,34 1,15 1,00 2,51 1,22 0,88 2,47 1,15 0,92 2,39 1,16 0,90 2,55 1,14 0,93 2,53 1,18 0,91 2,40 1,12 1,12 2,55 1,14 0,93 2,77 1,16 0,92 2,43 1,14 1,09 2,56 1,16 0,88 2,85 1,16 0,92 2,48 1,11 1,12 2,57 1,17 0,88 2,92 1,14 0,92 2,48 1,09 1,12 2,59 1,16 0,88 2,98 1,14 0,93 2,48 1,13 1,12 2,81 1,13 1,09 3,08 1,13 0,77 2,57 1,13 1,12 2,81 1,16 0,87 3,12 1,13 0,93 2,61 1,14 1,12 2,84 1,13 1,09 3,23 1,11 1,10 2,86 1,12 1,12 2,87 1,11 1,10 3,24 1,10 1,09 2,86 1,10 1,12 2,89 1,11 1,06 3,63 1,54 0,69 2,89 1,09 1,12 2,90 1,10 1,11 3,86 1,13 0,73 2,95 1,13 1,10 2,92 1,10 1,11 4,04 1,10 1,10 2,97 1,21 0,86 2,92 1,09 1,11 3,08 1,09 1,12 2,93 1,06 1,12 3,08 1,18 0,86 2,99 1,09 1,10 3,17 1,17 0,89 3,05 1,12 0,73 3,32 1,15 0,91 3,05 1,07 1,11 3,61 1,16 0,86 3,08 1,09 1,10 3,65 1,08 1,12 3,08 1,12 0,68 3,95 1,13 0,93 3,12 1,20 0,85 3,20 1,18 0,77 3,21 1,14 0,88 3,26 1,08 1,00 3,31 1,07 1,00 3,32 1,06 1,00 3,33 1,07 1,00 3,33 1,13 0,86 3,34 1,16 0,86 3,43 1,04 1,11 3,43 1,06 1,00 3,45 References Facchinei, F, J-S Pang 2003 Finite-Dimensional Variational Inequalities and Complementarity Problems Springer Verlag, New York, NY, USA Horn, Roger A and Johnson, Charles R 1986 Topics in Matrix Analysis Cambridge University Press Marcotte, P, A Mercier, G Savard, V Verter 2009 Toll Policies for Mitigating Hazardous Materials Transport Risk Transportation Science 43(2)

Uniqueness of Generalized Equilibrium for Box Constrained Problems and Applications

Uniqueness of Generalized Equilibrium for Box Constrained Problems and Applications Uniqueness of Generalized Equilibrium for Box Constrained Problems and Applications Alp Simsek Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Asuman E.

More information

Lower Semicontinuity of the Solution Set Mapping in Some Optimization Problems

Lower Semicontinuity of the Solution Set Mapping in Some Optimization Problems Lower Semicontinuity of the Solution Set Mapping in Some Optimization Problems Roberto Lucchetti coauthors: A. Daniilidis, M.A. Goberna, M.A. López, Y. Viossat Dipartimento di Matematica, Politecnico di

More information

Written Examination

Written Examination Division of Scientific Computing Department of Information Technology Uppsala University Optimization Written Examination 202-2-20 Time: 4:00-9:00 Allowed Tools: Pocket Calculator, one A4 paper with notes

More information

Functions of Several Variables

Functions of Several Variables Functions of Several Variables The Unconstrained Minimization Problem where In n dimensions the unconstrained problem is stated as f() x variables. minimize f()x x, is a scalar objective function of vector

More information

e-companion ONLY AVAILABLE IN ELECTRONIC FORM

e-companion ONLY AVAILABLE IN ELECTRONIC FORM OPERATIONS RESEARCH doi 0.287/opre.00.0863ec e-companion ONLY AVAILABLE IN ELECTRONIC FORM informs 20 INFORMS Electronic Companion Supply Chain Competition with Multiple Manufacturers and Retailers by

More information

Distributed power allocation for D2D communications underlaying/overlaying OFDMA cellular networks

Distributed power allocation for D2D communications underlaying/overlaying OFDMA cellular networks Distributed power allocation for D2D communications underlaying/overlaying OFDMA cellular networks Marco Moretti, Andrea Abrardo Dipartimento di Ingegneria dell Informazione, University of Pisa, Italy

More information

Variational Inequalities. Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003

Variational Inequalities. Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003 Variational Inequalities Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003 c 2002 Background Equilibrium is a central concept in numerous disciplines including economics,

More information

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

WHEN ARE THE (UN)CONSTRAINED STATIONARY POINTS OF THE IMPLICIT LAGRANGIAN GLOBAL SOLUTIONS? WHEN ARE THE (UN)CONSTRAINED STATIONARY POINTS OF THE IMPLICIT LAGRANGIAN GLOBAL SOLUTIONS? Francisco Facchinei a,1 and Christian Kanzow b a Università di Roma La Sapienza Dipartimento di Informatica e

More information

Risk-Averse Second-Best Toll Pricing

Risk-Averse Second-Best Toll Pricing Risk-Averse Second-Best Toll Pricing Xuegang (Jeff) Ban, Department of Civil and Environmental Engineering, Rensselaer Polytechnic Institute, banx@rpi.edu, Corresponding Author Shu Lu, Department of Statistics

More information

OSNR Optimization in Optical Networks: Extension for Capacity Constraints

OSNR Optimization in Optical Networks: Extension for Capacity Constraints 5 American Control Conference June 8-5. Portland OR USA ThB3.6 OSNR Optimization in Optical Networks: Extension for Capacity Constraints Yan Pan and Lacra Pavel Abstract This paper builds on the OSNR model

More information

c 1995 Society for Industrial and Applied Mathematics Vol. 37, No. 1, pp , March

c 1995 Society for Industrial and Applied Mathematics Vol. 37, No. 1, pp , March SIAM REVIEW. c 1995 Society for Industrial and Applied Mathematics Vol. 37, No. 1, pp. 93 97, March 1995 008 A UNIFIED PROOF FOR THE CONVERGENCE OF JACOBI AND GAUSS-SEIDEL METHODS * ROBERTO BAGNARA Abstract.

More information

Math-Net.Ru All Russian mathematical portal

Math-Net.Ru All Russian mathematical portal Math-Net.Ru All Russian mathematical portal Anna V. Tur, A time-consistent solution formula for linear-quadratic discrete-time dynamic games with nontransferable payoffs, Contributions to Game Theory and

More information

COMPUTATION OF GENERALIZED NASH EQUILIBRIA WITH

COMPUTATION OF GENERALIZED NASH EQUILIBRIA WITH COMPUTATION OF GENERALIZED NASH EQUILIBRIA WITH THE GNE PACKAGE C. Dutang 1,2 1 ISFA - Lyon, 2 AXA GRM - Paris, 1/19 12/08/2011 user! 2011 OUTLINE 1 GAP FUNCTION MINIZATION APPROACH 2 FIXED-POINT APPROACH

More information

AN EXACT PENALTY APPROACH FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS. L. Abdallah 1 and M. Haddou 2

AN EXACT PENALTY APPROACH FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS. L. Abdallah 1 and M. Haddou 2 AN EXACT PENALTY APPROACH FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS. L. Abdallah 1 and M. Haddou 2 Abstract. We propose an exact penalty approach to solve the mathematical problems with equilibrium

More information

Inertial Game Dynamics

Inertial Game Dynamics ... Inertial Game Dynamics R. Laraki P. Mertikopoulos CNRS LAMSADE laboratory CNRS LIG laboratory ADGO'13 Playa Blanca, October 15, 2013 ... Motivation Main Idea: use second order tools to derive efficient

More information

Mathematical Optimisation, Chpt 2: Linear Equations and inequalities

Mathematical Optimisation, Chpt 2: Linear Equations and inequalities Introduction Gauss-elimination Orthogonal projection Linear Inequalities Integer Solutions Mathematical Optimisation, Chpt 2: Linear Equations and inequalities Peter J.C. Dickinson p.j.c.dickinson@utwente.nl

More information

Strictly Positive Definite Functions on a Real Inner Product Space

Strictly Positive Definite Functions on a Real Inner Product Space Strictly Positive Definite Functions on a Real Inner Product Space Allan Pinkus Abstract. If ft) = a kt k converges for all t IR with all coefficients a k 0, then the function f< x, y >) is positive definite

More information

Econ 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. 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 information

MATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018

MATH 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 information

2. Linear algebra. matrices and vectors. linear equations. range and nullspace of matrices. function of vectors, gradient and Hessian

2. Linear algebra. matrices and vectors. linear equations. range and nullspace of matrices. function of vectors, gradient and Hessian FE661 - Statistical Methods for Financial Engineering 2. Linear algebra Jitkomut Songsiri matrices and vectors linear equations range and nullspace of matrices function of vectors, gradient and Hessian

More information

Using Schur Complement Theorem to prove convexity of some SOC-functions

Using 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 information

Module 02 CPS Background: Linear Systems Preliminaries

Module 02 CPS Background: Linear Systems Preliminaries Module 02 CPS Background: Linear Systems Preliminaries Ahmad F. Taha EE 5243: Introduction to Cyber-Physical Systems Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ taha/index.html August

More information

We describe the generalization of Hazan s algorithm for symmetric programming

We 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 information

Lecture 7 Monotonicity. September 21, 2008

Lecture 7 Monotonicity. September 21, 2008 Lecture 7 Monotonicity September 21, 2008 Outline Introduce several monotonicity properties of vector functions Are satisfied immediately by gradient maps of convex functions In a sense, role of monotonicity

More information

Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition

Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition Guoyin Li Communicated by X.Q. Yang Abstract In this paper, we establish global optimality

More information

Projected Perspective Reformulations for NonLinear Network Design Problems

Projected Perspective Reformulations for NonLinear Network Design Problems Projected Perspective Reformulations for NonLinear Network Design Problems Antonio Frangioni Claudio Gentile Enrico Grande Andrea Pacifici Dipartimento di Informatica, Università di Pisa Polo Universitario

More information

A Necessary and Sufficient Condition. of a Mixed NE in Bimatrix Games

A Necessary and Sufficient Condition. of a Mixed NE in Bimatrix Games International Journal of lgebra, Vol. 1, 27, no. 7, 33-31 Necessary and Sufficient Condition of a Mixed NE in Bimatrix Games Tadeusz Ostrowski Institute of Management, The State Vocational University ul.

More information

Absolute value equations

Absolute value equations Linear Algebra and its Applications 419 (2006) 359 367 www.elsevier.com/locate/laa Absolute value equations O.L. Mangasarian, R.R. Meyer Computer Sciences Department, University of Wisconsin, 1210 West

More information

LEARNING IN CONCAVE GAMES

LEARNING IN CONCAVE GAMES LEARNING IN CONCAVE GAMES P. Mertikopoulos French National Center for Scientific Research (CNRS) Laboratoire d Informatique de Grenoble GSBE ETBC seminar Maastricht, October 22, 2015 Motivation and Preliminaries

More information

Mechanism design and allocation algorithms for energy-network markets with piece-wise linear costs and quadratic externalities

Mechanism design and allocation algorithms for energy-network markets with piece-wise linear costs and quadratic externalities 1 / 45 Mechanism design and allocation algorithms for energy-network markets with piece-wise linear costs and quadratic externalities Alejandro Jofré 1 Center for Mathematical Modeling & DIM Universidad

More information

6.254 : Game Theory with Engineering Applications Lecture 8: Supermodular and Potential Games

6.254 : Game Theory with Engineering Applications Lecture 8: Supermodular and Potential Games 6.254 : Game Theory with Engineering Applications Lecture 8: Supermodular and Asu Ozdaglar MIT March 2, 2010 1 Introduction Outline Review of Supermodular Games Reading: Fudenberg and Tirole, Section 12.3.

More information

ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES

ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES olume 10 2009, Issue 2, Article 41, 10 pp. ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES HANYU LI, HU YANG, AND HUA SHAO COLLEGE OF MATHEMATICS AND PHYSICS CHONGQING UNIERSITY

More information

6.254 : Game Theory with Engineering Applications Lecture 7: Supermodular Games

6.254 : Game Theory with Engineering Applications Lecture 7: Supermodular Games 6.254 : Game Theory with Engineering Applications Lecture 7: Asu Ozdaglar MIT February 25, 2010 1 Introduction Outline Uniqueness of a Pure Nash Equilibrium for Continuous Games Reading: Rosen J.B., Existence

More information

ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES

ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES HANYU LI, HU YANG College of Mathematics and Physics Chongqing University Chongqing, 400030, P.R. China EMail: lihy.hy@gmail.com,

More information

Contraction Methods for Convex Optimization and Monotone Variational Inequalities No.16

Contraction Methods for Convex Optimization and Monotone Variational Inequalities No.16 XVI - 1 Contraction Methods for Convex Optimization and Monotone Variational Inequalities No.16 A slightly changed ADMM for convex optimization with three separable operators Bingsheng He Department of

More information

Copositive Plus Matrices

Copositive Plus Matrices Copositive Plus Matrices Willemieke van Vliet Master Thesis in Applied Mathematics October 2011 Copositive Plus Matrices Summary In this report we discuss the set of copositive plus matrices and their

More information

Gradient Methods Using Momentum and Memory

Gradient Methods Using Momentum and Memory Chapter 3 Gradient Methods Using Momentum and Memory The steepest descent method described in Chapter always steps in the negative gradient direction, which is orthogonal to the boundary of the level set

More information

Game Theory. Greg Plaxton Theory in Programming Practice, Spring 2004 Department of Computer Science University of Texas at Austin

Game Theory. Greg Plaxton Theory in Programming Practice, Spring 2004 Department of Computer Science University of Texas at Austin Game Theory Greg Plaxton Theory in Programming Practice, Spring 2004 Department of Computer Science University of Texas at Austin Bimatrix Games We are given two real m n matrices A = (a ij ), B = (b ij

More information

4F3 - Predictive Control

4F3 - Predictive Control 4F3 Predictive Control - Lecture 2 p 1/23 4F3 - Predictive Control Lecture 2 - Unconstrained Predictive Control Jan Maciejowski jmm@engcamacuk 4F3 Predictive Control - Lecture 2 p 2/23 References Predictive

More information

ECE580 Fall 2015 Solution to Midterm Exam 1 October 23, Please leave fractions as fractions, but simplify them, etc.

ECE580 Fall 2015 Solution to Midterm Exam 1 October 23, Please leave fractions as fractions, but simplify them, etc. ECE580 Fall 2015 Solution to Midterm Exam 1 October 23, 2015 1 Name: Solution Score: /100 This exam is closed-book. You must show ALL of your work for full credit. Please read the questions carefully.

More information

Stability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games

Stability 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 information

L. 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 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 information

Symmetric Matrices and Eigendecomposition

Symmetric Matrices and Eigendecomposition Symmetric Matrices and Eigendecomposition Robert M. Freund January, 2014 c 2014 Massachusetts Institute of Technology. All rights reserved. 1 2 1 Symmetric Matrices and Convexity of Quadratic Functions

More information

OPTIMAL SCALING FOR P -NORMS AND COMPONENTWISE DISTANCE TO SINGULARITY

OPTIMAL SCALING FOR P -NORMS AND COMPONENTWISE DISTANCE TO SINGULARITY published in IMA Journal of Numerical Analysis (IMAJNA), Vol. 23, 1-9, 23. OPTIMAL SCALING FOR P -NORMS AND COMPONENTWISE DISTANCE TO SINGULARITY SIEGFRIED M. RUMP Abstract. In this note we give lower

More information

Scattered Data Interpolation with Polynomial Precision and Conditionally Positive Definite Functions

Scattered Data Interpolation with Polynomial Precision and Conditionally Positive Definite Functions Chapter 3 Scattered Data Interpolation with Polynomial Precision and Conditionally Positive Definite Functions 3.1 Scattered Data Interpolation with Polynomial Precision Sometimes the assumption on the

More information

The convergence of stationary iterations with indefinite splitting

The convergence of stationary iterations with indefinite splitting The convergence of stationary iterations with indefinite splitting Michael C. Ferris Joint work with: Tom Rutherford and Andy Wathen University of Wisconsin, Madison 6th International Conference on Complementarity

More information

Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems

Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems Georgia Southern University Digital Commons@Georgia Southern Electronic Theses and Dissertations Graduate Studies, Jack N. Averitt College of Summer 2011 Full-Newton-Step Interior-Point Method for the

More information

Positive Definite Matrix

Positive Definite Matrix 1/29 Chia-Ping Chen Professor Department of Computer Science and Engineering National Sun Yat-sen University Linear Algebra Positive Definite, Negative Definite, Indefinite 2/29 Pure Quadratic Function

More information

Structural and Multidisciplinary Optimization. P. Duysinx and P. Tossings

Structural and Multidisciplinary Optimization. P. Duysinx and P. Tossings Structural and Multidisciplinary Optimization P. Duysinx and P. Tossings 2018-2019 CONTACTS Pierre Duysinx Institut de Mécanique et du Génie Civil (B52/3) Phone number: 04/366.91.94 Email: P.Duysinx@uliege.be

More information

Convex Functions and Optimization

Convex Functions and Optimization Chapter 5 Convex Functions and Optimization 5.1 Convex Functions Our next topic is that of convex functions. Again, we will concentrate on the context of a map f : R n R although the situation can be generalized

More information

N. L. P. NONLINEAR PROGRAMMING (NLP) deals with optimization models with at least one nonlinear function. NLP. Optimization. Models of following form:

N. L. P. NONLINEAR PROGRAMMING (NLP) deals with optimization models with at least one nonlinear function. NLP. Optimization. Models of following form: 0.1 N. L. P. Katta G. Murty, IOE 611 Lecture slides Introductory Lecture NONLINEAR PROGRAMMING (NLP) deals with optimization models with at least one nonlinear function. NLP does not include everything

More information

Online Appendices for Large Matching Markets: Risk, Unraveling, and Conflation

Online Appendices for Large Matching Markets: Risk, Unraveling, and Conflation Online Appendices for Large Matching Markets: Risk, Unraveling, and Conflation Aaron L. Bodoh-Creed - Cornell University A Online Appendix: Strategic Convergence In section 4 we described the matching

More information

A Smoothing Newton Method for Solving Absolute Value Equations

A Smoothing Newton Method for Solving Absolute Value Equations A Smoothing Newton Method for Solving Absolute Value Equations Xiaoqin Jiang Department of public basic, Wuhan Yangtze Business University, Wuhan 430065, P.R. China 392875220@qq.com Abstract: In this paper,

More information

OPTIMALITY AND STABILITY OF SYMMETRIC EVOLUTIONARY GAMES WITH APPLICATIONS IN GENETIC SELECTION. (Communicated by Yang Kuang)

OPTIMALITY AND STABILITY OF SYMMETRIC EVOLUTIONARY GAMES WITH APPLICATIONS IN GENETIC SELECTION. (Communicated by Yang Kuang) MATHEMATICAL BIOSCIENCES doi:10.3934/mbe.2015.12.503 AND ENGINEERING Volume 12, Number 3, June 2015 pp. 503 523 OPTIMALITY AND STABILITY OF SYMMETRIC EVOLUTIONARY GAMES WITH APPLICATIONS IN GENETIC SELECTION

More information

Quadratic reformulation techniques for 0-1 quadratic programs

Quadratic reformulation techniques for 0-1 quadratic programs OSE SEMINAR 2014 Quadratic reformulation techniques for 0-1 quadratic programs Ray Pörn CENTER OF EXCELLENCE IN OPTIMIZATION AND SYSTEMS ENGINEERING ÅBO AKADEMI UNIVERSITY ÅBO NOVEMBER 14th 2014 2 Structure

More information

Australian Journal of Basic and Applied Sciences, 5(9): , 2011 ISSN Fuzzy M -Matrix. S.S. Hashemi

Australian Journal of Basic and Applied Sciences, 5(9): , 2011 ISSN Fuzzy M -Matrix. S.S. Hashemi ustralian Journal of Basic and pplied Sciences, 5(9): 2096-204, 20 ISSN 99-878 Fuzzy M -Matrix S.S. Hashemi Young researchers Club, Bonab Branch, Islamic zad University, Bonab, Iran. bstract: The theory

More information

Game theory: Models, Algorithms and Applications Lecture 4 Part II Geometry of the LCP. September 10, 2008

Game theory: Models, Algorithms and Applications Lecture 4 Part II Geometry of the LCP. September 10, 2008 Game theory: Models, Algorithms and Applications Lecture 4 Part II Geometry of the LCP September 10, 2008 Geometry of the Complementarity Problem Definition 1 The set pos(a) generated by A R m p represents

More information

Solution methods for quasi variational inequalities

Solution methods for quasi variational inequalities Solution methods for quasi variational inequalities Simone Sagratella May 29, 2013 PhD thesis in Operations Research Sapienza University of Rome Advisor: Prof. Francisco Facchinei Introduction Quasi variational

More information

Generalized Riccati Equations Arising in Stochastic Games

Generalized Riccati Equations Arising in Stochastic Games Generalized Riccati Equations Arising in Stochastic Games Michael McAsey a a Department of Mathematics Bradley University Peoria IL 61625 USA mcasey@bradley.edu Libin Mou b b Department of Mathematics

More information

The extreme rays of the 5 5 copositive cone

The extreme rays of the 5 5 copositive cone The extreme rays of the copositive cone Roland Hildebrand March 8, 0 Abstract We give an explicit characterization of all extreme rays of the cone C of copositive matrices. The results are based on the

More information

Constrained optimization: direct methods (cont.)

Constrained optimization: direct methods (cont.) Constrained optimization: direct methods (cont.) Jussi Hakanen Post-doctoral researcher jussi.hakanen@jyu.fi Direct methods Also known as methods of feasible directions Idea in a point x h, generate a

More information

On the relation between concavity cuts and the surrogate dual for convex maximization problems

On the relation between concavity cuts and the surrogate dual for convex maximization problems On the relation between concavity cuts and the surrogate dual for convex imization problems Marco Locatelli Dipartimento di Ingegneria Informatica, Università di Parma Via G.P. Usberti, 181/A, 43124 Parma,

More information

Infeasible Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems

Infeasible Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems Georgia Southern University Digital Commons@Georgia Southern Electronic Theses & Dissertations Graduate Studies, Jack N. Averitt College of Fall 2012 Infeasible Full-Newton-Step Interior-Point Method for

More information

L 2 -induced Gains of Switched Systems and Classes of Switching Signals

L 2 -induced Gains of Switched Systems and Classes of Switching Signals L 2 -induced Gains of Switched Systems and Classes of Switching Signals Kenji Hirata and João P. Hespanha Abstract This paper addresses the L 2-induced gain analysis for switched linear systems. We exploit

More information

UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems

UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems Robert M. Freund February 2016 c 2016 Massachusetts Institute of Technology. All rights reserved. 1 1 Introduction

More information

Nonlinear Programming

Nonlinear Programming Nonlinear Programming Kees Roos e-mail: C.Roos@ewi.tudelft.nl URL: http://www.isa.ewi.tudelft.nl/ roos LNMB Course De Uithof, Utrecht February 6 - May 8, A.D. 2006 Optimization Group 1 Outline for week

More information

QUADRATIC FORMS AND DEFINITE MATRICES. a 11 a 1n. a n1 a nn a 1i x i

QUADRATIC FORMS AND DEFINITE MATRICES. a 11 a 1n. a n1 a nn a 1i x i QUADRATIC FORMS AND DEFINITE MATRICES 1 DEFINITION AND CLASSIFICATION OF QUADRATIC FORMS 11Definitionofaquadraticform LetAdenoteannxnsymmetricmatrixwithrealentriesand letxdenoteanncolumnvectorthenq=x AxissaidtobeaquadraticformNotethat

More information

arxiv: v3 [math.ra] 10 Jun 2016

arxiv: v3 [math.ra] 10 Jun 2016 To appear in Linear and Multilinear Algebra Vol. 00, No. 00, Month 0XX, 1 10 The critical exponent for generalized doubly nonnegative matrices arxiv:1407.7059v3 [math.ra] 10 Jun 016 Xuchen Han a, Charles

More information

x +3y 2t = 1 2x +y +z +t = 2 3x y +z t = 7 2x +6y +z +t = a

x +3y 2t = 1 2x +y +z +t = 2 3x y +z t = 7 2x +6y +z +t = a UCM Final Exam, 05/8/014 Solutions 1 Given the parameter a R, consider the following linear system x +y t = 1 x +y +z +t = x y +z t = 7 x +6y +z +t = a (a (6 points Discuss the system depending on the

More information

February Working Paper A Variational Approach to Network Games. Emerson Melo

February Working Paper A Variational Approach to Network Games. Emerson Melo February 2018 Working Paper 005.2018 A Variational Approach to Network Games Emerson Melo Economic Theory Series Editor: Matteo Manera A Variational Approach to Network Games By Emerson Melo, Indiana University,

More information

REVIEW OF DIFFERENTIAL CALCULUS

REVIEW OF DIFFERENTIAL CALCULUS REVIEW OF DIFFERENTIAL CALCULUS DONU ARAPURA 1. Limits and continuity To simplify the statements, we will often stick to two variables, but everything holds with any number of variables. Let f(x, y) be

More information

Chapter 9. Mixed Extensions. 9.1 Mixed strategies

Chapter 9. Mixed Extensions. 9.1 Mixed strategies Chapter 9 Mixed Extensions We now study a special case of infinite strategic games that are obtained in a canonic way from the finite games, by allowing mixed strategies. Below [0, 1] stands for the real

More information

On optimal quadratic Lyapunov functions for polynomial systems

On optimal quadratic Lyapunov functions for polynomial systems On optimal quadratic Lyapunov functions for polynomial systems G. Chesi 1,A.Tesi 2, A. Vicino 1 1 Dipartimento di Ingegneria dell Informazione, Università disiena Via Roma 56, 53100 Siena, Italy 2 Dipartimento

More information

Some bounds for the spectral radius of the Hadamard product of matrices

Some bounds for the spectral radius of the Hadamard product of matrices Some bounds for the spectral radius of the Hadamard product of matrices Tin-Yau Tam Mathematics & Statistics Auburn University Georgia State University, May 28, 05 in honor of Prof. Jean H. Bevis Some

More information

Improved Full-Newton-Step Infeasible Interior- Point Method for Linear Complementarity Problems

Improved Full-Newton-Step Infeasible Interior- Point Method for Linear Complementarity Problems Georgia Southern University Digital Commons@Georgia Southern Electronic Theses & Dissertations Graduate Studies, Jack N. Averitt College of Summer 2015 Improved Full-Newton-Step Infeasible Interior- Point

More information

Solving Quadratic Multi-Leader-Follower Games by Smoothing the Follower s Best Response

Solving Quadratic Multi-Leader-Follower Games by Smoothing the Follower s Best Response A U G U S T 2 0 1 8 P R E P R I N T 4 8 2 Solving Quadratic Multi-Leader-Follower Games by Smoothing the Follower s Best Response Michael Herty, Sonja Steffensen and Anna Thu nen Institut für Geometrie

More information

A SIMPLY CONSTRAINED OPTIMIZATION REFORMULATION OF KKT SYSTEMS ARISING FROM VARIATIONAL INEQUALITIES

A SIMPLY CONSTRAINED OPTIMIZATION REFORMULATION OF KKT SYSTEMS ARISING FROM VARIATIONAL INEQUALITIES A SIMPLY CONSTRAINED OPTIMIZATION REFORMULATION OF KKT SYSTEMS ARISING FROM VARIATIONAL INEQUALITIES Francisco Facchinei 1, Andreas Fischer 2, Christian Kanzow 3, and Ji-Ming Peng 4 1 Università di Roma

More information

Key words. saddle-point dynamics, asymptotic convergence, convex-concave functions, proximal calculus, center manifold theory, nonsmooth dynamics

Key words. saddle-point dynamics, asymptotic convergence, convex-concave functions, proximal calculus, center manifold theory, nonsmooth dynamics SADDLE-POINT DYNAMICS: CONDITIONS FOR ASYMPTOTIC STABILITY OF SADDLE POINTS ASHISH CHERUKURI, BAHMAN GHARESIFARD, AND JORGE CORTÉS Abstract. This paper considers continuously differentiable functions of

More information

Numerical Methods I Solving Nonlinear Equations

Numerical Methods I Solving Nonlinear Equations Numerical Methods I Solving Nonlinear Equations Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 October 16th, 2014 A. Donev (Courant Institute)

More information

Permutation invariant proper polyhedral cones and their Lyapunov rank

Permutation 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 information

Convex Quadratic Approximation

Convex Quadratic Approximation Convex Quadratic Approximation J. Ben Rosen 1 and Roummel F. Marcia 2 Abstract. For some applications it is desired to approximate a set of m data points in IR n with a convex quadratic function. Furthermore,

More information

VECTORS, TENSORS AND INDEX NOTATION

VECTORS, TENSORS AND INDEX NOTATION VECTORS, TENSORS AND INDEX NOTATION Enrico Nobile Dipartimento di Ingegneria e Architettura Università degli Studi di Trieste, 34127 TRIESTE March 5, 2018 Vectors & Tensors, E. Nobile March 5, 2018 1 /

More information

Chapter Introduction. A. Bensoussan

Chapter Introduction. A. Bensoussan Chapter 2 EXPLICIT SOLUTIONS OFLINEAR QUADRATIC DIFFERENTIAL GAMES A. Bensoussan International Center for Decision and Risk Analysis University of Texas at Dallas School of Management, P.O. Box 830688

More information

Research Article The Solution Set Characterization and Error Bound for the Extended Mixed Linear Complementarity Problem

Research Article The Solution Set Characterization and Error Bound for the Extended Mixed Linear Complementarity Problem Journal of Applied Mathematics Volume 2012, Article ID 219478, 15 pages doi:10.1155/2012/219478 Research Article The Solution Set Characterization and Error Bound for the Extended Mixed Linear Complementarity

More information

Nonlinear Optimization

Nonlinear Optimization Nonlinear Optimization (Com S 477/577 Notes) Yan-Bin Jia Nov 7, 2017 1 Introduction Given a single function f that depends on one or more independent variable, we want to find the values of those variables

More information

Chapter 13. Convex and Concave. Josef Leydold Mathematical Methods WS 2018/19 13 Convex and Concave 1 / 44

Chapter 13. Convex and Concave. Josef Leydold Mathematical Methods WS 2018/19 13 Convex and Concave 1 / 44 Chapter 13 Convex and Concave Josef Leydold Mathematical Methods WS 2018/19 13 Convex and Concave 1 / 44 Monotone Function Function f is called monotonically increasing, if x 1 x 2 f (x 1 ) f (x 2 ) It

More information

Semidefinite Programming Basics and Applications

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

More information

Game Theoretic Solutions for Precoding Strategies over the Interference Channel

Game Theoretic Solutions for Precoding Strategies over the Interference Channel Game Theoretic Solutions for Precoding Strategies over the Interference Channel Jie Gao, Sergiy A. Vorobyov, and Hai Jiang Department of Electrical & Computer Engineering, University of Alberta, Canada

More information

Equivalent Bilevel Programming Form for the Generalized Nash Equilibrium Problem

Equivalent Bilevel Programming Form for the Generalized Nash Equilibrium Problem Vol. 2, No. 1 ISSN: 1916-9795 Equivalent Bilevel Programming Form for the Generalized Nash Equilibrium Problem Lianju Sun College of Operations Research and Management Science, Qufu Normal University Tel:

More information

ECE580 Exam 1 October 4, Please do not write on the back of the exam pages. Extra paper is available from the instructor.

ECE580 Exam 1 October 4, Please do not write on the back of the exam pages. Extra paper is available from the instructor. ECE580 Exam 1 October 4, 2012 1 Name: Solution Score: /100 You must show ALL of your work for full credit. This exam is closed-book. Calculators may NOT be used. Please leave fractions as fractions, etc.

More information

Randomized Hessian Estimation and Directional Search

Randomized Hessian Estimation and Directional Search Randomized Hessian Estimation and Directional Search D. Leventhal A.S. Lewis September 4, 008 Key words: derivative-free optimization, directional search, quasi-newton, random search, steepest descent

More information

RECURSIVE APPROXIMATION OF THE HIGH DIMENSIONAL max FUNCTION

RECURSIVE APPROXIMATION OF THE HIGH DIMENSIONAL max FUNCTION RECURSIVE APPROXIMATION OF THE HIGH DIMENSIONAL max FUNCTION Ş. İ. Birbil, S.-C. Fang, J. B. G. Frenk and S. Zhang Faculty of Engineering and Natural Sciences Sabancı University, Orhanli-Tuzla, 34956,

More information

Supplementary appendix to the paper Hierarchical cheap talk Not for publication

Supplementary appendix to the paper Hierarchical cheap talk Not for publication Supplementary appendix to the paper Hierarchical cheap talk Not for publication Attila Ambrus, Eduardo M. Azevedo, and Yuichiro Kamada December 3, 011 1 Monotonicity of the set of pure-strategy equilibria

More information

Analytical formulas for calculating extremal ranks and inertias of quadratic matrix-valued functions and their applications

Analytical formulas for calculating extremal ranks and inertias of quadratic matrix-valued functions and their applications Analytical formulas for calculating extremal ranks and inertias of quadratic matrix-valued functions and their applications Yongge Tian CEMA, Central University of Finance and Economics, Beijing 100081,

More information

1 Directional Derivatives and Differentiability

1 Directional Derivatives and Differentiability Wednesday, January 18, 2012 1 Directional Derivatives and Differentiability Let E R N, let f : E R and let x 0 E. Given a direction v R N, let L be the line through x 0 in the direction v, that is, L :=

More information

Variational inequality formulation of chance-constrained games

Variational inequality formulation of chance-constrained games Variational inequality formulation of chance-constrained games Joint work with Vikas Singh from IIT Delhi Université Paris Sud XI Computational Management Science Conference Bergamo, Italy May, 2017 Outline

More information

Optimality, Duality, Complementarity for Constrained Optimization

Optimality, Duality, Complementarity for Constrained Optimization Optimality, Duality, Complementarity for Constrained Optimization Stephen Wright University of Wisconsin-Madison May 2014 Wright (UW-Madison) Optimality, Duality, Complementarity May 2014 1 / 41 Linear

More information

More on positive subdefinite matrices and the linear complementarity problem

More on positive subdefinite matrices and the linear complementarity problem Linear Algebra and its Applications 338 (2001) 275 285 www.elsevier.com/locate/laa More on positive subdefinite matrices and the linear complementarity problem S.R. Mohan a,,s.k.neogy a,a.k.das b a Department

More information

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

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

More information

ON THE PARAMETRIC LCP: A HISTORICAL PERSPECTIVE

ON THE PARAMETRIC LCP: A HISTORICAL PERSPECTIVE ON THE PARAMETRIC LCP: A HISTORICAL PERSPECTIVE Richard W. Cottle Department of Management Science and Engineering Stanford University ICCP 2014 Humboldt University Berlin August, 2014 1 / 55 The year

More information