McMaster University. Advanced Optimization Laboratory. Title: The Central Path Visits all the Vertices of the Klee-Minty Cube.
|
|
- Monica Fox
- 5 years ago
- Views:
Transcription
1 McMaster University Avance Optimization Laboratory Title: The Central Path Visits all the Vertices of the Klee-Minty Cube Authors: Antoine Deza, Eissa Nematollahi, Reza Peyghami an Tamás Terlaky AvOl-Report No. 2004/ August 2004, Hamilton, Ontario, Canaa
2 The Central Path Visits all the Vertices of the Klee-Minty Cube Antoine Deza Eissa Nematollahi Reza Peyghami Tamás Terlaky August 30, 2004 Abstract The Klee-Minty cube is a well-known worst case example for which the simplex metho takes an exponential number of iterations as the algorithm visits all the 2 n vertices of the n-imensional cube. While such behavior is exclue by polynomial interior point methos, we show that, by aing an exponential number of reunant inequalities, the central path can be bent along the eges of the Klee-Minty cube. More precisely, for an arbitrarily small, the central path takes 2 n 2 turns as it passes through the -neighborhoo of all the vertices of the Klee-Minty cube in the same orer as the simplex metho oes. Key wors: Linear programming, central path, Klee-Minty cube. MSC2000 Subject Classification: Primary: 90C05; Seconary: 90C5, 90C27, 52B2 Introuction While the simplex metho, introuce by Dantzig [], works very well in practice for linear optimization problems, Klee an Minty [5] gave an example in 972 for which the simplex metho takes an exponential number of iterations. More precisely, they consiere a maximization problem over an n-imensional squashe cube an prove that a variant of the simplex metho visits all its 2 n vertices; that is, the time complexity is not polynomial for the worst case, as 2 n iterations are necessary for this n-imensional linear optimization problem. The pivot rule use in the Klee-Minty example was the most negative reuce cost but variants of the Klee-Minty n-cube showing an exponential running time exist for most pivot rules; see [9] an the references therein. The Klee-Minty worst-case example partially stimulate the search for a polynomial algorithm an, in 979, Khachiyan s [4] ellipsoi metho prove that linear programming is inee polynomially solvable. In 984, Karmarkar [3] propose a more efficient polynomial algorithm that sparke the research on polynomial interior point methos. In short, while the simplex metho goes along the eges of the polyheron corresponing to the feasible region, interior point methos pass through the interior of this polyheron. Starting at the analytic center, most interior point methos follow the so-calle central path an converge to the analytic center of the optimal face; see e.g., [6, 7, 8,, 2]. 2
3 Antoine Deza, Eissa Nematollahi, Reza Peyghami an Tamás Terlaky 3 In this paper, following the Klee-Minty approach, we show that, by carefully aing an exponential number of reunant constraints to the Klee-Minty n-cube, the central path can be bent along its eges. In other wors, we give an example where, for an arbitrarily small, starting from the -neighborhoo of a vertex ajacent to the optimal solution, the central path takes 2 n 2 turns as, before converging to the optimal solution, it passes through the -neighborhoo of all the vertices of the Klee-Minty cube in the same orer as the simplex metho oes. Before stating the main result in Section 2 an giving its proof in Section 3, we illustrate the bening of the central path in the 2 an 3 imensional cases. Fig. an Fig. 2 show the trajectory of the central path starting from the highest vertex an converging to the origin after visiting each vertex of the Klee-Minty cube. The reunant constraints correspon to hyperplanes parallel to the facets of the cube containing the origin. More precisely, in imension 2, the reunant inequality 6 + x 0 is ae times an the reunant inequality 6 +x 2 4 x 0 is ae times. Starting from the highest vertex an with = 0., the central path visits the -neighborhoo of each vertex of the Klee-Minty cube in the same orer as the simplex algorithm oes before converging to the optimal solution; that is, the origin. In imension 3, the reunant inequality 48 + x 0 (resp x 2 4 x 0 an 48 + x 3 4 x 2 0) is ae (resp , an times). v {2} χ h χ h (v {} 2 ) v {,2} v {} v Figure : Central path nearing all the vertices of the Klee-Minty 2-cube. v {3} χ h v {,3} v {,2,3} χ h (v {} 3 ) v {2,3} v {2} v v {} v {,2} Figure 2: Central path nearing all the vertices of the Klee-Minty 3-cube.
4 4 The central path visits all the vertices of the Klee-Minty cube 2 Notations an the Main Result We consier the following Klee-Minty variant where is a small positive factor by which the unit cube [0,] n is squashe. min x n subject to 0 x x k x k x k for k = 2,...,n. We enote this linear optimization problem by KM. This minimization problem has 2n constraints, n variables an the feasible region is an n-imensional cube enote by C. Some variants of the simplex metho take 2 n iterations to solve KM as they visit all the vertices orere by the ecreasing value of the last coorinate x n starting from v {n} = (0,...,0,) till the optimal value x n = 0 is reache at the origin v. If an interior point metho is use to solve KM, the central path starts from the analytic center χ of C an converges to the origin as it is shown in Fig. 3. v {2} χ v {,2} v {} v Figure 3: The central path in the non-reunant Klee-Minty 2-cube. While aing a set h of reunant inequalities oes not change the feasible region of KM, the analytic center χ h an the central path are affecte by the aition of reunant constraints. We consier reunant inequalities inuce by hyperplanes parallel to the n facets of C containing the origin. To ease the analysis, we consier that all reunant hyperplanes are put at the same istance to the corresponing parallel facet of C. The constraint parallel to H : x = 0 is ae h times an the constraint parallel to H k : x k = x k is ae h k times for k = 2,...,n. By abuse of notation, the set h is enote by the integer-vector h = (h,...,h n ). With these notations, the reunant linear optimization problem KM h is efine by
5 Antoine Deza, Eissa Nematollahi, Reza Peyghami an Tamás Terlaky 5 min x n subject to 0 x x k x k x k for k = 2,...,n 0 + x repeate h times x + x 2 repeate h 2 times. x n + x n. repeate h n times. To give a flavor of the main result, we first present Lemma 2. stating that, by aing + n times the reunant inequality x n + x n to the original KM formulation, the analytic center χ h can be pushe arbitrarily close to the vertex v {n} = (0,...,0,). To warranty, without loss of generality, that h is integer value, we assume that both an are positive integers. Lemma 2.. Given 4, positive integer an h = (0,...,0, + ), the analytic center n χ h satisfies χ h v {n}. While Lemma 2. sets the starting point of the central path in the -neighborhoo of v {n}, Proposition 2.2 states that, for a careful choice of an h, the central path of the cube takes 2 n 2 turns before converging to the origin as it passes through the -neighborhoo of all the 2 n vertices of the Klee-Minty n-cube. Proposition 2.2. Given 4, < n, choose integer n2 n+ an h = 4n (2n,..., 2 n 2 k,..., 2n k ), then for each vertex v S of the Klee-Minty n-cube, there is a point χ h (v S n n ) of the central path satisfying χ h (vn) S v S. 3 Proofs of Lemma 2. an Proposition Proof of Lemma 2. The analytic center χ h = (ξ h,...,ξh n) of KM h is the solution to the problem consisting of maximizing the prouct of the slack variables s = x s k = x k x k for k = 2,...,n s = x s k = x k x k for k = 2,...,n s = + s repeate h times. s n = + s n. repeate h n times.
6 6 The central path visits all the vertices of the Klee-Minty cube Equivalently, χ h is the solution of the following maximization problem max x i.e., with the convention x 0 = 0, max x n k= n (log s k + log s k + h k log s k ), k= ( ) log(x k x k ) + log( x k x k ) + h k log( + x k x k ). The optimality conitions (the graient is equal to zero at optimality) for this concave maximization problem give where σ h k σk+ h σ k h + h σ k+ h k h k+ σ k h σ k+ h + hn σn h σ n h σ n h = 0 for k =,...,n = 0 () σk h > 0, σh k > 0, σh k > 0 for k =,...,n, σ h = ξh σ h k = ξh k ξh k for k = 2,...,n σ h = ξh σ h k = ξh k ξh k for k = 2,...,n σ h k = + σh k for k =,...,n. The following lemma states that, for h n large enough relatively to the other h k values, the analytic center χ h is pushe to the neighborhoo of the vertex v {n} = (0,...,0,). Lemma 3.. Given 4 an h,...,h n, we have χ h v {n} for h n + η n where { ( hk = max η n k n 2 n k + 2 )}. Proof. The analytic center χ h = (ξ h,...,ξh n) is the solution of (). Let us consier the n-th equation of (). Since σ n h +, we have: h n +. Thus, as h σ n h n + η n, we have σ n h η n, which implies σ n h 2. Let us then consier the (n )-th equation. We have σ h n = σ n h + σn h + σ n h h n σ n h + h n σ n h σ n h h n σ n h + h n σ n h. Since σ h n η n, σ h n an σh n +, this implies σ h n 2 h n η n 2,
7 Antoine Deza, Eissa Nematollahi, Reza Peyghami an Tamás Terlaky 7 i.e., σn h 2. The first n equations of () can be rewritten as ( ) σk h + h k σ k h = σ k h + σk+ h + h k+ σ k+ h + σ k+ h for k =,...,n. For k n 2, forwar substitutions for the k-th, (k + )-th,... (n )-th equations give which implies σ h k + h k σ h k = σ h k + 2 σ h k n j=k+ n k σ h n j k σ h j h k σ h k Since σ n h η n, σ k h an σh n +, this implies + n k σ h n + h n n k σ n h. + h n n k σ h n + n k σ n h, σ h k 2n k η n h k 2, i.e., σk h 2 for k =,...,n 2. Therefore, for h n + η n, we have: ξk h for k =,...,n an ξn h. Lemma 2. is a irect corollary of Lemma 3. with h = (0,...,0,h n ). 3.2 Proof of Proposition Preliminary Lemmas Lemma 3.2. Given 4 an integer n2n+, then h = 4n (2n,..., 2n 2 k,..., 2n k ) n is a positive an integer solution of Ah b, where b = 4n (,...,) an n A = (+) (+) (+) (+)... n 2 0 (+) 2 (+) 3 2 (+)... n 2 + Proof. Multiplying both sies of Ah b by (+) 4n, we have ( ) 2 n + ( ) 2 n 2 + ( ) 2 n+ 5 + ( ) 2 n 2 k + k j= n ( 2 n 2 j ) + for k = 4,...,n,
8 8 The central path visits all the vertices of the Klee-Minty cube which, since ( ) n2 n, is implie by the obvious conitions n2 n 2 n + n2 n 2 n 2 + n2 n 2 n+ 5 + n2 n k2 n 3 2 k + + for k = 4,...,n. To ease the notations, we efine, for, k =,...,n l k = u k = h k + h k+ h k h k+ +. Lemma 3.3. The system Ah b is equivalent to 2h n n + h 4n l 4n l k k k j= u j j 4n for k = 2,...,n. Proof. The first 2 inequalities are irect reformulations of the first 2 inequalities of the system Ah b. For k = 2,...,n, the inequality: l k k k j= u j j 4n can be 2h rewritten as: k k + h k+ k h k (+) j=2 h j j 4n. Corollary 3.4. For h satisfying the last n inequalities of Ah b, we have l k k 2k+ n for k =,...,n. Proof. The proof is by inuction on k. We have l 4n u k l k in Lemma 3.3. an the result follows by using Corollary 3.5. Given 4 an a positive integer h satisfying the last n inequalities of Ah b, we have χ h v {n} 2h n n for h Proof. Corollary ( ) 3.4 implies l k 0 for k =,...,n. Hence, in Lemma 3. we have η n = h 2 n + 2 which gives the result. The central path of KM h can be efine as the set of analytic centers χ h (α) = (x h,...,xh n,α) of the intersection of the hyperplane H α : x n = α with the feasible region of KM h where 0 α ξ h n, see [7]. These intersections are calle the α-level sets an χh (α) is the solution of the following system { s h k s s h k+ h k s h k+ + h k s h k h k+ s h k+ = 0 for k =,...,n s h k > 0, sh k > 0, sh k > 0 for k =,...,n, (2)
9 Antoine Deza, Eissa Nematollahi, Reza Peyghami an Tamás Terlaky 9 where s h = x h s h k = x h k xh k for k = 2,...,n s h n = α x n s h = x h s h k = x h k xh k for k = 2,...,n s h n = α x h n s h k = + s h k for k =,...,n. In the rest of the paper, we assume that n an that a positive integer h satisfying Ah b is given. Corollary 3.5 implies that ξ h n an therefore we can consier the α-level set for α n as it implies α ξ h n. Lemma 3.6. Given 4, < n, integer n2 n+ an a positive integer h satisfying Ah b; for 0 α n an k {,n}, if the k-th coorinate x h k of the analytic center χ h (α) satisfies ] x h k [ k t k k, k + t k k, where then, x hˆk for some ˆk smaller than or equal to k. t = t 2 = 2 4n t k+ = t k n for k = 2,...,n, Proof. Assume to the contrary that the statement is false, i.e., x hˆk < for ˆk =,...,k. Consiering the first equation of (2) an successively using x h <, < an Lemma 3.3, we have s h 2 + s h 2 = s h which implies either or s h x h 2 xh + + h s h h 2 s h 2 2 < ( ) + 2 4n x h 2 x h + h + h 2 + h + h 2 4n ( ) + 2 4n 4n = t 2, 2 > ( ) 2 4n 4n >. Since x h 2 <, this implies xh 2 < t 2. Similarly, consiering the ˆk-th equation of (2) for ˆk = 2,...,k 2, we have: x hˆk < ˆk tˆkˆk. Consiering the (k )-st equation an successively using x h k < k, x h k 2 < an Corollary 3.4, we have, s h k + s h k = s h k s h + h k k s h h k k s h k k 2 k 2 + h k + h k l k 2k n k 2,
10 0 The central path visits all the vertices of the Klee-Minty cube which implies either or x h k xh k + k 2 k n < (k 2 t k k 2 ) + k 2 k n k t k k, x h k xh k k 2 k n > (k 2 t k k 2 ) k 2 k n k + t k k. This is impossible as x h k [ k t k k, k + t k k ]. Lemma 3.7. Given 4, < n, n2 n+, a positive integer h satisfying Ah b an t,...,t n as specifie in Lemma 3.6; for 0 α n an k {,n}, if the k-th coorinate x h k of the analytic center χh (α) satisfies ] x h k [t k k, t k k, then s hˆk 2ˆkn ˆk for some ˆk smaller than or equal to k. Proof. Assume to the contrary that the statement is false, i.e., s hˆk < 2ˆkn ˆk for ˆk =,...,k. This implies x hˆk < ˆk 4n ˆk j= 2 j 2 for ˆk =,...,k. Consiering the (k )-st equation of (2) an using s h k = 2xh k 2 sh k, we have s h k + s h k = s h k s h + h k k s h h k k s h 2k n k k k n k 2 + h k + h k l k. By Corollary 3.4, this implies which further implies either, since n t k, or x h k xh k + k 2 k n < k k 2 4n j= x h k xh k k 2 k n > k k 2 4n j= s h k + s h k 2k n k 2, 2 j 2 + k 2 k n = k k 4n j= This is impossible because x h k [ t k k, t k k ]. 2 j 2 k n 2 j 2 k 2 k n = k k 4n j= t k k, 2 j 2 t k k.
11 Antoine Deza, Eissa Nematollahi, Reza Peyghami an Tamás Terlaky Proof of Proposition 2.2 By analogy with the unit cube [0,] n, we enote the vertices of the Klee-Minty cube C using a subset S of {,...,n}. For S {,...,n}, a vertex v S of C is efine by { v S, if S = 0, otherwise { vk S v S = k, if k S vk S, otherwise k = 2,...,n. Proposition 3.8. Given 4, < n, n2 n+ an a positive integer h satisfying Ah b, for k n, the (k + )-th an k-th coorinates of the analytic center χ h (vn S ) of the vn S -level set satisfy x h k+ vs k+ t k+ k x h k vs k t k k. Proof. Assume to the contrary that the statement is false, i.e., for at least one k smaller than or equal to n, we have: x h k+ vs k+ t k+ k an x h k vs k > t k k. We consier a case by case analysis. Case : v S k = 0 The inequality x h k vs k > t k k implies x h k > t k k an, since x h k xh k+ xh k, we have t k k < x h k+ < t k k. Since t k+ < t k, this implies t k+ k < x h k+ < t k+ k. This contraicts the inequality x h k+ vs k+ t k+ k, where v S k+ = 0 or because vs k = 0. Case 2: 0 < v S k < The inequality x h k vs k > t k k implies x h k ] 0, v S k t k k [ or x h k ] v S k + t k k, [. By ]a,b[ we enote the open interval between a an b. Subcase 2.: x h k ] v S k + t k k, [ Since x h k xh k+ xh k, we have (vs k + t k k ) < x h k+ < (vs k + t k k ). Since t k+ < t k, this implies v S k + t k+ k < x h k+ < vs k t k+ k. This contraicts the inequality x h k+ vs k+ t k+ k, where v S k+ = vs k or vs k. Subcase 2.2: x h k ] 0, v S k t k k [ Subsubcase 2.2.: x h k < k t k k Consiering the k-th equation of (2) an successively using x k < k an Corollary 3.4, we have s h k+ + s h k+ = s h s k h k which implies either + h k s h h k+ k s h k+ k k + h k + h k+ l k 2k+ n k, x h k+ xh k + 2 k n k < ( k t k k ) + 2 k n k k t k+ k,
12 2 The central path visits all the vertices of the Klee-Minty cube or x h k+ xh k k 2 k n > (k t k k ) k 2 k n k + t k+ k. This contraicts the inequality x h k+ vs k+ t k+ k, where v S k+ k because v S k > 0. Subsubcase 2.2.2: k t k k x h k < vs k t k k (we have k since 0 < v S k < ) By Lemma 3.6, there is a ˆk smaller than or equal to k such that x hˆk, which implies: s hˆk 2. Consiering the ˆk-th equation of (2) an using s hˆk 2, we have ˆk ˆk ˆk s hˆk+ = s hˆk s hˆk ˆk s hˆk+ + hˆk s hˆk ˆk hˆk+ ˆk ˆk ˆk s hˆk+ 2 ˆk s hˆk+ + hˆk ˆk hˆk+ ˆk +, which implies ˆk s hˆk+ hˆk ˆk hˆk+ ˆk + = uˆkˆk. The previous inequality, which correspons to the case i = ˆk, can be generalize to: i s h i+ i u j j for i = ˆk,...,k, j=ˆk which clearly hols for k = ˆk + an, for k > ˆk +, is obtaine by multiplying the i-th equation of (2) by i for i = ˆk +,...,k an using successively a similar argument. Noticing that we coul have initially permute s hˆk+ an s hˆk+, gives k s h k k u j j. j=ˆk Together with the k-th equation of (2), this implies k s h k+ + k s h k+ = k s h k k s h k + h k k s h k h k+ k s h k+ h k k + h k+ k k u j j, j=ˆk i.e., k s h k+ + k s h k+ k l k k u j j. j=ˆk Using Lemma 3.3, Corollary 3.4 an u k l k, this implies k s h k+ + k s h k+ 4n ˆk + j= u j j 2ˆk+ n,
13 Antoine Deza, Eissa Nematollahi, Reza Peyghami an Tamás Terlaky 3 which implies either x h k+ xh k + k 2ˆkn < (vs k t k k ) + k 2ˆkn vs k t k+ k, or x h k+ xh k k 2ˆkn > (vs k t k k ) k 2ˆkn vs k + t k+ k. This contraicts the inequality x h k+ vs k+ t k+ k, where v S k+ = vs k or vs k. Case 3: v S k = The inequality x h k vs k > t k k implies x h k < t k k. Subcase 3.: x h k < t k k Consiering the k-th equation of (2) an successively using x h k < t k k, t k k an Corollary 3.4, we have s h k+ + s h k+ = s h s k h k which implies either + h k s h h k+ k s h k+ t k k t k k + h k + h k+ l k 2k+ n k, x h k+ xh k + k 2 k n < t k k + k 2 k n = (t k + 2 k n )k, or x h k+ xh k k 2 k n > t k k k 2 k n = (t k + 2 k n )k. This contraicts the inequality x h k+ vs k+ t k+ k, where v S k+ = or because vs k =. Subcase 3.2: t k k x h k < t k k Subsubcase 3.2.: k = From the first equation of (2), we have s h 2 + s h 2 = s h s h + h s h h 2 s h 2 + l 4n. which implies either x h 2 x h + 2 < ( ) + 2 4n 4n t 2, or x h 2 xh 2 > ( ) 2k 4n 4n + t 2. This contraicts x h 2 vs 2 t 2 where v S 2 = or since vs =.
14 4 The central path visits all the vertices of the Klee-Minty cube Subsubcase 3.2.2: k By Lemma 3.7, there is a ˆk smaller than or equal to k such that s hˆk ˆk 2ˆkn. Consiering the ˆk-th equation of (2), we have ˆk ˆk ˆk s hˆk+ = s hˆk s hˆk ˆk s hˆk+ + hˆk s hˆk ˆk hˆk+ ˆk s hˆk+ 2ˆk n + hˆkˆk hˆk+ ˆk + = uˆkˆk + 2ˆk n. This inequality, which correspons to the case i = ˆk, can be generalize to: i s h i+ i 2ˆkn u j j + j=ˆk for i = ˆk,...,k, which clearly hols for k = ˆk + an, for k > ˆk +, is obtaine by multiplying the i-th equation of (2) by i for i = ˆk +,...,k an using successively a similar argument. Noticing that we coul have initially permute s hˆk+ an s hˆk+, gives k s h k k 2ˆkn u j j +. j=ˆk Together with the k-th equation of (2), this implies k s h k+ + k s h k+ = k s h k k s h k + h k k s h k h k+ k s h k+ k 2ˆkn u i i Using Lemma 3.3, Corollary 3.4, an u k l k, the previous inequality gives i=ˆk + h k k + h k+ k. k s h k+ + k s h k+ k 2ˆkn l k k u i i i=ˆk 4n ˆk 2ˆkn + u i i i= 2ˆk+ n 2ˆkn = 2ˆkn, which implies either or x h k+ xh k + k 2ˆk n < ( t k k ) + k k 2ˆk n t k+ k, x h k+ xh k 2ˆk n > ( t k k ) 2ˆk n + t k+ k. This contraicts x h k+ vs k+ t k+ k where v S k+ = or since vs k =. Proposition 2.2 is a irect corollary of Proposition 3.8 since, for S an S {n}, we have x h n v S n = 0; implying x h k vs k t k k for k =,...,n. In other wors, χ h (v S n) v S. Furthermore, by Corollary 3.5 we have χ h v {n}, an the central path converges to the origin v. k
15 Antoine Deza, Eissa Nematollahi, Reza Peyghami an Tamás Terlaky 5 4 Remarks an Future Work We showe that, without changing the geometry of the feasible set of KM, the central path can be force to visit arbitrarily small neighborhoos of all the vertices of the Klee-Minty n-cube by carefully aing reunant constraints. This result highlights that, although the central path is a smooth analytical curve in the interior of the set of feasible solutions, it might be severely istracte by reunant constraints. In particular, exponentially many reunant constraints inter-playing with the geometry of the problem, may force the central path to take exponentially many an arbitrarily sharp turns. Our example leas to an Ω(2 n ) lower boun for the number of iterations neee for central path-following interior point methos. The theoretical iteration-complexity upper boun O( NL) = O(2 9n n 4 ) as, for this example, the number of constraints N = O(2 6n n 2 ) an the bit-length of the input-ata L = O(2 6n n 3 ). Therefore, the Ω(2 n ) lower boun yiels an Ω( 6 N ) iteration-complexity lower boun. Using a ifferent ln 2 N analysis, To an Ye [0] gave an Ω( 3 N) iteration-complexity lower boun between two upates of the barrier function. In a subsequent paper, Deza, Nematollahi an Terlaky [2] essentially close the gap between the lower an upper bouns. State-of-the-art preprocessing tools in moern linear optimization software woul eliminate the ae reunant inequalities. Therefore, interior point methos base coes woul solve the preprocesse KM h efficiently, just as commercial simplex coes o solve the KM in only one pivot. A challenging task woul be to esign a variant of KM h that cannot be easily simplifie by known preprocessing heuristics. Acknowlegments. Research supporte by the NSERC Discovery grant #48923 an a MITACS grant for the last three authors, by the Canaa Research Chair program for the first an last authors an by the NSERC Discovery grant #3969 for the first author. References [] G. B. Dantzig: Maximization of a linear function of variables subject to linear inequalities. In: T. C. Koopmans (e.) Activity Analysis of Prouction an Allocation. John Wiley (95) [2] A. Deza, E. Nematollahi an T. Terlaky: How goo are interior point methos? Klee- Minty cubes tighten iteration-complexity bouns. AvOL-Report 2004/20, McMaster University (2004). [3] N. K. Karmarkar: A new polynomial-time algorithm for linear programming. Combinatorica 4 (984) [4] L. G. Khachiyan: A polynomial algorithm in linear programming. Soviet Mathematics Doklay 20 (979) 9 94.
16 6 The central path visits all the vertices of the Klee-Minty cube [5] V. Klee an G. J. Minty: How goo is the simplex algorithm? In: O. Shisha (e.) Inequalities III, Acaemic Press (972) [6] N. Megio: Pathways to the optimal set in linear programming. In: N. Megio (e.) Progress in Mathematical Programming: Interior-Point an Relate Methos, Springer- Verlag (988) 3 58; also in: Proceeings of the 7th Mathematical Programming Symposium of Japan, Nagoya, Japan (986) 35. [7] C. Roos, T. Terlaky an J-Ph. Vial: Theory an Algorithms for Linear Optimization: An Interior Point Approach. Wiley-Interscience Series in Discrete Mathematics an Optimization. John Wiley (997). [8] G. Sonneven: An analytical centre for polyherons an new classes of global algorithms for linear (smooth, convex) programming. In: A. Prékopa, J. Szelezsán, an B. Strazicky (es.) System Moelling an Optimization: Proceeings of the 2th IFIP- Conference, Buapest 985. Lecture Notes in Control an Information Sciences 84 Springer Verlag (986) [9] T. Terlaky an S. Zhang: Pivot rules for linear programming - a survey. Annals of Operations Research 46 (993) [0] M. To an Y. Ye: A lower boun on the number of iterations of long-step an polynomial interior-point linear programming algorithms. Annals of Operations Research 62 (996) [] S. J. Wright: Primal-Dual Interior-Point Methos. SIAM Publications (997). [2] Y. Ye: Interior-Point Algorithms: Theory an Analysis. Wiley-Interscience Series in Discrete Mathematics an Optimization. John Wiley (997). Antoine Deza, Eissa Nematollahi, Reza Peyghami, Tamás Terlaky Avance Optimization Laboratory, Department of Computing an Software, McMaster University, Hamilton, Ontario, Canaa. eza, nematoe, terlaky@mcmaster.ca, peyghami@optlab.mcmaster.ca
A Simpler and Tighter Redundant Klee-Minty Construction
A Simpler and Tighter Redundant Klee-Minty Construction Eissa Nematollahi Tamás Terlaky October 19, 2006 Abstract By introducing redundant Klee-Minty examples, we have previously shown that the central
More informationA Redundant Klee-Minty Construction with All the Redundant Constraints Touching the Feasible Region
A Redundant Klee-Minty Construction with All the Redundant Constraints Touching the Feasible Region Eissa Nematollahi Tamás Terlaky January 5, 2008 Abstract By introducing some redundant Klee-Minty constructions,
More informationA tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes
A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes Murat Mut Tamás Terlaky Department of Industrial and Systems Engineering Lehigh University
More informationCombinatorica 9(1)(1989) A New Lower Bound for Snake-in-the-Box Codes. Jerzy Wojciechowski. AMS subject classification 1980: 05 C 35, 94 B 25
Combinatorica 9(1)(1989)91 99 A New Lower Boun for Snake-in-the-Box Coes Jerzy Wojciechowski Department of Pure Mathematics an Mathematical Statistics, University of Cambrige, 16 Mill Lane, Cambrige, CB2
More informationAcute sets in Euclidean spaces
Acute sets in Eucliean spaces Viktor Harangi April, 011 Abstract A finite set H in R is calle an acute set if any angle etermine by three points of H is acute. We examine the maximal carinality α() of
More informationIterated Point-Line Configurations Grow Doubly-Exponentially
Iterate Point-Line Configurations Grow Doubly-Exponentially Joshua Cooper an Mark Walters July 9, 008 Abstract Begin with a set of four points in the real plane in general position. A to this collection
More informationLecture 22. Lecturer: Michel X. Goemans Scribe: Alantha Newman (2004), Ankur Moitra (2009)
8.438 Avance Combinatorial Optimization Lecture Lecturer: Michel X. Goemans Scribe: Alantha Newman (004), Ankur Moitra (009) MultiFlows an Disjoint Paths Here we will survey a number of variants of isjoint
More informationA Sketch of Menshikov s Theorem
A Sketch of Menshikov s Theorem Thomas Bao March 14, 2010 Abstract Let Λ be an infinite, locally finite oriente multi-graph with C Λ finite an strongly connecte, an let p
More informationLower Bounds for the Smoothed Number of Pareto optimal Solutions
Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.
More informationOn colour-blind distinguishing colour pallets in regular graphs
J Comb Optim (2014 28:348 357 DOI 10.1007/s10878-012-9556-x On colour-blin istinguishing colour pallets in regular graphs Jakub Przybyło Publishe online: 25 October 2012 The Author(s 2012. This article
More informationLecture 5. Symmetric Shearer s Lemma
Stanfor University Spring 208 Math 233: Non-constructive methos in combinatorics Instructor: Jan Vonrák Lecture ate: January 23, 208 Original scribe: Erik Bates Lecture 5 Symmetric Shearer s Lemma Here
More informationPermanent vs. Determinant
Permanent vs. Determinant Frank Ban Introuction A major problem in theoretical computer science is the Permanent vs. Determinant problem. It asks: given an n by n matrix of ineterminates A = (a i,j ) an
More informationLOWER BOUNDS FOR THE MAXIMUM NUMBER OF SOLUTIONS GENERATED BY THE SIMPLEX METHOD
Journal of the Operations Research Society of Japan Vol 54, No 4, December 2011, pp 191 200 c The Operations Research Society of Japan LOWER BOUNDS FOR THE MAXIMUM NUMBER OF SOLUTIONS GENERATED BY THE
More informationThe continuous d-step conjecture for polytopes
The continuous d-step conjecture for polytopes Antoine Deza, Tamás Terlaky and Yuriy Zinchenko September, 2007 Abstract The curvature of a polytope, defined as the largest possible total curvature of the
More informationRamsey numbers of some bipartite graphs versus complete graphs
Ramsey numbers of some bipartite graphs versus complete graphs Tao Jiang, Michael Salerno Miami University, Oxfor, OH 45056, USA Abstract. The Ramsey number r(h, K n ) is the smallest positive integer
More informationLower bounds on Locality Sensitive Hashing
Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,
More informationDiscrete Mathematics
Discrete Mathematics 309 (009) 86 869 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/isc Profile vectors in the lattice of subspaces Dániel Gerbner
More informationPolynomiality of Linear Programming
Chapter 10 Polynomiality of Linear Programming In the previous section, we presented the Simplex Method. This method turns out to be very efficient for solving linear programmes in practice. While it is
More informationComputing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions
Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5
More informationProperties of a Simple Variant of Klee-Minty s LP and Their Proof
Properties of a Simple Variant of Klee-Minty s LP and Their Proof Tomonari Kitahara and Shinji Mizuno December 28, 2 Abstract Kitahara and Mizuno (2) presents a simple variant of Klee- Minty s LP, which
More informationarxiv: v1 [math.co] 15 Sep 2015
Circular coloring of signe graphs Yingli Kang, Eckhar Steffen arxiv:1509.04488v1 [math.co] 15 Sep 015 Abstract Let k, ( k) be two positive integers. We generalize the well stuie notions of (k, )-colorings
More informationChromatic number for a generalization of Cartesian product graphs
Chromatic number for a generalization of Cartesian prouct graphs Daniel Král Douglas B. West Abstract Let G be a class of graphs. The -fol gri over G, enote G, is the family of graphs obtaine from -imensional
More informationFLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction
FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS ALINA BUCUR, CHANTAL DAVID, BROOKE FEIGON, MATILDE LALÍN 1 Introuction In this note, we stuy the fluctuations in the number
More informationCS711008Z Algorithm Design and Analysis
CS711008Z Algorithm Design and Analysis Lecture 8 Linear programming: interior point method Dongbo Bu Institute of Computing Technology Chinese Academy of Sciences, Beijing, China 1 / 31 Outline Brief
More informationApproximate Constraint Satisfaction Requires Large LP Relaxations
Approximate Constraint Satisfaction Requires Large LP Relaxations oah Fleming April 19, 2018 Linear programming is a very powerful tool for attacking optimization problems. Techniques such as the ellipsoi
More informationAgmon Kolmogorov Inequalities on l 2 (Z d )
Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,
More informationTractability results for weighted Banach spaces of smooth functions
Tractability results for weighte Banach spaces of smooth functions Markus Weimar Mathematisches Institut, Universität Jena Ernst-Abbe-Platz 2, 07740 Jena, Germany email: markus.weimar@uni-jena.e March
More informationOn Mehrotra-Type Predictor-Corrector Algorithms
On Mehrotra-Type Predictor-Corrector Algorithms M. Salahi, J. Peng, T. Terlaky April 7, 005 Abstract In this paper we discuss the polynomiality of Mehrotra-type predictor-corrector algorithms. We consider
More informationOptimization WS 13/14:, by Y. Goldstein/K. Reinert, 9. Dezember 2013, 16: Linear programming. Optimization Problems
Optimization WS 13/14:, by Y. Goldstein/K. Reinert, 9. Dezember 2013, 16:38 2001 Linear programming Optimization Problems General optimization problem max{z(x) f j (x) 0,x D} or min{z(x) f j (x) 0,x D}
More informationLecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012
CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration
More informationALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS
ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS MARK SCHACHNER Abstract. When consiere as an algebraic space, the set of arithmetic functions equippe with the operations of pointwise aition an
More information7.1 Support Vector Machine
67577 Intro. to Machine Learning Fall semester, 006/7 Lecture 7: Support Vector Machines an Kernel Functions II Lecturer: Amnon Shashua Scribe: Amnon Shashua 7. Support Vector Machine We return now to
More informationarxiv: v1 [math.mg] 10 Apr 2018
ON THE VOLUME BOUND IN THE DVORETZKY ROGERS LEMMA FERENC FODOR, MÁRTON NASZÓDI, AND TAMÁS ZARNÓCZ arxiv:1804.03444v1 [math.mg] 10 Apr 2018 Abstract. The classical Dvoretzky Rogers lemma provies a eterministic
More informationLeast-Squares Regression on Sparse Spaces
Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction
More informationLecture 2 Lagrangian formulation of classical mechanics Mechanics
Lecture Lagrangian formulation of classical mechanics 70.00 Mechanics Principle of stationary action MATH-GA To specify a motion uniquely in classical mechanics, it suffices to give, at some time t 0,
More informationRobust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k
A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine
More information7. Localization. (d 1, m 1 ) (d 2, m 2 ) d 3 D : d 3 d 1 m 2 = d 3 d 2 m 1. (ii) If (d 1, m 1 ) (d 1, m 1 ) and (d 2, m 2 ) (d 2, m 2 ) then
7. Localization To prove Theorem 6.1 it becomes necessary to be able to a enominators to rings (an to moules), even when the rings have zero-ivisors. It is a tool use all the time in commutative algebra,
More informationPDE Notes, Lecture #11
PDE Notes, Lecture # from Professor Jalal Shatah s Lectures Febuary 9th, 2009 Sobolev Spaces Recall that for u L loc we can efine the weak erivative Du by Du, φ := udφ φ C0 If v L loc such that Du, φ =
More informationCentral path curvature and iteration-complexity for redundant Klee-Minty cubes
Central path curvature and iteration-complexity for redundant Klee-Minty cubes Antoine Deza, Tamás Terlaky, and Yuriy Zinchenko Advanced Optimization Laboratory, Department of Computing and Software, zinchen@mcmaster.ca
More informationJournal of Algebra. A class of projectively full ideals in two-dimensional Muhly local domains
Journal of Algebra 32 2009 903 9 Contents lists available at ScienceDirect Journal of Algebra wwwelseviercom/locate/jalgebra A class of projectively full ieals in two-imensional Muhly local omains aymon
More informationA Spectral Method for the Biharmonic Equation
A Spectral Metho for the Biharmonic Equation Kenall Atkinson, Davi Chien, an Olaf Hansen Abstract Let Ω be an open, simply connecte, an boune region in Ê,, with a smooth bounary Ω that is homeomorphic
More informationTensors, Fields Pt. 1 and the Lie Bracket Pt. 1
Tensors, Fiels Pt. 1 an the Lie Bracket Pt. 1 PHYS 500 - Southern Illinois University September 8, 2016 PHYS 500 - Southern Illinois University Tensors, Fiels Pt. 1 an the Lie Bracket Pt. 1 September 8,
More informationDiophantine Approximations: Examining the Farey Process and its Method on Producing Best Approximations
Diophantine Approximations: Examining the Farey Process an its Metho on Proucing Best Approximations Kelly Bowen Introuction When a person hears the phrase irrational number, one oes not think of anything
More informationMinimum-time constrained velocity planning
7th Meiterranean Conference on Control & Automation Makeonia Palace, Thessaloniki, Greece June 4-6, 9 Minimum-time constraine velocity planning Gabriele Lini, Luca Consolini, Aurelio Piazzi Università
More informationGeneralized Tractability for Multivariate Problems
Generalize Tractability for Multivariate Problems Part II: Linear Tensor Prouct Problems, Linear Information, an Unrestricte Tractability Michael Gnewuch Department of Computer Science, University of Kiel,
More informationLATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION
The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische
More informationThe chromatic number of graph powers
Combinatorics, Probability an Computing (19XX) 00, 000 000. c 19XX Cambrige University Press Printe in the Unite Kingom The chromatic number of graph powers N O G A A L O N 1 an B O J A N M O H A R 1 Department
More informationCounting Lattice Points in Polytopes: The Ehrhart Theory
3 Counting Lattice Points in Polytopes: The Ehrhart Theory Ubi materia, ibi geometria. Johannes Kepler (1571 1630) Given the profusion of examples that gave rise to the polynomial behavior of the integer-point
More informationA Continuous d-step Conjecture for Polytopes
Discrete Comput Geom (2009) 4: 38 327 DOI 0.007/s00454-008-9096-4 A Continuous d-step Conjecture for Polytopes Antoine Deza Tamás Terlaky Yuriy Zinchenko Received: September 2007 / Revised: 25 May 2008
More informationUnit vectors with non-negative inner products
Unit vectors with non-negative inner proucts Bos, A.; Seiel, J.J. Publishe: 01/01/1980 Document Version Publisher s PDF, also known as Version of Recor (inclues final page, issue an volume numbers) Please
More informationProof of SPNs as Mixture of Trees
A Proof of SPNs as Mixture of Trees Theorem 1. If T is an inuce SPN from a complete an ecomposable SPN S, then T is a tree that is complete an ecomposable. Proof. Argue by contraiction that T is not a
More informationMotivation. CS/EE 3700 : Fundamentals of Digital System Design
Motivation CS/EE 37 : Funamentals o Digital System Design Chris J. Myers Lecture 4: Logic Optimization Chapter 4 Algebraic manipulation is not systematic. This chapter presents methos that can be automate
More informationIMFM Institute of Mathematics, Physics and Mechanics Jadranska 19, 1000 Ljubljana, Slovenia. Preprint series Vol. 50 (2012), 1173 ISSN
IMFM Institute of Mathematics, Physics an Mechanics Jaransa 19, 1000 Ljubljana, Slovenia Preprint series Vol. 50 (2012), 1173 ISSN 2232-2094 PARITY INDEX OF BINARY WORDS AND POWERS OF PRIME WORDS Alesanar
More informationIntroduction to optimization
Introduction to optimization Geir Dahl CMA, Dept. of Mathematics and Dept. of Informatics University of Oslo 1 / 24 The plan 1. The basic concepts 2. Some useful tools (linear programming = linear optimization)
More informationCalculus and optimization
Calculus an optimization These notes essentially correspon to mathematical appenix 2 in the text. 1 Functions of a single variable Now that we have e ne functions we turn our attention to calculus. A function
More informationAn EP theorem for dual linear complementarity problems
An EP theorem for dual linear complementarity problems Tibor Illés, Marianna Nagy and Tamás Terlaky Abstract The linear complementarity problem (LCP ) belongs to the class of NP-complete problems. Therefore
More informationQF101: Quantitative Finance September 5, Week 3: Derivatives. Facilitator: Christopher Ting AY 2017/2018. f ( x + ) f(x) f(x) = lim
QF101: Quantitative Finance September 5, 2017 Week 3: Derivatives Facilitator: Christopher Ting AY 2017/2018 I recoil with ismay an horror at this lamentable plague of functions which o not have erivatives.
More informationLecture 6 : Dimensionality Reduction
CPS290: Algorithmic Founations of Data Science February 3, 207 Lecture 6 : Dimensionality Reuction Lecturer: Kamesh Munagala Scribe: Kamesh Munagala In this lecture, we will consier the roblem of maing
More informationMonotonicity for excited random walk in high dimensions
Monotonicity for excite ranom walk in high imensions Remco van er Hofsta Mark Holmes March, 2009 Abstract We prove that the rift θ, β) for excite ranom walk in imension is monotone in the excitement parameter
More informationPhysics 5153 Classical Mechanics. The Virial Theorem and The Poisson Bracket-1
Physics 5153 Classical Mechanics The Virial Theorem an The Poisson Bracket 1 Introuction In this lecture we will consier two applications of the Hamiltonian. The first, the Virial Theorem, applies to systems
More informationNumerical Optimization
Linear Programming - Interior Point Methods Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Example 1 Computational Complexity of Simplex Algorithm
More informationExistence of equilibria in articulated bearings in presence of cavity
J. Math. Anal. Appl. 335 2007) 841 859 www.elsevier.com/locate/jmaa Existence of equilibria in articulate bearings in presence of cavity G. Buscaglia a, I. Ciuperca b, I. Hafii c,m.jai c, a Centro Atómico
More informationIERCU. Institute of Economic Research, Chuo University 50th Anniversary Special Issues. Discussion Paper No.210
IERCU Institute of Economic Research, Chuo University 50th Anniversary Special Issues Discussion Paper No.210 Discrete an Continuous Dynamics in Nonlinear Monopolies Akio Matsumoto Chuo University Ferenc
More information4TE3/6TE3. Algorithms for. Continuous Optimization
4TE3/6TE3 Algorithms for Continuous Optimization (Duality in Nonlinear Optimization ) Tamás TERLAKY Computing and Software McMaster University Hamilton, January 2004 terlaky@mcmaster.ca Tel: 27780 Optimality
More informationTHE GENUINE OMEGA-REGULAR UNITARY DUAL OF THE METAPLECTIC GROUP
THE GENUINE OMEGA-REGULAR UNITARY DUAL OF THE METAPLECTIC GROUP ALESSANDRA PANTANO, ANNEGRET PAUL, AND SUSANA A. SALAMANCA-RIBA Abstract. We classify all genuine unitary representations of the metaplectic
More information4.5 Simplex method. LP in standard form: min z = c T x s.t. Ax = b
4.5 Simplex method LP in standard form: min z = c T x s.t. Ax = b x 0 George Dantzig (1914-2005) Examine a sequence of basic feasible solutions with non increasing objective function values until an optimal
More informationu!i = a T u = 0. Then S satisfies
Deterministic Conitions for Subspace Ientifiability from Incomplete Sampling Daniel L Pimentel-Alarcón, Nigel Boston, Robert D Nowak University of Wisconsin-Maison Abstract Consier an r-imensional subspace
More informationConnections Between Duality in Control Theory and
Connections Between Duality in Control heory an Convex Optimization V. Balakrishnan 1 an L. Vanenberghe 2 Abstract Several important problems in control theory can be reformulate as convex optimization
More information6 General properties of an autonomous system of two first order ODE
6 General properties of an autonomous system of two first orer ODE Here we embark on stuying the autonomous system of two first orer ifferential equations of the form ẋ 1 = f 1 (, x 2 ), ẋ 2 = f 2 (, x
More informationSYSTEMS OF DIFFERENTIAL EQUATIONS, EULER S FORMULA. where L is some constant, usually called the Lipschitz constant. An example is
SYSTEMS OF DIFFERENTIAL EQUATIONS, EULER S FORMULA. Uniqueness for solutions of ifferential equations. We consier the system of ifferential equations given by x = v( x), () t with a given initial conition
More informationA note on asymptotic formulae for one-dimensional network flow problems Carlos F. Daganzo and Karen R. Smilowitz
A note on asymptotic formulae for one-imensional network flow problems Carlos F. Daganzo an Karen R. Smilowitz (to appear in Annals of Operations Research) Abstract This note evelops asymptotic formulae
More informationThe Simplex and Policy Iteration Methods are Strongly Polynomial for the Markov Decision Problem with Fixed Discount
The Simplex and Policy Iteration Methods are Strongly Polynomial for the Markov Decision Problem with Fixed Discount Yinyu Ye Department of Management Science and Engineering and Institute of Computational
More informationLIAISON OF MONOMIAL IDEALS
LIAISON OF MONOMIAL IDEALS CRAIG HUNEKE AND BERND ULRICH Abstract. We give a simple algorithm to ecie whether a monomial ieal of nite colength in a polynomial ring is licci, i.e., in the linkage class
More informationOn the enumeration of partitions with summands in arithmetic progression
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 8 (003), Pages 149 159 On the enumeration of partitions with summans in arithmetic progression M. A. Nyblom C. Evans Department of Mathematics an Statistics
More informationA New Vulnerable Class of Exponents in RSA
A ew Vulnerable Class of Exponents in RSA Aberrahmane itaj Laboratoire e Mathématiues icolas Oresme Campus II, Boulevar u Maréchal Juin BP 586, 4032 Caen Ceex, France. nitaj@math.unicaen.fr http://www.math.unicaen.fr/~nitaj
More informationA Unified Theorem on SDP Rank Reduction
A Unifie heorem on SDP Ran Reuction Anthony Man Cho So, Yinyu Ye, Jiawei Zhang November 9, 006 Abstract We consier the problem of fining a low ran approximate solution to a system of linear equations in
More informationTechnion - Computer Science Department - M.Sc. Thesis MSC Constrained Codes for Two-Dimensional Channels.
Technion - Computer Science Department - M.Sc. Thesis MSC-2006- - 2006 Constraine Coes for Two-Dimensional Channels Keren Censor Technion - Computer Science Department - M.Sc. Thesis MSC-2006- - 2006 Technion
More informationSOME RESULTS ON THE GEOMETRY OF MINKOWSKI PLANE. Bing Ye Wu
ARCHIVUM MATHEMATICUM (BRNO Tomus 46 (21, 177 184 SOME RESULTS ON THE GEOMETRY OF MINKOWSKI PLANE Bing Ye Wu Abstract. In this paper we stuy the geometry of Minkowski plane an obtain some results. We focus
More informationOptimization (168) Lecture 7-8-9
Optimization (168) Lecture 7-8-9 Jesús De Loera UC Davis, Mathematics Wednesday, April 2, 2012 1 DEGENERACY IN THE SIMPLEX METHOD 2 DEGENERACY z =2x 1 x 2 + 8x 3 x 4 =1 2x 3 x 5 =3 2x 1 + 4x 2 6x 3 x 6
More informationFinal Exam Study Guide and Practice Problems Solutions
Final Exam Stuy Guie an Practice Problems Solutions Note: These problems are just some of the types of problems that might appear on the exam. However, to fully prepare for the exam, in aition to making
More informationA new proof of the sharpness of the phase transition for Bernoulli percolation on Z d
A new proof of the sharpness of the phase transition for Bernoulli percolation on Z Hugo Duminil-Copin an Vincent Tassion October 8, 205 Abstract We provie a new proof of the sharpness of the phase transition
More informationMath 1271 Solutions for Fall 2005 Final Exam
Math 7 Solutions for Fall 5 Final Eam ) Since the equation + y = e y cannot be rearrange algebraically in orer to write y as an eplicit function of, we must instea ifferentiate this relation implicitly
More informationMARTIN HENK AND MAKOTO TAGAMI
LOWER BOUNDS ON THE COEFFICIENTS OF EHRHART POLYNOMIALS MARTIN HENK AND MAKOTO TAGAMI Abstract. We present lower bouns for the coefficients of Ehrhart polynomials of convex lattice polytopes in terms of
More informationFloating Body, Illumination Body, and Polytopal Approximation
Convex Geometric Analysis MSRI Publications Volume 34, 998 Floating Boy, Illumination Boy, an Polytopal Approximation CARSTEN SCHÜTT Abstract. Let K be a convex boy inr an K t its floating boies. There
More informationLarge Triangles in the d-dimensional Unit-Cube (Extended Abstract)
Large Triangles in the -Dimensional Unit-Cube Extene Abstract) Hanno Lefmann Fakultät für Informatik, TU Chemnitz, D-0907 Chemnitz, Germany lefmann@informatik.tu-chemnitz.e Abstract. We consier a variant
More informationOn the Cauchy Problem for Von Neumann-Landau Wave Equation
Journal of Applie Mathematics an Physics 4 4-3 Publishe Online December 4 in SciRes http://wwwscirporg/journal/jamp http://xoiorg/436/jamp4343 On the Cauchy Problem for Von Neumann-anau Wave Equation Chuangye
More informationTMA 4195 Matematisk modellering Exam Tuesday December 16, :00 13:00 Problems and solution with additional comments
Problem F U L W D g m 3 2 s 2 0 0 0 0 2 kg 0 0 0 0 0 0 Table : Dimension matrix TMA 495 Matematisk moellering Exam Tuesay December 6, 2008 09:00 3:00 Problems an solution with aitional comments The necessary
More informationn 1 conv(ai) 0. ( 8. 1 ) we get u1 = u2 = = ur. Hence the common value of all the Uj Tverberg's Tl1eorem
8.3 Tverberg's Tl1eorem 203 hence Uj E cone(aj ) Above we have erive L;=l 'Pi (uj ) = 0, an so by ( 8. 1 ) we get u1 = u2 = = ur. Hence the common value of all the Uj belongs to n;=l cone(aj ). It remains
More informationPerfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs
Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs Ashish Goel Michael Kapralov Sanjeev Khanna Abstract We consier the well-stuie problem of fining a perfect matching in -regular bipartite
More informationConstrained optimal discrimination designs for Fourier regression models
Ann Inst Stat Math (29) 6:43 57 DOI.7/s463-7-33-5 Constraine optimal iscrimination esigns for Fourier regression moels Stefanie Bieermann Holger Dette Philipp Hoffmann Receive: 26 June 26 / Revise: 9 March
More informationTime-of-Arrival Estimation in Non-Line-Of-Sight Environments
2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor
More informationMcMaster University. Advanced Optimization Laboratory. Advanced Optimization Laboratory. Title: Title: Small Primitive strings Zonotopes
McMaster University Avance Optimization Laboratory Avance Optimization Laboratory Title: Title: A computational framework for etermining square-maximal Small Primitive strings Zonotopes Authors: Authors:
More informationA primal-simplex based Tardos algorithm
A primal-simplex based Tardos algorithm Shinji Mizuno a, Noriyoshi Sukegawa a, and Antoine Deza b a Graduate School of Decision Science and Technology, Tokyo Institute of Technology, 2-12-1-W9-58, Oo-Okayama,
More informationProbabilistic Analysis of Power Assignments
Probabilistic Analysis of Power Assignments Maurits e Graaf 1,2 an Boo Manthey 1 1 University of Twente, Department of Applie Mathematics, Enschee, Netherlans m.egraaf/b.manthey@utwente.nl 2 Thales Neerlan
More informationAll s Well That Ends Well: Supplementary Proofs
All s Well That Ens Well: Guarantee Resolution of Simultaneous Rigi Boy Impact 1:1 All s Well That Ens Well: Supplementary Proofs This ocument complements the paper All s Well That Ens Well: Guarantee
More informationAn Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
Journal of Machine Learning Research 8 07) - Submitte /6; Publishe 5/7 An Optimal Algorithm for Banit an Zero-Orer Convex Optimization with wo-point Feeback Oha Shamir Department of Computer Science an
More informationThe Ellipsoid (Kachiyan) Method
Yinyu Ye, MS&E, Stanford MS&E310 Lecture Note: Ellipsoid Method 1 The Ellipsoid (Kachiyan) Method Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A.
More informationChapter 5. Factorization of Integers
Chapter 5 Factorization of Integers 51 Definition: For a, b Z we say that a ivies b (or that a is a factor of b, or that b is a multiple of a, an we write a b, when b = ak for some k Z 52 Theorem: (Basic
More informationTHE MONIC INTEGER TRANSFINITE DIAMETER
MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000 000 S 005-578(XX)0000-0 THE MONIC INTEGER TRANSFINITE DIAMETER K. G. HARE AND C. J. SMYTH ABSTRACT. We stuy the problem of fining nonconstant monic
More information3.7 Implicit Differentiation -- A Brief Introduction -- Student Notes
Fin these erivatives of these functions: y.7 Implicit Differentiation -- A Brief Introuction -- Stuent Notes tan y sin tan = sin y e = e = Write the inverses of these functions: y tan y sin How woul we
More information