# UW EE 595A - Lecture Notes (109 pages)

Previewing pages*1, 2, 3, 4, 5, 6, 7, 51, 52, 53, 54, 55, 56, 57, 58, 103, 104, 105, 106, 107, 108, 109*of 109 page document

**View the full content.**# Lecture Notes

Previewing pages *1, 2, 3, 4, 5, 6, 7, 51, 52, 53, 54, 55, 56, 57, 58, 103, 104, 105, 106, 107, 108, 109*
of
actual document.

**View the full content.**View Full Document

## Lecture Notes

0 0 42 views

Lecture Notes

- Pages:
- 109
- School:
- University of Washington
- Course:
- Ee 595a - Information Theory

**Unformatted text preview: **

Logistics Review More Polytopes Polymatroid Most Violated Inequality Scratch Summary EE595A Submodular functions their optimization and applications Spring 2011 Prof Jeff Bilmes University of Washington Seattle Department of Electrical Engineering Winter Quarter 2011 http ee washington edu class 235 2011wtr index html Lecture 7 April 20th 2011 Prof Jeff Bilmes EE595A Spr 2011 Submodular Functions Lecture 7 April 20th 2011 page 1 Logistics Review More Polytopes Polymatroid Most Violated Inequality Scratch Summary Announcements Reminder HW1 is on the web page now at http ssli ee washington edu bilmes ee595a spring 2011 hw1 pdf It is due Tuesday April 26th 11 45pm All submissions must be done electronically via our drop box See the link https catalyst uw edu collectit dropbox bilmes 14888 or look at the homework on the web page Please write down your email on paper for me Engineering Discovery Days http www engr washington edu alumcomm openhouse html so no class on Friday Prof Jeff Bilmes EE595A Spr 2011 Submodular Functions Lecture 7 April 20th 2011 page 2 Logistics Review More Polytopes Polymatroid Most Violated Inequality Scratch Summary Convex Polytope key representation theorem A polytope can be defined in a number of ways two of which include Theorem 2 1 A subset P RE is a polytope iff it can be described in either of the following equivalent ways P is the convex hull of a finite set of points If it is a bounded intersection of halfspaces that is there exits matrix A and vector b such that P x Ax b Prof Jeff Bilmes EE595A Spr 2011 Submodular Functions Lecture 7 April 20th 2011 1 page 3 Logistics Review More Polytopes Polymatroid Most Violated Inequality Scratch Summary Convex Polytope key representation theorem A polytope can be defined in a number of ways two of which include Theorem 2 1 A subset P RE is a polytope iff it can be described in either of the following equivalent ways P is the convex hull of a finite set of points If it is a bounded intersection of

View Full Document