ON COMPUTING COURNOT-NASH EQUILIBRIA
|
|
- Antonia Cross
- 7 years ago
- Views:
Transcription
1 ON COMPUTING COURNOT-NASH EQUILIBRIA The quotation marks in the title above pertain to the primary source for this lecture which is: Charles D. Kolstad and Lars Mathiesen, Computing Cournot-Nash Equilibria, Operations Research 39 (1991) This paper nicely employs many of the ideas presented in this course. Its main mission, however, is to discuss conditions that assure the convergence of a successive linear complementarity algorithm for solving the nonlinear complementarity problem that arises from a barebones version of the Cournot-Nash equilibrium problem. Much of the discussion in the paper is done in economic terms.
2 Other references Most of the heavy lifting in this paper is done by applying results from the literature, especially S. Karamardian, The Complementarity Problem, Mathematical Programming 2 (1972) J.J. Moré, Classes of Functions and Feasibility Conditions in Nonlinear Complementarity Problems, Mathematical Programming 6 (1974) J.J. Moré and W.C. Rheinboldt, On P- and S-functions and Related Classes of n-dimensional Nonlinear Mappings, Linear Algebra and its Applications 6 (1973) J-S. Pang and D. Chan, Iterative Methods for Variational and Complementarity Problems, Mathematical Programming 24 (1982)
3 Notational problems There is a clash of notation between what is traditionally used in economics and what is used in LCP theory. This is especially noticeable when it comes to the letter q. In economics, and, more importantly, in this paper, q usually denotes a vector of quantities and is a variable. In the LCP, q is usually denotes a constant vector, as in (q,m). The Kolstad-Mathiesen (K-M) paper tends to be confusing on this issue by switching without warning from the variable q (economics) to the variable x (mathematics) or to the LCP constant q.
4 To bring a little more clarity to the discussion, we will not use the symbol q as the constant vector of an LCP. For that matter, we will use (b, A) as the notation for an LCP with affine mapping b + Ax. The K-M paper lacks a notation for the subvector obtained by disregarding one of its components. So, with a slight abuse of notation we write q =(q 1,...,q N )=(q i, q i ). Up to a permutation of coordinates, q = q i q i.
5 The problem We assume there are N firms, each producing the same good. The variable q i (to be determined) denotes the output of the ith firm. The cost of this production is C i (q i ) and is assumed to be known. There is a known inverse demand function P (Q) where Q = e T q, the sum of all outputs. The profit of firm i is given by π i (q i, q i )=P (Q)q i C i (q i ) (1) Strictly speaking, π i is a function of all N output variables, but only q i is under the control of firm i. Definition. A Cournot equilibrium for this set of firms is a vector q such that π i (q i, q i ) = max q i 0 (q i, q i ) for all i =1,...N Note the absence of any constraints on the q i other than nonnegativity.
6 Assumptions The inverse demand function P ( ) and the cost functions C i ( ) are assumed to be twice continuously differentiable. The profit functions are assumed to be concave with respect to own output. That is, for q i fixed, π i is a concave function of q i. Under these assumptions, the set of Cournot equilibria is the same as the set of simultaneous solutions of the first-order optimality conditions of the N individual firms problems. These are f i π i q i = C i (q i) P (Q) q i P (Q) 0, π q i i q i = 0, q i 0 i (2) We recognize this system as the nonlinear complementarity problem CP (R N +,f) f(q) 0, q 0, q T f(q) =0. (3)
7 Lemma 1. If the profit functions π i (q i, q i ) are all twice continuously differentiable and concave with respect to own output q i, then q is a Cournot equilibrium if and only if q SOL CP(R+ N,f) as given in (2) and (3). This is easily proved and can be related to the proposition giving necessary and sufficient conditions for a point to be a Nash equilibrium which were expressed in terms of a variational inequality problem. Under the present circumstances, that VI problem is equivalent to a the nonlinear complementarity problem CP (R N +,f).
8 A switch to complementarity theory Having set up the above nonlinear complementarity problem, Kolstad and Mathiesen state a couple of results from (nonlinear) complementarity theory. With this digression, they also switch the notation of the variable from q to x. The following lemma is due to S. Karamardian (1972, Theorem 3.2). Lemma 2. Let f : R+ N RN be continuous. Assume there exists a nonempty compact set K R+ N such that for every x RN + \ K there exists a y K with (x y) T f(x) > 0. Then there exists a solution to CP (R+ N,f). Note. There is a slight error in the K&M statement of Lemma 2. They take K to be a subset of R N whereas Karamardian requires it to be a subset of R+ N so that f will be well defined there.
9 Proof of Lemma 2. For every u R N +, let D u = {x : x K, (u x) T f(x) 0} The sets D u are clearly closed. The intersection of any finite number of the D u s is nonempty. To see this, let D be the convex hull of K {u 1,...,u m }. Then D is a nonempty, compact convex subset of R+ N. It follows from the Hartman-Stampacchia Theorem on variational inequalities that there exists a point x D such that (x x) T f( x) 0 for all x D. So in particular, (u i x) T f( x) 0 for i =1,...,m. It remains to prove x K. If not, the assumption of the lemma implies there exists y K such that (y x) T f( x) < 0 in contradiction to the second inequality of the proof. From the finite intersection property of compact sets, we have
10 D u, u R N + This implies that there exists x K such that (x x ) T f(x ) 0 for all x R+ N, meaning that x solves CP (R+ N,f).
11 Kolstad and Mathiesen attribute the following lemma to Jorge Moré (1974). Actually, the result is informally stated on p.329 of Moré s paper but is attributed to Moré and Rheinboldt (1973, Theorem 5.2). Lemma 3. If f is continuously differentiable (on an open set containing R+ N ) and f(x) is a P-matrix for all x RN +, then there exists at most one solution to CP (R+ N,f).
12 Kolstad and Mathiesen attribute the following lemma to Jorge Moré (1974). Actually, the result is informally stated on p.329 of Moré s paper but is attributed to Moré and Rheinboldt (1973, Theorem 5.2). Lemma 3. If f is continuously differentiable (on an open set containing R+ N ) and f(x) is a P-matrix for all x RN +, then there exists at most one solution to CP (R+ N,f). Remark. Note that Lemma 3 asserts only the uniqueness not the existence of a solution to CP (R+ N,f). Indeed, it is not enough for f(x) to be a P-matrix for all x R+ N, even if the problem is feasible. This was illustrated by Cottle (1965, p.151). The latter paper establishes the existence of a solution through a heavy-handed assumption called positive boundedness of the Jacobian matrix which in this case would say that there exists δ (0, 1) such that for all x R N, every principal minor of f(x) lies between δ and δ 1.
13 Towards existence As noted above, establishing the existence of a solution requires something stronger than the positivity of the principal minors of f(x). Here is what Kolstad and Mathiesen use. Definition. Industry output is bounded by Q >0 if output in excess of Q from any producer (firm) implies that the marginal profits of all producers are negative. Industry boundedness is a reasonable condition and is assumed below.
14 A bit of matrix terminology Let A =[a ij ] R N N. Then A is row strictly diagonally dominant if there exists a positive vector d such that d i a ii > j =i d j a ij i =1,...,N (4) Analogous terminology holds for column strict diagonal dominance. If d i =1for all i, then A is called an Hadamard matrix. There is quite a bit of literature on diagonally dominant matrices. If A has a positive diagonal and is row strictly diagonally dominant it is a P-matrix. If A has a positive diagonal and there is a positive vector d with respect to which A has both row and column strict diagonal dominance, then it is called positive strictly diagonally dominant. Such a matrix has to be positive definite in the sense used in this course. A good place to find information on diagonally dominant matrices and their applications in economics is Section 21 of the book Convex Structures and Economic Theory by H. Nikaido (New York: Academic Press, 1968)).
15 Sufficient conditions for existence of a Cournot equilibrium Theorem 1. If (i) each firm s profit function π i ( ) is twice continuously differentiable, (ii) each firm s proifit function is concave, (iii) industry output is bounded, and (iv) f has a negative strictly dominant diagonal for all q 0, then there exists a unique Cournot equilibrium. Proof. The assumptions imply that f(q) has a positive dominant diagonal for all q 0, and hence it is a P-matrix. By Lemma 3, CP (R+ N,f) has at most one solution. By assumption (ii), Lemma 2 implies that a solution exists (take y 0 that violates the industry bound condition). The Cournot equilibrium is unique by Lemma 1.
16 Preliminaries of the SLCP Algorithm The SLCP Algorithm for CP (R+ N,f) is obvious and easily executed. Proving its local or global convergence is another matter. The linearization of f at y is Lf(x y) f(y)+ f(y)(x y) (5) Note that Lf(x y) =f(y) f(y)y + f(y)x form b + Ax. which is of the Note also that there is an implicit assumption here that f is known.
17 The SLCP Algorithm Step 0. Initialization. Pick x 0 R N + and set k =0. Step 1. Test for termination. If x k satisfacties the convergence criterion, stop. Step 2. Linearization. Compute Lf(x x k ). Step 3. Solve the approximation. Let x k+1 solve the LCP (b, A) = (f(x k ) f(x k )x k, f(x k )). Return to Step 1 with k k +1. Note. In the application of this algorithm to the Cournot equilibrium problem, the vectors x k are really vectors of production levels q k of the N firms. Note. Under the assumptions of Theorem 1, f(x k ) is a P-matrix for all k 0.
18 Local convergence and global convergence Different sorts of algorithms yield different sorts of convergence results. There is a variant of Newton s method that is sometimes used on complementarity problems. Under favorable conditions, it converges quadratically, but from a starting point sufficiently near the solution. For this, it is helpful to have the following Definition. The function g is Lipschitz continuous if there exists a positive scalar β such that for all x and y in the domain of g, g(x) g(y) <β x y.
19 A local convergence result Kolstad and Mathiesen attribute the following lemma to Pang and Chan (1982). It appears to be a variant of Pang and Chan s Corollary 2.6, a consequence of their Theorem 2.1 which is about variational inequalities and Newton s method, not Lemke s Algorithm. Lemma 4. Let K be a nonempty closed convex subset of R N. Let f : R N + RN be continuously differentiable. Suppose that x solves the CP (R N +,f) and that f(x ) is positive definite. Then there exists a neighborhood of x such that if the initial iterate x 0 is chosen there, the sequence {x k } of solutions to CP (f(x k 1 ) f(x k 1 )x k 1, f(x k 1 )) is well defined and converges to x. Moreover, if f is Lipschitz continuous at x, then {x k } converges quadratically to x.
20 Lemma 4. Let K be a nonempty closed convex subset of R N. Let f : R N + RN be continuously differentiable. Suppose that x solves the CP (R N +,f) and that f(x ) is positive definite. Then there exists a neighborhood of x such that if the initial iterate x 0 is chosen there, the sequence {x k } of solutions to LCP (f(x k 1 ) f(x k 1 )x k 1, f(x k 1 )) is well defined and converges to x. Moreover, if f is Lipschitz continuous at x, then {x k } converges quadratically to x. Do you notice anything strange about this lemma?
21 Kolstad and Mathiesen prove the following local convergence theorem by applying Lemma 4. Theorem 2. Let q solve CP (2), the conditions for a Cournot equilibrium. Assume that (i) each firm s profit function π i, is twice continuously differentiable, and (ii) the Jacobian of the marginal profits (i.e., f) has a negative strictly dominant diagonal. Then there exists a neighborhood of q such that when the initial iterate q 0 is chosen there, the SLCP Algorithm computes a sequence {q k } that converges to q (quadratically if 2 π is Lipschitz continuous).
22 Global convergence Here Kolstad and Mathiesen are interested in getting a convergent sequence of iterates {q k } without having to start from a point in a sufficiently small neighborhood of the solution being sought. Here, following Pang and Chan, they bring in K-matrices, that is matrices belonging to P Z. Their version of Pang and Chan s Theorem 4.2 is Lemma 5. Let f : R N + RN be convex and differentiable. If there exists a K-matrix X such that f(x)x Z for all x 0 such that f(x) 0, then there exists a well defined sequence {x k }, where for k 1, x k solves the LCP (f(x k 1 ) f(x k 1 )x k 1, f(x k 1 )) such that {x k } converges to some solution of CP (R N +,f) for any feasible x 0. To make this lemma applicable to the Cournot equilibrium problem, Kolstad and Mathiesen impose extra conditions on the mapping f.
23 The assume that the components of f are convex functions and that there exists a K-matrix X such that f(q)x Z for all feasible q. Some technical details follow on why these conditions are economically reasonable. This discussion culminates with Theorem 3. Assume that (i) the inverse demand and costs are twice continuously differentiable, (ii) the industry output is bounded, (iii) the marginal profits ( f i in (2)) are concave, and (iv) the Jacobian of the marginal profits ( f) has a negative strictly dominant diagonal with unitary scales (i.e., is Hadamard). Then there exists a well defined sequence {q k } where each q k solves the LCP (f(q k 1 ) f(q k 1 )q k 1, f(q k 1 )) such that {q k } converges to the unique solution of CP (R N +,f) for any feasible q0 (at least one of which exists).
2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More information24. The Branch and Bound Method
24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no
More informationWhat is Linear Programming?
Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to
More informationt := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d).
1. Line Search Methods Let f : R n R be given and suppose that x c is our current best estimate of a solution to P min x R nf(x). A standard method for improving the estimate x c is to choose a direction
More informationConvex analysis and profit/cost/support functions
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m
More informationNonlinear Programming Methods.S2 Quadratic Programming
Nonlinear Programming Methods.S2 Quadratic Programming Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard A linearly constrained optimization problem with a quadratic objective
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationNotes on Factoring. MA 206 Kurt Bryan
The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor
More informationLinear Algebra I. Ronald van Luijk, 2012
Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.
More informationNotes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand
Notes V General Equilibrium: Positive Theory In this lecture we go on considering a general equilibrium model of a private ownership economy. In contrast to the Notes IV, we focus on positive issues such
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informationWalrasian Demand. u(x) where B(p, w) = {x R n + : p x w}.
Walrasian Demand Econ 2100 Fall 2015 Lecture 5, September 16 Outline 1 Walrasian Demand 2 Properties of Walrasian Demand 3 An Optimization Recipe 4 First and Second Order Conditions Definition Walrasian
More informationLecture 5 Principal Minors and the Hessian
Lecture 5 Principal Minors and the Hessian Eivind Eriksen BI Norwegian School of Management Department of Economics October 01, 2010 Eivind Eriksen (BI Dept of Economics) Lecture 5 Principal Minors and
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the
More informationEquilibria and Dynamics of. Supply Chain Network Competition with Information Asymmetry. and Minimum Quality Standards
Equilibria and Dynamics of Supply Chain Network Competition with Information Asymmetry in Quality and Minimum Quality Standards Anna Nagurney John F. Smith Memorial Professor and Dong (Michelle) Li Doctoral
More informationON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction
ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity
More informationTOPIC 4: DERIVATIVES
TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the
More informationLecture 7: Finding Lyapunov Functions 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 7: Finding Lyapunov Functions 1
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationModern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
More informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More informationALMOST COMMON PRIORS 1. INTRODUCTION
ALMOST COMMON PRIORS ZIV HELLMAN ABSTRACT. What happens when priors are not common? We introduce a measure for how far a type space is from having a common prior, which we term prior distance. If a type
More informationLecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs
CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More informationNonlinear Optimization: Algorithms 3: Interior-point methods
Nonlinear Optimization: Algorithms 3: Interior-point methods INSEAD, Spring 2006 Jean-Philippe Vert Ecole des Mines de Paris Jean-Philippe.Vert@mines.org Nonlinear optimization c 2006 Jean-Philippe Vert,
More informationGame Theory: Supermodular Games 1
Game Theory: Supermodular Games 1 Christoph Schottmüller 1 License: CC Attribution ShareAlike 4.0 1 / 22 Outline 1 Introduction 2 Model 3 Revision questions and exercises 2 / 22 Motivation I several solution
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More informationNumerical methods for American options
Lecture 9 Numerical methods for American options Lecture Notes by Andrzej Palczewski Computational Finance p. 1 American options The holder of an American option has the right to exercise it at any moment
More informationFurther Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1
Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing
More informationMATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column
More informationResearch Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization
Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative
More informationChapter 7. Sealed-bid Auctions
Chapter 7 Sealed-bid Auctions An auction is a procedure used for selling and buying items by offering them up for bid. Auctions are often used to sell objects that have a variable price (for example oil)
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationMathematical finance and linear programming (optimization)
Mathematical finance and linear programming (optimization) Geir Dahl September 15, 2009 1 Introduction The purpose of this short note is to explain how linear programming (LP) (=linear optimization) may
More informationLecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method
Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming
More informationMATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
More information6.254 : Game Theory with Engineering Applications Lecture 2: Strategic Form Games
6.254 : Game Theory with Engineering Applications Lecture 2: Strategic Form Games Asu Ozdaglar MIT February 4, 2009 1 Introduction Outline Decisions, utility maximization Strategic form games Best responses
More informationMetric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
More informationLinear Programming Notes V Problem Transformations
Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationFixed Point Theorems
Fixed Point Theorems Definition: Let X be a set and let T : X X be a function that maps X into itself. (Such a function is often called an operator, a transformation, or a transform on X, and the notation
More informationCryptography and Network Security. Prof. D. Mukhopadhyay. Department of Computer Science and Engineering. Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 12 Block Cipher Standards
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationContinuity of the Perron Root
Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North
More informationGROUPS ACTING ON A SET
GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for
More informationExample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x
Lecture 4. LaSalle s Invariance Principle We begin with a motivating eample. Eample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum Dynamics of a pendulum with friction can be written
More informationFUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM
International Journal of Innovative Computing, Information and Control ICIC International c 0 ISSN 34-48 Volume 8, Number 8, August 0 pp. 4 FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT
More information4.6 Linear Programming duality
4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP. Different spaces and objective functions but in general same optimal
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More information1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.
Introduction Linear Programming Neil Laws TT 00 A general optimization problem is of the form: choose x to maximise f(x) subject to x S where x = (x,..., x n ) T, f : R n R is the objective function, S
More informationLECTURE 5: DUALITY AND SENSITIVITY ANALYSIS. 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method
LECTURE 5: DUALITY AND SENSITIVITY ANALYSIS 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method Introduction to dual linear program Given a constraint matrix A, right
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More information6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation
6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation Daron Acemoglu and Asu Ozdaglar MIT November 2, 2009 1 Introduction Outline The problem of cooperation Finitely-repeated prisoner s dilemma
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationDATA ANALYSIS II. Matrix Algorithms
DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where
More informationSeparation Properties for Locally Convex Cones
Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam
More informationSECOND DERIVATIVE TEST FOR CONSTRAINED EXTREMA
SECOND DERIVATIVE TEST FOR CONSTRAINED EXTREMA This handout presents the second derivative test for a local extrema of a Lagrange multiplier problem. The Section 1 presents a geometric motivation for the
More informationCritical points of once continuously differentiable functions are important because they are the only points that can be local maxima or minima.
Lecture 0: Convexity and Optimization We say that if f is a once continuously differentiable function on an interval I, and x is a point in the interior of I that x is a critical point of f if f (x) =
More informationTHE BANACH CONTRACTION PRINCIPLE. Contents
THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,
More informationNotes on Symmetric Matrices
CPSC 536N: Randomized Algorithms 2011-12 Term 2 Notes on Symmetric Matrices Prof. Nick Harvey University of British Columbia 1 Symmetric Matrices We review some basic results concerning symmetric matrices.
More informationTHE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING
THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING 1. Introduction The Black-Scholes theory, which is the main subject of this course and its sequel, is based on the Efficient Market Hypothesis, that arbitrages
More informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
More informationMulti-variable Calculus and Optimization
Multi-variable Calculus and Optimization Dudley Cooke Trinity College Dublin Dudley Cooke (Trinity College Dublin) Multi-variable Calculus and Optimization 1 / 51 EC2040 Topic 3 - Multi-variable Calculus
More informationUNCOUPLING THE PERRON EIGENVECTOR PROBLEM
UNCOUPLING THE PERRON EIGENVECTOR PROBLEM Carl D Meyer INTRODUCTION Foranonnegative irreducible matrix m m with spectral radius ρ,afundamental problem concerns the determination of the unique normalized
More informationScalar Valued Functions of Several Variables; the Gradient Vector
Scalar Valued Functions of Several Variables; the Gradient Vector Scalar Valued Functions vector valued function of n variables: Let us consider a scalar (i.e., numerical, rather than y = φ(x = φ(x 1,
More informationAdaptive Online Gradient Descent
Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationIRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
More informationThese axioms must hold for all vectors ū, v, and w in V and all scalars c and d.
DEFINITION: A vector space is a nonempty set V of objects, called vectors, on which are defined two operations, called addition and multiplication by scalars (real numbers), subject to the following axioms
More informationA FIRST COURSE IN OPTIMIZATION THEORY
A FIRST COURSE IN OPTIMIZATION THEORY RANGARAJAN K. SUNDARAM New York University CAMBRIDGE UNIVERSITY PRESS Contents Preface Acknowledgements page xiii xvii 1 Mathematical Preliminaries 1 1.1 Notation
More informationTiers, Preference Similarity, and the Limits on Stable Partners
Tiers, Preference Similarity, and the Limits on Stable Partners KANDORI, Michihiro, KOJIMA, Fuhito, and YASUDA, Yosuke February 7, 2010 Preliminary and incomplete. Do not circulate. Abstract We consider
More informationModule1. x 1000. y 800.
Module1 1 Welcome to the first module of the course. It is indeed an exciting event to share with you the subject that has lot to offer both from theoretical side and practical aspects. To begin with,
More informationMathematical Methods of Engineering Analysis
Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................
More informationSolving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationAtomic Cournotian Traders May Be Walrasian
Atomic Cournotian Traders May Be Walrasian Giulio Codognato, Sayantan Ghosal, Simone Tonin September 2014 Abstract In a bilateral oligopoly, with large traders, represented as atoms, and small traders,
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More information15 Limit sets. Lyapunov functions
15 Limit sets. Lyapunov functions At this point, considering the solutions to ẋ = f(x), x U R 2, (1) we were most interested in the behavior of solutions when t (sometimes, this is called asymptotic behavior
More informationDate: April 12, 2001. Contents
2 Lagrange Multipliers Date: April 12, 2001 Contents 2.1. Introduction to Lagrange Multipliers......... p. 2 2.2. Enhanced Fritz John Optimality Conditions...... p. 12 2.3. Informative Lagrange Multipliers...........
More informationNumerisches Rechnen. (für Informatiker) M. Grepl J. Berger & J.T. Frings. Institut für Geometrie und Praktische Mathematik RWTH Aachen
(für Informatiker) M. Grepl J. Berger & J.T. Frings Institut für Geometrie und Praktische Mathematik RWTH Aachen Wintersemester 2010/11 Problem Statement Unconstrained Optimality Conditions Constrained
More informationLecture 2: August 29. Linear Programming (part I)
10-725: Convex Optimization Fall 2013 Lecture 2: August 29 Lecturer: Barnabás Póczos Scribes: Samrachana Adhikari, Mattia Ciollaro, Fabrizio Lecci Note: LaTeX template courtesy of UC Berkeley EECS dept.
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More information1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
More informationit is easy to see that α = a
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore
More information(Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties
Lecture 1 Convex Sets (Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties 1.1.1 A convex set In the school geometry
More informationLinear Algebra Notes
Linear Algebra Notes Chapter 19 KERNEL AND IMAGE OF A MATRIX Take an n m matrix a 11 a 12 a 1m a 21 a 22 a 2m a n1 a n2 a nm and think of it as a function A : R m R n The kernel of A is defined as Note
More informationThe Steepest Descent Algorithm for Unconstrained Optimization and a Bisection Line-search Method
The Steepest Descent Algorithm for Unconstrained Optimization and a Bisection Line-search Method Robert M. Freund February, 004 004 Massachusetts Institute of Technology. 1 1 The Algorithm The problem
More information