CS295: Convex Optimization. Xiaohui Xie Department of Computer Science University of California, Irvine
|
|
- Alexandra Peters
- 7 years ago
- Views:
Transcription
1 CS295: Convex Optimization Xiaohui Xie Department of Computer Science University of California, Irvine
2 Convex set Definition A set C is called convex if x,y C = θx+(1 θ)y C θ [0,1] In other words, a set C is convex if the line segment between any two points in C lies in C.
3 Convex set: examples Figure: Examples of convex and nonconvex sets
4 Convex combination Definition A convex combination of the points x 1,,x k is a point of the form θ 1 x 1 + +θ k x k, where θ 1 + +θ k = 1 and θ i 0 for all i = 1,,k. A set is convex if and only if it contains every convex combinations of the its points.
5 Convex hull Definition The convex hull of a set C, denoted conv C, is the set of all convex combinations of points in C: { k } k convc = θ i x i x i C,θ i 0,i = 1,,k, θ k = 1 i=1 i=1
6 Convex hull Definition The convex hull of a set C, denoted conv C, is the set of all convex combinations of points in C: { k } k convc = θ i x i x i C,θ i 0,i = 1,,k, θ k = 1 i=1 i=1 Properties: A convex hull is always convex conv C is the smallest convex set that contains C, i.e., B C is convex = convc B
7 Convex hull: examples Figure: Examples of convex hulls
8 Convex cone A set C is called a cone if x C = θx C, θ 0.
9 Convex cone A set C is called a cone if x C = θx C, θ 0. A set C is a convex cone if it is convex and a cone, i.e., x 1,x 2 C = θ 1 x 1 +θ 2 x 2 C, θ 1,θ 2 0
10 Convex cone A set C is called a cone if x C = θx C, θ 0. A set C is a convex cone if it is convex and a cone, i.e., x 1,x 2 C = θ 1 x 1 +θ 2 x 2 C, θ 1,θ 2 0 The point k i=1 θ ix i, where θ i 0, i = 1,,k, is called a conic combination of x 1,,x k.
11 Convex cone A set C is called a cone if x C = θx C, θ 0. A set C is a convex cone if it is convex and a cone, i.e., x 1,x 2 C = θ 1 x 1 +θ 2 x 2 C, θ 1,θ 2 0 The point k i=1 θ ix i, where θ i 0, i = 1,,k, is called a conic combination of x 1,,x k. The conic hull of a set C is the set of all conic combinations of points in C.
12 Conic hull: examples Figure: Examples of conic hull
13 Hyperplanes and halfspaces A hyperplane is a set of the form {x R n a T x = b} where a = 0,b R.
14 Hyperplanes and halfspaces A hyperplane is a set of the form {x R n a T x = b} where a = 0,b R. A (closed) halfspace is a set of the form {x R n a T x b} where a = 0,b R. a is the normal vector hyperplanes and halfspaces are convex
15 Euclidean balls and ellipsoids Euclidean ball in R n with center x c and radius r: B(x c,r) = {x x x c 2 r} = {x c +ru u 2 1}
16 Euclidean balls and ellipsoids Euclidean ball in R n with center x c and radius r: B(x c,r) = {x x x c 2 r} = {x c +ru u 2 1} ellipsoid in R n with center x c : { } E = x (x x c ) T P 1 (x x c ) 1 where P S n ++ (i.e., symmetric and positive definite) the lengths of the semi-axes of E are given by λ i, where λ i are the eigenvalues of P. An alternative representation of an ellipsoid: with A = P 1/2 E = {x c +Au u 2 1}
17 Euclidean balls and ellipsoids Euclidean ball in R n with center x c and radius r: B(x c,r) = {x x x c 2 r} = {x c +ru u 2 1} ellipsoid in R n with center x c : { } E = x (x x c ) T P 1 (x x c ) 1 where P S n ++ (i.e., symmetric and positive definite) the lengths of the semi-axes of E are given by λ i, where λ i are the eigenvalues of P. An alternative representation of an ellipsoid: with A = P 1/2 E = {x c +Au u 2 1} Euclidean balls and ellipsoids are convex.
18 Norms A function f : R n R is called a norm, denoted x, if nonegative: f(x) 0, for all x R n definite: f(x) = 0 only if x = 0 homogeneous: f(tx) = t f(x), for all x R n and t R satisfies the triangle inequality: f(x +y) f(x)+f(y) notation: denotes a general norm; symb denotes a specific norm Distance: dist(x,y) = x y between x,y R n.
19 Examples of norms l p -norm on R n : x p = ( x 1 p + + x n p ) 1/p l1 -norm: x 1 = i x i l -norm: x = max i x i Quadratic norms: For P S n ++, define the P-quadratic norm as x P = (x T Px) 1/2 = P 1/2 x 2
20 Equivalence of norms Let a and b be norms on R n. Then α,β > 0 such that x R n, α x a x b β x a. Norms on any finite-dimensional vector space are equivalent (define the same set of open subsets, the same set of convergent sequences, etc.)
21 Dual norm Let be a norm on R n. The associated dual norm, denoted, is defined as z = sup {z T x x 1}.
22 Dual norm Let be a norm on R n. The associated dual norm, denoted, is defined as z = sup {z T x x 1}. z T x x z for all x,z R n x = x for all x R n The dual of the Euclidean norm is the Euclidean norm (Cauchy-Schwartz inequality)
23 Dual norm Let be a norm on R n. The associated dual norm, denoted, is defined as z = sup {z T x x 1}. z T x x z for all x,z R n x = x for all x R n The dual of the Euclidean norm is the Euclidean norm (Cauchy-Schwartz inequality) The dual of the l p -norm is the l q -norm, where 1/p +1/q = 1 (Holder s inequality) The dual of the l norm is the l 1 norm The dual of the l 2 -norm on R m n is the nuclear norm, Z 2 = sup {tr(z T X) X 2 1} where r = rank Z. = σ 1 (Z)+ +σ r (Z) = tr(z T Z) 1/2,
24 Norm balls and norm cones norm ball with center x c and radius r: {x x x c r} norm cone: C = {(x,t) x t} R n+1 the second-order cone is the norm cone for the Euclidean norm norm balls and cones are convex
25 Polyhedra A polyhedron is defined as the solution set of a finite number of linear equalities and inequalities: P = {x Ax b,cx = d} where A R m n, A R p n, and denotes vector inequality or componentwise inequality. A polyhedron is the intersection of finite number of halfspaces and hyperplanes.
26 Simplexes The simplex determined by k + 1 affinely independent points v 0,,v k R n is { } C = conv{v 0,,v k } = θ 0 v 0 + +θ k v k θ ર 0,1 T θ = 1 The affine dimension of this simplex is k, so it is often called k-dimensional simplex in R n. Some common simplexes: let e 1,,e n be the unit vectors in R n. unit simplex: conv{0,e 1,,e n } = {x x ર 0,1 T θ 1} probability simplex: conv{e 1,,e n } = {x x ર 0,1 T θ = 1}
27 Positive semidefinite cone notation: S n : the set of symmetric n n matrices S n + = {X S n X ર 0}: symmetric positive semidefinite matrices S n ++ = {X S n X 0} symmetric positive definite matrices S n + is a convex cone, called positive semidefinte cone. Sn ++ comprise the cone interior; all singular positive semidefinite matrices reside on the cone boundary.
28 Positive semidefinite cone: example X = [ ] x y S+ 2 x 0,z 0,xz y 2 y z Figure: Positive semidefinite cone: S 2 +
29 Operations that preserve complexity intersection affine function perspective function linear-fractional functions
30 Intersection If S 1 and S 2 are convex. then S 1 S2 is convex.
31 Intersection If S 1 and S 2 are convex. then S 1 S2 is convex. If S α is convex for every α A, then α A S α is convex.
32 Intersection If S 1 and S 2 are convex. then S 1 S2 is convex.
33 Intersection If S 1 and S 2 are convex. then S 1 S2 is convex. If S α is convex for every α A, then α A S α is convex.
34 Intersection: example 1 Show that the positive semidefinite cone S n + is convex. Proof. S n + can be expressed as S n + = z =0 { } X S n z T Xz 0. Since the set { } X S n z T Xz 0 is a halfspace in S n, it is convex. S n + is the intersection of an infinite number of halfspaces, so it is convex.
35 Intersection: example 2 The set S = {x R m m x k coskt 1, t π/3} k=1 is convex, since it can be expressed as S = t π/3 S t, where S t = {x R m 1 (cost,,cosmt) T x 1}. Figure: The set S for m = 2.
36 Affine function Theorem Suppose f : R n R m is an affine function (i.e., f(x) = Ax +b). Then the image of a convex set under f is convex S R n is convex = f(s) = {f(x) x S} is convex the inverse image of a convex set under f is convex B R m is convex = f 1 (B) = {x f(x) B} is convex
37 Affine function: example 1 Show that the ellipsoid { } E = x (x x c ) T P 1 (x x c ) 1 where P S n ++ is convex. Proof. Let S = {u R n u 2 1} denote the unit ball in R n. Define an affine function f(u) = P 1/2 u +x c E is the image of S under f, so is convex.
38 Affine function: example 2 Show that the solution set of linear matrix inequality (LMI) S = {x R n x 1 A 1 + +x n A n ર B}, where B,A i S m, is convex. Proof. Define an affine function f : R n S m given by f(x) = B (x 1 A 1 + +x n A n ). The solution set S is the inverse image of the positive semidefinite cone S m +, so is convex.
39 Affine function: example 3 Show that the hyperbolic cone where P S+ n, is convex. S = {x R n x T Px (c T x) 2,c T x 0}, Proof. Define an affine function f : R n S n+1 given by f(x) = (P 1/2 x,c T x). The S is the inverse image of the second-order cone, so is convex. {(z,t) z 2 t,t 0},
40 Perspective and linear-fractional function perspective function P : R n+1 R n : P(x,t) = x, dom P = {(x,t) t > 0} t images and inverse images of convex sets under P are convex. linear-fractional function P : R n R m : f(x) = Ax +b c T x +d, dom f = {x ct x +d > 0} images and inverse images of convex sets under f are convex.
41 Generalized inequalities: proper cone Definition A cone K R n is called a proper cone if K is convex K is closed K is solid, which means it has nonempty interior K is pointed, which means that it contains no line (i.e., x K, x K = x = 0)
42 Generalized inequalities: proper cone Definition A cone K R n is called a proper cone if K is convex K is closed K is solid, which means it has nonempty interior K is pointed, which means that it contains no line (i.e., x K, x K = x = 0) Examples: nonnegative orthant K = R n + = {x Rn x i 0, i} positive semidifinite cone K = S n +; how about S n ++? nonnegative polynomials on [0, 1]: K = {x R n x 1 +x 2 t + +x n t n 1 0, t [0,1]}
43 Generalized inequalities: definition A proper cone K can be used to define a generalized inequality, a partial ordering on R n, x K y y x K x K y y x intk where the latter is called a strict generalized inequality.
44 Generalized inequalities: definition A proper cone K can be used to define a generalized inequality, a partial ordering on R n, x K y y x K x K y y x intk where the latter is called a strict generalized inequality. Examples: componentwise inequality (K = R n + ) x R n + y x i y k, i = 1,,n matrix inequality (K = S n +) x S n + y Y X is positive semidefinite
45 Generalized inequalities: properties Many properties of K are similar to on R: transitive: x K y, y K z = x K z reflexive: x K x antisymmetric: x K y, y K x = x = y preserved under addition: x K y, u K v = x +u K y +v preserved under nonnegative scaling: x K y, α 0 = αx K αy preserved under limits: suppose limx i = x, limy i = y. Then x i K y i, i = x K y
46 Minimum and minimal elements K is not in general a linear ordering: we can have x K y y K x x S is called the minimum element of S with respect to K if y S = x K y x S is called the minimal element of S with respect to K if y S, y K x = y = x
47 Minimum and minimal elements K is not in general a linear ordering: we can have x K y y K x x S is called the minimum element of S with respect to K if y S = x K y x S is called the minimal element of S with respect to K if Example: y S, y K x = y = x Figure: K = R 2 +. x 1 is the minimum element of S 1. x 2 is the minimal element of S 2.
48 Separating hyperplane theorem Theorem Suppose C and D are two convex sets that do not intersect, i.e., C D =. Then there exist a = 0 and b such that a T x b for x C, and a x b b for x D The hyperplane {x a x = b} is called a separating hyperplane for C and D. Figure: Examples of convex and nonconvex sets
49 Supporting hyperplane theorem supporting hyperplane to set C at boundary point x 0 {x a x = a T x 0 } where a = 0 and satisfies a T x a T x 0 for all x C. Theorem (supporting hyperplane theorem) If C is convex, then there exists a supporting hyperplane at every boundary point of C. Figure: Examples of convex and nonconvex sets
50 Dual cones Definition (dual cones) Let K be a cone. The set is called the dual cone of K. Property: K = {y x T y 0 x K} K is always convex, even when the original cone K is not (why? intersection of convex sets) y K if and only if y is the normal of a hyperplane that supports K at the origin
51 Dual cones : examples Examples: K = R+: n K = R+ n K = S+ n : K = S+ n K = {(x,t) x 2 t}: K = {(x,t) x 2 t} K = {(x,t) x t}: K = {(x,t) x t} the first three examples are self-dual cones
52 Dual of positive semidefinite cone Theorem The positive semidefinite cone S n + is self-dual, i.e., given Y Sn, tr(xy) 0 X S n + Y Sn +
53 Dual of positive semidefinite cone Theorem The positive semidefinite cone S n + is self-dual, i.e., given Y Sn, tr(xy) 0 X S n + Y Sn + Proof. To prove =, suppose Y / S n +. Then q with q T Yq = tr(qq T Y) < 0, which contradicts the lefthand condition.
54 Dual of positive semidefinite cone Theorem The positive semidefinite cone S n + is self-dual, i.e., given Y Sn, tr(xy) 0 X S n + Y Sn + Proof. To prove =, suppose Y / S n +. Then q with q T Yq = tr(qq T Y) < 0, which contradicts the lefthand condition. To prove =, since X ર 0, write X = n i=1 λ iq i q T i, where λ i 0 for all i. Then because Y ર 0. tr(xy) = tr(y n λ i q i qi T ) = i=1 n λ i qi T Yq i 0, i=1
55 Dual of a norm cone Theorem The dual of the cone K = {(x,t) R n+1 x t} associated with a norm in R n is the cone defined by the dual norm, K = {(u,s) R n+1 u s}, where the dual norm is given by u = sup{u T x x 1}.
56 Dual of a norm cone Theorem The dual of the cone K = {(x,t) R n+1 x t} associated with a norm in R n is the cone defined by the dual norm, K = {(u,s) R n+1 u s}, where the dual norm is given by u = sup{u T x x 1}. Proof. We need to show x T u +ts 0 x t u s The = direction follows from the definition of the dual norm. To prove =, suppose u > s. Then by the definition of dual norm, x with x 1 and x T u s. Taking t = 1, we have u T ( x)+v < 0, which is a contradiction.
57 Dual cones and generalized inequalities Properties of dual cones: let K be the dual of a convex cone K. K is a convex cone (intersection of a set of homogeneous halfspaces) K 1 K 2 = K 2 K 1 K is closed (intersection of a set of closed sets) K is the closure of K (if K is closed, then K = K) dual cones of proper cones are proper, hence define generalized inequalities: y ર K 0 y T x 0 for all x ર K 0
(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 information2.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 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 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 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 informationOptimisation et simulation numérique.
Optimisation et simulation numérique. Lecture 1 A. d Aspremont. M2 MathSV: Optimisation et simulation numérique. 1/106 Today Convex optimization: introduction Course organization and other gory details...
More informationOn Minimal Valid Inequalities for Mixed Integer Conic Programs
On Minimal Valid Inequalities for Mixed Integer Conic Programs Fatma Kılınç Karzan June 27, 2013 Abstract We study mixed integer conic sets involving a general regular (closed, convex, full dimensional,
More informationON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES.
ON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES. O. N. KARPENKOV Introduction. A series of properties for ordinary continued fractions possesses multidimensional
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 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 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 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 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 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 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 informationCHAPTER 9. Integer Programming
CHAPTER 9 Integer Programming An integer linear program (ILP) is, by definition, a linear program with the additional constraint that all variables take integer values: (9.1) max c T x s t Ax b and x integral
More information3. Convex functions. basic properties and examples. operations that preserve convexity. the conjugate function. quasiconvex functions
3. Convex functions Convex Optimization Boyd & Vandenberghe basic properties and examples operations that preserve convexity the conjugate function quasiconvex functions log-concave and log-convex functions
More informationSection 1.1. Introduction to R n
The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
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 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 informationBindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 3: Wednesday, Feb 8
Spaces and bases Week 3: Wednesday, Feb 8 I have two favorite vector spaces 1 : R n and the space P d of polynomials of degree at most d. For R n, we have a canonical basis: R n = span{e 1, e 2,..., e
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 informationMATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α
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 information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More informationCompletely Positive Cone and its Dual
On the Computational Complexity of Membership Problems for the Completely Positive Cone and its Dual Peter J.C. Dickinson Luuk Gijben July 3, 2012 Abstract Copositive programming has become a useful tool
More informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
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 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 informationActually Doing It! 6. Prove that the regular unit cube (say 1cm=unit) of sufficiently high dimension can fit inside it the whole city of New York.
1: 1. Compute a random 4-dimensional polytope P as the convex hull of 10 random points using rand sphere(4,10). Run VISUAL to see a Schlegel diagram. How many 3-dimensional polytopes do you see? How many
More informationORIENTATIONS. Contents
ORIENTATIONS Contents 1. Generators for H n R n, R n p 1 1. Generators for H n R n, R n p We ended last time by constructing explicit generators for H n D n, S n 1 by using an explicit n-simplex which
More informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,
More informationClassification of Cartan matrices
Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms
More informationMatrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
More informationStudy Guide 2 Solutions MATH 111
Study Guide 2 Solutions MATH 111 Having read through the sample test, I wanted to warn everyone, that I might consider asking questions involving inequalities, the absolute value function (as in the suggested
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 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 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 informationError Bound for Classes of Polynomial Systems and its Applications: A Variational Analysis Approach
Outline Error Bound for Classes of Polynomial Systems and its Applications: A Variational Analysis Approach The University of New South Wales SPOM 2013 Joint work with V. Jeyakumar, B.S. Mordukhovich and
More informationBX in ( u, v) basis in two ways. On the one hand, AN = u+
1. Let f(x) = 1 x +1. Find f (6) () (the value of the sixth derivative of the function f(x) at zero). Answer: 7. We expand the given function into a Taylor series at the point x = : f(x) = 1 x + x 4 x
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More informationSome representability and duality results for convex mixed-integer programs.
Some representability and duality results for convex mixed-integer programs. Santanu S. Dey Joint work with Diego Morán and Juan Pablo Vielma December 17, 2012. Introduction About Motivation Mixed integer
More informationA NEW LOOK AT CONVEX ANALYSIS AND OPTIMIZATION
1 A NEW LOOK AT CONVEX ANALYSIS AND OPTIMIZATION Dimitri Bertsekas M.I.T. FEBRUARY 2003 2 OUTLINE Convexity issues in optimization Historical remarks Our treatment of the subject Three unifying lines of
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 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 informationRow Ideals and Fibers of Morphisms
Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
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 informationCan linear programs solve NP-hard problems?
Can linear programs solve NP-hard problems? p. 1/9 Can linear programs solve NP-hard problems? Ronald de Wolf Linear programs Can linear programs solve NP-hard problems? p. 2/9 Can linear programs solve
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 information16.3 Fredholm Operators
Lectures 16 and 17 16.3 Fredholm Operators A nice way to think about compact operators is to show that set of compact operators is the closure of the set of finite rank operator in operator norm. In this
More informationConvex Rationing Solutions (Incomplete Version, Do not distribute)
Convex Rationing Solutions (Incomplete Version, Do not distribute) Ruben Juarez rubenj@hawaii.edu January 2013 Abstract This paper introduces a notion of convexity on the rationing problem and characterizes
More informationNotes on the representational possibilities of projective quadrics in four dimensions
bacso 2006/6/22 18:13 page 167 #1 4/1 (2006), 167 177 tmcs@inf.unideb.hu http://tmcs.math.klte.hu Notes on the representational possibilities of projective quadrics in four dimensions Sándor Bácsó and
More informationLecture 2: Homogeneous Coordinates, Lines and Conics
Lecture 2: Homogeneous Coordinates, Lines and Conics 1 Homogeneous Coordinates In Lecture 1 we derived the camera equations λx = P X, (1) where x = (x 1, x 2, 1), X = (X 1, X 2, X 3, 1) and P is a 3 4
More informationMetric Spaces Joseph Muscat 2003 (Last revised May 2009)
1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of
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 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 informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
More information. P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2
4. Basic feasible solutions and vertices of polyhedra Due to the fundamental theorem of Linear Programming, to solve any LP it suffices to consider the vertices (finitely many) of the polyhedron P of the
More informationMax-Min Representation of Piecewise Linear Functions
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 43 (2002), No. 1, 297-302. Max-Min Representation of Piecewise Linear Functions Sergei Ovchinnikov Mathematics Department,
More informationLinear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued.
Linear Programming Widget Factory Example Learning Goals. Introduce Linear Programming Problems. Widget Example, Graphical Solution. Basic Theory:, Vertices, Existence of Solutions. Equivalent formulations.
More informationA characterization of trace zero symmetric nonnegative 5x5 matrices
A characterization of trace zero symmetric nonnegative 5x5 matrices Oren Spector June 1, 009 Abstract The problem of determining necessary and sufficient conditions for a set of real numbers to be the
More informationChapter 6. Cuboids. and. vol(conv(p ))
Chapter 6 Cuboids We have already seen that we can efficiently find the bounding box Q(P ) and an arbitrarily good approximation to the smallest enclosing ball B(P ) of a set P R d. Unfortunately, both
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 informationFACTORIZATION OF TROPICAL POLYNOMIALS IN ONE AND SEVERAL VARIABLES. Nathan B. Grigg. Submitted to Brigham Young University in partial fulfillment
FACTORIZATION OF TROPICAL POLYNOMIALS IN ONE AND SEVERAL VARIABLES by Nathan B. Grigg Submitted to Brigham Young University in partial fulfillment of graduation requirements for University Honors Department
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
More informationLecture 13 Linear quadratic Lyapunov theory
EE363 Winter 28-9 Lecture 13 Linear quadratic Lyapunov theory the Lyapunov equation Lyapunov stability conditions the Lyapunov operator and integral evaluating quadratic integrals analysis of ARE discrete-time
More informationMath 181 Handout 16. Rich Schwartz. March 9, 2010
Math 8 Handout 6 Rich Schwartz March 9, 200 The purpose of this handout is to describe continued fractions and their connection to hyperbolic geometry. The Gauss Map Given any x (0, ) we define γ(x) =
More informationConic optimization: examples and software
Conic optimization: examples and software Etienne de Klerk Tilburg University, The Netherlands Etienne de Klerk (Tilburg University) Conic optimization: examples and software 1 / 16 Outline Conic optimization
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 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 informationSection 13.5 Equations of Lines and Planes
Section 13.5 Equations of Lines and Planes Generalizing Linear Equations One of the main aspects of single variable calculus was approximating graphs of functions by lines - specifically, tangent lines.
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 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 informationLecture 5: Singular Value Decomposition SVD (1)
EEM3L1: Numerical and Analytical Techniques Lecture 5: Singular Value Decomposition SVD (1) EE3L1, slide 1, Version 4: 25-Sep-02 Motivation for SVD (1) SVD = Singular Value Decomposition Consider the system
More informationNP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems
NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems Amir Ali Ahmadi, Alex Olshevsky, Pablo A. Parrilo, and John N. Tsitsiklis Abstract We show that unless P=NP, there exists no
More informationMATHEMATICAL METHODS OF STATISTICS
MATHEMATICAL METHODS OF STATISTICS By HARALD CRAMER TROFESSOK IN THE UNIVERSITY OF STOCKHOLM Princeton PRINCETON UNIVERSITY PRESS 1946 TABLE OF CONTENTS. First Part. MATHEMATICAL INTRODUCTION. CHAPTERS
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 informationEigenvalues, Eigenvectors, Matrix Factoring, and Principal Components
Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components The eigenvalues and eigenvectors of a square matrix play a key role in some important operations in statistics. In particular, they
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 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 informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
More informationAlgebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the 2012-13 school year.
This document is designed to help North Carolina educators teach the Common Core (Standard Course of Study). NCDPI staff are continually updating and improving these tools to better serve teachers. Algebra
More informationThe Australian Journal of Mathematical Analysis and Applications
The Australian Journal of Mathematical Analysis and Applications Volume 7, Issue, Article 11, pp. 1-14, 011 SOME HOMOGENEOUS CYCLIC INEQUALITIES OF THREE VARIABLES OF DEGREE THREE AND FOUR TETSUYA ANDO
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More informationα = u v. In other words, Orthogonal Projection
Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v
More informationNP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems
NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems Amir Ali Ahmadi, Alex Olshevsky, Pablo A. Parrilo, and John N. Tsitsiklis Abstract We show that unless P=NP, there exists no
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 informationTail inequalities for order statistics of log-concave vectors and applications
Tail inequalities for order statistics of log-concave vectors and applications Rafał Latała Based in part on a joint work with R.Adamczak, A.E.Litvak, A.Pajor and N.Tomczak-Jaegermann Banff, May 2011 Basic
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 informationAn Introduction on SemiDefinite Program
An Introduction on SemiDefinite Program from the viewpoint of computation Hayato Waki Institute of Mathematics for Industry, Kyushu University 2015-10-08 Combinatorial Optimization at Work, Berlin, 2015
More informationChapter 5. Banach Spaces
9 Chapter 5 Banach Spaces Many linear equations may be formulated in terms of a suitable linear operator acting on a Banach space. In this chapter, we study Banach spaces and linear operators acting on
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 informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
More information