A New Second-Order Corrector Interior-Point Algorithm for P (κ)-lcp
|
|
- Curtis Lee
- 6 years ago
- Views:
Transcription
1 Filomat 3:0 07, Published by Faculty of Scieces ad Mathematics, Uiversity of Niš, Serbia Available at: A New Secod-Order Corrector Iterior-Poit Algorithm for P κ-lcp B. Kheirfam a, M. Chitsaz a a Departmet of Applied Mathematics, Azarbaija Shahid Madai Uiversity, Tabriz, Ira Abstract. I this paper, we propose a secod-order corrector iterior-poit algorithm for solvig P κ- liear complemetarity problems. The method geerates a sequece of iterates i a wide eighborhood of the cetral path itroduced by Ai ad Zhag. I each iteratio, the method computes a corrector directio i additio to the Ai-Zhag directio, i a attempt to improve performace. The algorithm does ot deped o the hadicap κ of the problem, so that it ca be used for ay P κ liear complemetarity problems. It is show that the iteratio complexity boud of the algorithm is O + κ 3 L. Some umerical results are provided to illustrate the performace of the algorithm.. Itroductio The P κ-liear complemetarity problem LCP requires the computatio of a vector pair x, s R satisfyig Mx + s = q, xs = 0, x, s 0, where q R ad M R is a P κ-matrix. The class of P -matrices was itroduced by Kojima et al. [4] ad it cotais may types of matrices ecoutered i practical applicatios. Let κ be a oegative umber. A matrix M is called a P κ-matrix iff it satisfies the followig coditio: + 4κ x i Mx i + x i Mx i 0, x R, i I + i I where I + = {i : x i Mx i 0} ad I = {i : x i Mx i < 0} are two idex sets. The class of all P κ-matrices is deoted by P κ, ad the class P is defied by P = κ 0 P κ, i.e., M is a P -matrix iff M P κ for some κ 0. Obviously, P 0 is the class of positive semidefiite matrices. LCPs have may applicatios, e.g., liear ad quadratic programmig, fidig a Nash-equilibrium i bimatrix games ad calculatig the iterval hull of liear systems of iterval equatios [, 4]. There are a variety of solutio approaches for LCPs which have bee studied itesively. Amog them, the iterior-poit methods IPMs gaied much attetio tha other methods. IPMs ot oly have polyomial complexity but also they are the most effective methods for solvig large scale optimizatio problems. Examples of IPMs that are reliable both i theory ad i practice iclude the primal-dual path-followig 00 Mathematics Subject Classificatio. Primary 90C5; Secodary 90C33 Keywords. Iterior-poit methods, liear complemetarity problem, P κ matrix, wide eighborhood, polyomial complexity Received: 06 April 06; Revised: December 06; Accepted: December 07 Commuicated by Predrag Staimirović addresses: b.kheirfam@azaruiv.edu B. Kheirfam, Chitsaz@azaruiv.edu M. Chitsaz
2 B. Kheirfam, M. Chitsaz / Filomat 3:0 07, methods of Kojima et al. [5] ad sice the may other algorithms have bee developed based o the primaldual strategy. Mizuo, Todd ad Ye [0] proposed the MTY predictor-corrector algorithm. It was the first algorithm for liear optimizatio LO that had both polyomial complexity ad superliear covergece. More precisely, it has O L iteratio complexity ad the duality gap of the sequece geerated by the MTY algorithm coverges to zero quadratically [7]. I 995 [9] Miao exteded the MTY predictor-corrector method for P κ-lcp. His algorithm has O+κ L iteratio complexity ad is quadratically coverget for odegeerate problems. However, the costat κ is explicitly used i the costructio of the algorithm, which implies that the algorithm ca ot be used for sufficiet liear complemetarity problems. Potra ad Sheg [3] geeralized the MTY predictor-corrector method for sufficiet complemetarity problems. Although the algorithms of [3] do ot deped o the costat κ, their computatioal complexity does: if the problem is a P κ-lcp they termiate i at most O + κ L iteratios. The proposed algorithm i [3] has Q-order i odegeerate case, ad.5 i the degeerate case. Predictor-corrector algorithms with higher order of covergece for degeerate sufficiet LCPs were give i [5]. These algorithms have O + κ L iteratio complexity for P κ LCPs [6]. Although some of the above metioed algorithms have optimal iteratio complexity, i practice those which use wide eighborhood perform better. This is oe of the paradoxes of the iterior-poit methods because algorithms which use large eighborhoods of the cetral path are usually more difficult to aalyze ad, i geeral, their computatioal complexity is worse tha the correspodig oe for algorithms usig smaller eighborhoods. Potra ad Liu [] preseted two predictor-corrector methods for sufficiet liear complemetarity problems based o the N wide eighborhood. The first algorithm depeds o the hadicap κ while the secod does ot. Both algorithms are superliearly coverget eve for degeerate problems ad have O + κ +/m L iteratio complexity. I the ext paper, the authors preseted a corrector-predictor algorithm actig i the wide eighborhood N of the cetral path that does ot deped o the hadicap κ of the problem, has O + κ L iteratio complexity, ad is superliearly coverget eve for geeral sufficiet liear complemetarity problems. Cosiderig other wide eighborhoods that are differet from the classical N eighborhood could be a choice for improvig the complexity of iterior-poit methods. I [] Ai ad Zhag itroduced a ew wide eighborhood Ñ τ α of the cetral path. Their algorithm decomposes the classical Newto directio ito two orthogoal directios usig differet step-legth for each of them. Based o Ai ad Zhag idea, Liu ad Liu [6] proposed a primal-dual secod order corrector IPM for liear programmig LP. The mai differece betwee the method i [] ad [6] lies i that at each iteratio, the latter method computes a corrector directio i additio to the Ai-Zhag directio. Later o, the authors geeralized the proposed algorithm i [6] to semidefiite optimizatio SDO [7]. Recetly, Potra [] preseted three iterior-poit algorithms for sufficiet horizotal liear complemetarity problems HLCP actig i a wide eighborhood of the cetral path proposed by Ai ad Zhag. Motivated by the above metioed works, we preset a secod-order corrector iterior-poit algorithm for P κ-lcp based o the Ai-Zhag wide eighborhood, ad we derive the complexity boud for our algorithm. Numerical results show that our algorithm is promisig. The outlie of this paper is as follows. I sectio, we itroduce P κ-lcp ad review some basic cocepts for IPMs for solvig LCPs, such as the cetral path. I sectio 3, we state ad prove some techical lemmas ad the, based o these results, we establish the iteratio complexity boud of the proposed algorithm. Numerical results are preseted i sectio 4. Fially, some coclusios ad remarks are give i sectio 5. The followig otatios are used through the paper. R deotes the -dimesioal Euclidea space. All the vectors are colum vectors ad e deotes the vector with all compoets equal to oe. For ay vectors x ad s, xs deotes compoetwise product Hadamard product of vectors x ad s, ad so is true for other operatios, e.g., if x R +, the x deotes the vector with compoet x i ad xs with compoet xi s i.the positive ad egative parts of a vector v R are defied by v + = max{v, 0} ad v = mi{v, 0}, so that v + 0, v 0 ad v = v + + v.
3 . The Cetral Path ad Wide Neighborhood B. Kheirfam, M. Chitsaz / Filomat 3:0 07, The cocept of the cetral path plays a critical role i the developmet of IPMs. Kojima et al. [4] first proved the existece ad uiqueess of the cetral path for P κ-lcp. Throughout the paper, we assume that P κ-lcp satisfies the iterior-poit coditio IPC, i.e., there exists a pair x 0, s 0 > 0 such that s 0 = Mx 0 + q, which implies the existece of a solutio for P κ-lcp [4]. The set of feasible iterior poits is deoted by F 0 := { x, s R : s = Mx + q, x, s > 0 }. The basic idea of IPMs is to replace the secod equatio i, the so-called complemetarity coditio for P κ-lcp, by the relaxed equatio xs = µe, with µ > 0. Thus, we cosider the system Mx + s = q, xs = µe, x, s 0. Sice M is a P κ-matrix ad the IPC holds, the system has a uique solutio for each µ > 0 cf. Lemma 4.3 i [4]. This solutio is deoted as xµ, sµ ad is called the µ-ceter of P κ-lcp. The set of µ-ceters with all µ > 0 gives the cetral path of P κ-lcp, i.e., C := { x, s F 0 : xs = µe }. It has bee show that the limit of the cetral path as µ goes to zero exists ad yields a solutio for P κ-lcp Theorem 4.4 i [4]. Applyig Newto s method to for a give feasible poit x, s gives the followig liear system of equatios M x s = 0, x s + s x = µe xs. 3 Sice M is P κ-matrix, the system 3 uiquely defies x, s for ay x > 0 ad s > 0. At each iteratio, the method would choose a target o the cetral path ad apply the Newto method to move closer to the target, while cofiig the iterate to stay withi a certai eighborhood of the cetral path. As usual accordig, a eighborhood of the cetral path, the so-called small eighborhood, is defied as N β := { x, s F 0 : xs µe βµ }, where β 0, is a give costat ad µ = xt s. Alteratively, the so-called wide eighborhood is defied as follows: N α := { x, s F 0 : xs αµe }, where 0 < α <. I this paper, we will work with the followig eighborhood cosidered i []: Ñ τ α = { x, s F 0 : xs τµe ατµ }. 4 It is clear that xs τµe = 0, for all x, s N τ, ad that for ay x, s Ñ τ α we have xs τµe ατµ ad x i s i τµ, which imply Therefore, 0 x is i τµ α, ad or equivaletly x is i ατµ. 5 N τ Ñ τ α N ατ α, τ 0,. 6 Sice N τ is a wide eighborhood, so is Ñ τ α. We ote that a iterior poit method from [, 6] use the eighborhood Ñ τ α oly for α 0, ], while i this paper we will costruct a iterior poit method based o the eighborhood Ñ τ α for ay value of α 0,.
4 3. A Large Update Path Followig Algorithm B. Kheirfam, M. Chitsaz / Filomat 3:0 07, I this sectio, we preset a large update path followig method for solvig P k-lcp. Our algorithm geeralizes the large update path followig method proposed i [6] for P k-lcp. Similar to Ai ad Zhag [] ad Liu et al. [6], we decompose the Newto directio 3, from xs to the target o the cetral path τµe large update, ito two separate parts accordig to the positive ad egative parts of τµe xs. The, we solve the followig two systems: ad M x s = 0, s x + x s = τµe xs, M x + s + = 0, s x + + x s + = τµe xs +. 7 Based o the directio from 7, we compute the corrector directio by M x c sc = 0, s x c + x sc = x s. 9 Fially, the ew iterate is give by xθ, sθ := x, s + xθ, sθ := x, s + θ x, s + θ x +, s + + θ xc, s c, 0 where θ = θ, θ, 0 θ, θ is the step legth vector. To get the best step legth for three of the directios, we expect to solve the followig subproblem mi θ [0,] [0,] s.t. µθ xθ, sθ Ñ τ α. We are ow i the positio to describe our secod-order corrector algorithm for P k-lcps. Secod Order Corrector Al orithm Iput : accuracy parameter ɛ > 0; eighborhood parameter α, 0 < α < ; ceterig parameter τ, 0 < τ 0.5; a iitial poit x, s Ñ τ α, µ 0 = x 0 T s 0 /; set k := 0. begi while x k T s k > ɛ do compute the directios x k, sk by 7 ad xk +, sk + by. compute the directios x c,k, sc,k by 9. Fid a step legth vector θ k = θ k, θk givig a sufficiret reductio of µ k ad assurig xθ k, sθ k Ñ τ α. let x k+, s k+ := xθ k, sθ k, µ k+ = x k+ T s k+ /. set k := k +. ed Figure : The algorithm Here, we give two techical lemmas that will be used durig the aalysis. Their proofs are the same to the proofs of the lemmas 3. ad 3.4 i [6].
5 B. Kheirfam, M. Chitsaz / Filomat 3:0 07, Lemma 3.. Let x, s F 0, x, s be the solutio of 7. Note I + = {i I : x i s i > 0} ad I = I\I + The x i s i x is i 4, i I +. Lemma 3.. Suppose that x, s F 0 ad a + xs 0. Let u, v be the solutio of Mu v = 0, su + xv = a. If x + t 0 us + t 0 v > 0 for some 0 < t 0, the x + tus + tv > 0 for all 0 t t 0. It is easy to verify that xθ, sθ as defied i 0 satisfies the followig system: M xθ sθ = 0, s xθ + x sθ = θ τµe xs + θ τµe xs + θ x s. The term a + xs is sometimes called the target to be tracked, ad it is aturally oegative for most IPMs. I particular, for Algorithm i Fig., this property is give i the ext lemma. Lemma 3.3. Let x, s Ñ τ α ad let xθ, sθ be defied by 0. The xθ, sθ Ñ τ α if ad oly if µθ = xθt sθ > 0 ad xθsθ τµθe ατµθ. Proof. Let us assume that µθ > 0 ad xθsθ τµθe ατµθ. Sice M xθ sθ = 0, we obtai sθ = Mxθ + q. I order to complete the proof of lemma, it suffices to show that xθ > 0 ad sθ > 0. From 5 we deduce that xθsθ > 0. Accordig to Lemma 3., it is sufficiet to prove that s xθ + x sθ + xs 0. From 3 it follows that the left-had side of this iequality is equal to xs + θ τµe xs + θ τµe xs + θ x s. 4 We cosider the followig cases: Case : Let i I. I this case, either x i s i τµ or x i s i τµ, the relatio 4 becomes positive. Case : Let i I + ad x i s i τµ. I this case, the ith compoet of 4 becomes x i s i + θ τµ x i s i θ x i s i θ θ xi s i + θ τµ > 0. 4 Case 3: Let i I + ad x i s i τµ. I this case the ith compoet of 4 reduces to x i s i + θ τµ x i s i θ x i s i θ θ xi s i + θ τµ > 0. 4 Note that i case ad case 3 the first iequalities follow by Lemma 3.. These complete the proof. It follows that the optimizatio problem is equivalet to mi θ [0,] [0,] µθ s.t. µθ > 0, xθsθ τµθe ατµθ. If θ + = θ +, θ+ is the solutio of the above miimizatio problem, the accordig to lemma 3.3 the poit xθ +, sθ + belogs to the wide eighborhood Ñ τ α ad the process ca be repeated. Lemma 3.4. cf. Lemma i [3] If LCP is P k, the for ay x, s R ++ ad ay a R the liear system has a uique solutio u, v for which the followig estimates hold uv + κ ã, κ ã ut v 4 ã, where ã = xs / a. 3 5
6 B. Kheirfam, M. Chitsaz / Filomat 3:0 07, Lemma 3.5. The solutios of 7 ad 3 satisfy the followig iequalities: x s + κ µ, κµ x T s µ 4, 6 xθ sθ µ + κ θ + θ α τ α + θ + κ, 7 ατ xθ T sθ κµ θ + θ α τ α + θ ατ + κ, xθ T sθ µ 4 θ + θ α τ α + θ ατ + κ. 9 Proof. For ay x, s R++ there holds xs / τµe xs = xs / xs τµe + xs/ = µ. By cosiderig u, v = x, s ad a = τµe xs i system, usig Lemma 3.4 ad the above iequality, we obtai ad x s + κ xs / τµe xs + κ µ, κµ κ xs / τµe xs xt s 4 xs / τµe xs µ 4. The above iequalities prove 6. If x, s Ñ τ α, the accordig to 5 we ca write xs / τµe xs + τµe xs+ ατµ τµα α. Therefore, usig the orthogoality of τµe xs ad τµe xs + we have xs / θ τµe xs + θ τµe xs + = θ xs / τµe xs xs / τµe xs + µθ + τµα θ α. Further, from 5 ad 6 we get + θ xs / x s x s ατµ µ + κ. ατµ Now, comparig system with the system 3 ad cosiderig u, v = xθ, sθ ad a = θ τµe xs + θ τµe xs + θ x s, we have ã = xs / θ τµe xs + θ τµe xs + θ x s xs / θ τµe xs + θ τµe xs + + θ xs / x s θ + τα θ α + θ ατ + κ µ. 0
7 B. Kheirfam, M. Chitsaz / Filomat 3:0 07, The iequalities 7, ad 9 ca be derived from 0 ad Lemma 3.4. complete. I the sequel, we deote The proof of lemma is ψθ := ψθ, θ := θ + τα θ α + θ ατ + κ. I the ext lemma we give upper ad lower bouds for µθ. We first ote that, from 0 ad the secod equatio of 3, we have Moreover, Sice xθsθ = x + xθs + sθ = xs + s xθ + x sθ + xθ sθ µθ = xθt sθ = xs + θ τµe xs + θ τµe xs + θ x s + xθ sθ. = et xθsθ = µ + θ e T τµe xs + θ e T τµe xs + θ x T s + xθt sθ. 3 τµ = e T xs τµe = e T xs τµe + + e T xs τµe, 4 by applyig the Cauchy-Schwartz iequality ad the defiitio of the eighborhood Ñ τ α, we get e T xs τµe xs τµe ταµ. 5 It follows from 4 ad 5 that τµ e T xs τµe + τ + τα µ. 6 Lemma 3.6. For ay x, s Ñ τ α ad θ = θ, θ with 0 θ θ, we have µθ τ + τα θ + ταθ + κθ + ψθ µ, 7 4 µθ θ τ 4 θ κψθ µ. Proof. By usig 3, the equality τµe xs = xs τµe +, 4, 5 ad 6 we obtai e T xs τµe + e T xs τµe µθ = µ θ θ τµ e T xs τµe = µ θ θ x T s + xθt sθ e T xs τµe θ θ x T s = µ θ τµ θ θ et xs τµe θ µ θ τµ + θ θ ταµ θ x T s + xθt sθ x T s + xθt sθ = µ θ τ + τα ταµ µ + θ θ x T s + xθt sθ τ + τα θ + ταθ + κθ + ψθ µ, 4 + xθt sθ 9
8 B. Kheirfam, M. Chitsaz / Filomat 3:0 07, where the last iequality derives from 6 ad 9, which proves the iequality 7. Similarly, we get µθ = µ θ τµ θ θ et xs τµe θ x T s + xθt sθ µ θ τµ θ x T s + xθt sθ θ τ 4 θ κψθ µ, where the last iequality holds due to 6 ad. This completes the proof of. To follow the cetral path, we eed to make sure that the iterates remai i the prescribed eighborhood of the cetral path. So i the ext lemma we give a upper boud for -orm of xθsθ τµθe. Lemma 3.7. For ay x, s Ñ τ α ad θ = θ, θ with we have ταθ τ + ατ θ θ, 30 xθsθ τµθe θ τα + θ + κ + + κ ψθ µ. Proof. By subtractig ad addig τµe to the right-had side of we obtai xθsθ = τµe + xs τµe θ xs τµe + θ xs τµe θ x s + xθ sθ = τµe + θ xs τµe + + θ xs τµe θ x s + xθ sθ. From the above equality ad 9 we deduce that xθsθ τµθe = θ xs τµe + + θ xs τµe + τθ e T xs τµe + + xθ sθ + τθ O the other had, by 4, 5 ad 30, we have e T xs τµe e + τθ e θ x s x T s e τ xθt sθ e. θ e T xs τµe + + θ e T xs τµe e T xs τµe = θ + θ θ et xs τµe τµθ θ θ ταµ = τ + τα µθ ταµ θ 0. Therefore, we obtai the followig iequality τ x xθsθ τµθe θ xs τµe + θ T s τ xθ T sθ e x s + xθ sθ e,
9 B. Kheirfam, M. Chitsaz / Filomat 3:0 07, which implies, by v u v u ad u u, xθsθ τµθe θ xs τµe + θ x s τ xt s e + xθ sθ τ xθt sθ e θ ταµ + θ x s + xθ sθ θ τα + θ + κ + + κ ψθ µ, where the last iequality follows from 6 ad 7, ad the proof of lemma is complete. Lemma 3.. If 0 < τ, the the poit xθ, sθ defied i 0 belogs to Ñ τ α for ay θ = θ, θ satisfyig ταθ θ = τ,, 0 < θ θ α τ 4 := + 5 κ κ. 3 Proof. We first ote that the first equatio i 3 implies that τθ = ταθ. 3 Now, by usig ad the first equatio of 3, we obtai ψθ α τ + α α + α α τ + κ τθ α + κ α α + α τ = + α τ α τ τ α α + α τ + α + κ = α τ τθ τθ τα + + κ θ α τ 4, 33 where the last iequality follows from τ < ad α α. It follows from ad 33 that µθ µ θ τ κτα + + κ θ 4 θ α τ 4 + κτα + κ θ 4 α τ 4 4 κτα 5 κ + 4 κ 4 5 > 0, κ + 4
10 B. Kheirfam, M. Chitsaz / Filomat 3:0 07, where the secod iequality follows from the iequality of 3 ad θ ad the third iequality follows from 3. Now, by usig Lemma 3.7, 33 ad we deduce that xθsθ τµθ ταµθ = θ τα + θ + κ + + κ θ τα + + κ θ α τ 4 τα θ τ 4 θ κ α τ 4 + κ + τα τα + + κ θ + + κ + τακ 4 α τ κ τ κ α τ 4 θ + 5 κ κ 4 τ + θ α τ 4 α τ κ + τα + ταθ µ ταθ µ < 0, µ τα + + κ θ µ θ τθ τα µ τα ταθ µ τα ταθ µ where the secod iequality follows from the first equatio of 3 ad the followig iequalities + κ + τα κ + + 6, + κ + τακ 5 4 κ Thus uder the hypothesis of our lemma, we showed that xθsθ τµθe ατµθ ad µθ > 0. This completes the proof of lemma accordig to Lemma 3.3. I the remider of this paper, we will use the otatios α τ θ τα θ := + 5 κ κ, θ := τ, θ := θ, θ. 34 Theorem 3.9. If LCP is P κ, the the Algorithm is well defied, produces a sequece of poits x k, s k belogig to the eighborhood Ñ τ α, ad cα, τ µ k+ 5 κ κ µ k, k = 0,,... 35
11 B. Kheirfam, M. Chitsaz / Filomat 3:0 07, where cα, τ = τα α τ 4. 4 Proof. The first part of the theorem follows from the defiitio of Algorithm ad Lemma 3.. Let us deote φθ = φθ, θ = + τ + τα θ + ταθ τα + κ θ + κθ +, 4 α τ 4 so that accordig to 7 we have µθ φθµ. It is easy to verify that ταθ φ τ, θ = τ + τα ταθ τ + ταθ + ταθ + ταθ κ + τ + ταθ τα With the otatio from 34, it follows that µθ + µ θ κ τ + κ τ κ 4 α τ κ 4 α τ κ 4 α τ 4 ταθ ταθ ταθ κ τα α τ τα 5 κ κ ταθ ταθ = cα, τ 5 κ κ µ. ταθ τα 4 5 κ + 4 ταθ This completes the proof. Corollary 3.0. Uder the hypothesis of Theorem 3.9, Algorithm produces a poit x, s Ñ τ α with µx, s ɛ i at most O + κ 3 L iteratios, where L = L ɛ = log µx 0, s 0. ɛ 4. Numerical Results I this sectio, we preset some umerical results for the test problems LCP, i order to get a feel of how the algorithm might perform i practice. Numerical results were obtaied by usig MATLAB R009a, versio , o a 3-bit system. We choose the parameters α = 0.5 ad τ = Furthermore, we
12 B. Kheirfam, M. Chitsaz / Filomat 3:0 07, take q = e Me to obtai a LCP problem with the startig iterior poit x 0, s 0 = e, e. The algorithm termiates if the relative duality gap Relgap satisfies x T s + x 0 T s 0 0. The set of testig LCP problems are geerated as follows. After oe iputs ay positive iteger, MATLAB geerates a matrix A = rad radomly. The, we take M = A T A ad q = e Me. The umerical results preseted i Table. To test the ifluece from the skewess of matrix M, we also test the LCPs geerated as follows: A = rad, B = rad, M = A T A + B B T ad q = e Me. The umerical results of this set of problems are showed i Table. It turs out that the umber of iteratios Iter. ad CPU time secods is better tha those required whe M is purely positive semidefiite. Our prelimiary implemetatios show that this algorithm is promisig. Table Iter. CPU Relgap E E E E E E E E E- Table Iter. CPU Relgap E E E E E E E E E- 5. Coclusio I this paper, we have exteded the recetly proposed secod-order corrector iterior-poit algorithm of Liu et al. for LP to P κ-lcp ad derived the iteratio boud for the algorithm, amely, O + κ 3 log x0 T s 0. Moreover, we use the eighborhood ɛ Ñ τ α for ay value of α 0,, while i [6] this eighborhood has bee used oly for α 0,. Our algorithm does ot use explicitly the hadicap κ of the problem, ad it ca solve ay LCPs. Furthermore, our prelimiary umerical experimets show that the ew algorithm may also perform well i practice. Refereces [] W. Ai, S. Zhag, A O L iteratio primal-dual path-followig method, based o wide eighborhoods ad large updates, for mootoe LCP, SAIM J. Optim , [] S.C. Bullups, K.G. Murty, Complemetarity problems, J. Comput. Appl. Math , [3] F. Gurtua, C. Petra, F.A. Potra, O. Shevcheko, A. Vacea, Corrector-predictor methods for sufficiet liear complemetarity problems, Comput. Optim. Appl. 4 0, [4] M. Kojima, N. Megiddo, T. Noma, A. Yoshise, A Uified Approach to Iterior Poit Algorithms for Liear Complemetarity Problems, Lecture Notes i Comput. Sci. 53, Spriger-Verlag, Berli 99. [5] M. Kojima, S. Mizuo, A. Yoshise, A primal-dual iterior poit for liear programmig, I: Megiddo, N. ed. Progress i Mathmatical Programmig: Iterior Poit ad Related Methods., pp Spriger, New York 99. [6] C. Liu, H. Liu, A O L iteratio primal-dual secod-order corrector algorithm for liear programmig, Optim. Lett. 5 0, [7] C. Liu, H. Liu, A ew secod order corrector iterior-poit algorithm for semidefiite programmig, Math. Meth. Oper. Res. 75 0, [] X. Liu, F.A. Potra, Corrector-predictor methods for sufficiet liear complemetarity problems i a wide eighborhood of the cetral path, SIAM J. Optim , [9] J.A. Miao, Quadratically coverget Oκ + L iteratio algorithm for the P κ-matrix liear complemetarity problem, Math. Program , [0] S. Mizuo, M.J. Todd, Y. Ye, O adaptive-step primal-dual iterior poit algorithms for liear programmig, Math. Oper. Res ,
13 B. Kheirfam, M. Chitsaz / Filomat 3:0 07, [] F.A. Potra, Iterior poit methods for sufficiet horozatal LCP i a wide eighborhood of the cetral path with best kow iteratio complexity, SIAM J. Optim. 4 04,. [] F.A. Potra, X. Liu, Predictor-corrector methods for sufficiet liear complemetarity problems i a wide eighborhood of the cetral path, Optim. Methods Softw , [3] F.A. Potra, R. Sheg, A large-step ifeasible- iterior-poit method for the P -matrix LCP, SIAM J. Optim , [4] U. Schäfer, A liear complemetarity problem with a P-matrix, SAIM Rev , 9 0. [5] J. Stoer, M. Wechs, S., Mizuo, High order ifeasible iterior-poit methods for solvig sufficiet liear complemetarity problems, Math. OPer. Res. 3 99, 3 6. [6] J. Stoer, M. Wechs, Ifeasible-iterior-poit paths for sufficiet liear complemetarity problems ad their aalyticity, Math. Program. 3 99, [7] Y. Ye, O. Güler, R.A. Tapia, Y. Zhag, A quadratically coverget O L-iteratio algorithm for liear programmig, Math. Program , 5 6.
The Limit of a Sequence (Brief Summary) 1
The Limit of a Sequece (Brief Summary). Defiitio. A real umber L is a it of a sequece of real umbers if every ope iterval cotaiig L cotais all but a fiite umber of terms of the sequece. 2. Claim. A sequece
More informationSequences and Series
Sequeces ad Series Matt Rosezweig Cotets Sequeces ad Series. Sequeces.................................................. Series....................................................3 Rudi Chapter 3 Exercises........................................
More informationMath 312, Intro. to Real Analysis: Homework #4 Solutions
Math 3, Itro. to Real Aalysis: Homework #4 Solutios Stephe G. Simpso Moday, March, 009 The assigmet cosists of Exercises 0.6, 0.8, 0.0,.,.3,.6,.0,.,. i the Ross textbook. Each problem couts 0 poits. 0.6.
More informationA New Constructive Proof of Graham's Theorem and More New Classes of Functionally Complete Functions
A New Costructive Proof of Graham's Theorem ad More New Classes of Fuctioally Complete Fuctios Azhou Yag, Ph.D. Zhu-qi Lu, Ph.D. Abstract A -valued two-variable truth fuctio is called fuctioally complete,
More informationSUPPLEMENTAL MATERIAL
A SULEMENTAL MATERIAL Theorem (Expert pseudo-regret upper boud. Let us cosider a istace of the I-SG problem ad apply the FL algorithm, where each possible profile A is a expert ad receives, at roud, a
More information5. Best Unbiased Estimators
Best Ubiased Estimators http://www.math.uah.edu/stat/poit/ubiased.xhtml 1 of 7 7/16/2009 6:13 AM Virtual Laboratories > 7. Poit Estimatio > 1 2 3 4 5 6 5. Best Ubiased Estimators Basic Theory Cosider agai
More informationRafa l Kulik and Marc Raimondo. University of Ottawa and University of Sydney. Supplementary material
Statistica Siica 009: Supplemet 1 L p -WAVELET REGRESSION WITH CORRELATED ERRORS AND INVERSE PROBLEMS Rafa l Kulik ad Marc Raimodo Uiversity of Ottawa ad Uiversity of Sydey Supplemetary material This ote
More informationA DOUBLE INCREMENTAL AGGREGATED GRADIENT METHOD WITH LINEAR CONVERGENCE RATE FOR LARGE-SCALE OPTIMIZATION
A DOUBLE INCREMENTAL AGGREGATED GRADIENT METHOD WITH LINEAR CONVERGENCE RATE FOR LARGE-SCALE OPTIMIZATION Arya Mokhtari, Mert Gürbüzbalaba, ad Alejadro Ribeiro Departmet of Electrical ad Systems Egieerig,
More informationHopscotch and Explicit difference method for solving Black-Scholes PDE
Mälardale iversity Fiacial Egieerig Program Aalytical Fiace Semiar Report Hopscotch ad Explicit differece method for solvig Blac-Scholes PDE Istructor: Ja Röma Team members: A Gog HaiLog Zhao Hog Cui 0
More informationNORMALIZATION OF BEURLING GENERALIZED PRIMES WITH RIEMANN HYPOTHESIS
Aales Uiv. Sci. Budapest., Sect. Comp. 39 2013) 459 469 NORMALIZATION OF BEURLING GENERALIZED PRIMES WITH RIEMANN HYPOTHESIS We-Bi Zhag Chug Ma Pig) Guagzhou, People s Republic of Chia) Dedicated to Professor
More informationA New Approach to Obtain an Optimal Solution for the Assignment Problem
Iteratioal Joural of Sciece ad Research (IJSR) ISSN (Olie): 231-7064 Idex Copericus Value (2013): 6.14 Impact Factor (2015): 6.31 A New Approach to Obtai a Optimal Solutio for the Assigmet Problem A. Seethalakshmy
More informationNeighboring Optimal Solution for Fuzzy Travelling Salesman Problem
Iteratioal Joural of Egieerig Research ad Geeral Sciece Volume 2, Issue 4, Jue-July, 2014 Neighborig Optimal Solutio for Fuzzy Travellig Salesma Problem D. Stephe Digar 1, K. Thiripura Sudari 2 1 Research
More informationLecture 9: The law of large numbers and central limit theorem
Lecture 9: The law of large umbers ad cetral limit theorem Theorem.4 Let X,X 2,... be idepedet radom variables with fiite expectatios. (i) (The SLLN). If there is a costat p [,2] such that E X i p i i=
More informationAn Empirical Study of the Behaviour of the Sample Kurtosis in Samples from Symmetric Stable Distributions
A Empirical Study of the Behaviour of the Sample Kurtosis i Samples from Symmetric Stable Distributios J. Marti va Zyl Departmet of Actuarial Sciece ad Mathematical Statistics, Uiversity of the Free State,
More informationEXERCISE - BINOMIAL THEOREM
BINOMIAL THOEREM / EXERCISE - BINOMIAL THEOREM LEVEL I SUBJECTIVE QUESTIONS. Expad the followig expressios ad fid the umber of term i the expasio of the expressios. (a) (x + y) 99 (b) ( + a) 9 + ( a) 9
More informationStatistics for Economics & Business
Statistics for Ecoomics & Busiess Cofidece Iterval Estimatio Learig Objectives I this chapter, you lear: To costruct ad iterpret cofidece iterval estimates for the mea ad the proportio How to determie
More informationCombining imperfect data, and an introduction to data assimilation Ross Bannister, NCEO, September 2010
Combiig imperfect data, ad a itroductio to data assimilatio Ross Baister, NCEO, September 00 rbaister@readigacuk The probability desity fuctio (PDF prob that x lies betwee x ad x + dx p (x restrictio o
More informationECON 5350 Class Notes Maximum Likelihood Estimation
ECON 5350 Class Notes Maximum Likelihood Estimatio 1 Maximum Likelihood Estimatio Example #1. Cosider the radom sample {X 1 = 0.5, X 2 = 2.0, X 3 = 10.0, X 4 = 1.5, X 5 = 7.0} geerated from a expoetial
More information1 Estimating sensitivities
Copyright c 27 by Karl Sigma 1 Estimatig sesitivities Whe estimatig the Greeks, such as the, the geeral problem ivolves a radom variable Y = Y (α) (such as a discouted payoff) that depeds o a parameter
More informationEstimating Proportions with Confidence
Aoucemets: Discussio today is review for midterm, o credit. You may atted more tha oe discussio sectio. Brig sheets of otes ad calculator to midterm. We will provide Scatro form. Homework: (Due Wed Chapter
More informationx satisfying all regularity conditions. Then
AMS570.01 Practice Midterm Exam Sprig, 018 Name: ID: Sigature: Istructio: This is a close book exam. You are allowed oe-page 8x11 formula sheet (-sided). No cellphoe or calculator or computer is allowed.
More informationLimits of sequences. Contents 1. Introduction 2 2. Some notation for sequences The behaviour of infinite sequences 3
Limits of sequeces I this uit, we recall what is meat by a simple sequece, ad itroduce ifiite sequeces. We explai what it meas for two sequeces to be the same, ad what is meat by the -th term of a sequece.
More informationSolutions to Problem Sheet 1
Solutios to Problem Sheet ) Use Theorem.4 to prove that p log for all real x 3. This is a versio of Theorem.4 with the iteger N replaced by the real x. Hit Give x 3 let N = [x], the largest iteger x. The,
More informationEconomic Computation and Economic Cybernetics Studies and Research, Issue 2/2016, Vol. 50
Ecoomic Computatio ad Ecoomic Cyberetics Studies ad Research, Issue 2/216, Vol. 5 Kyoug-Sook Moo Departmet of Mathematical Fiace Gacho Uiversity, Gyeoggi-Do, Korea Yuu Jeog Departmet of Mathematics Korea
More informationSELECTING THE NUMBER OF CHANGE-POINTS IN SEGMENTED LINE REGRESSION
1 SELECTING THE NUMBER OF CHANGE-POINTS IN SEGMENTED LINE REGRESSION Hyue-Ju Kim 1,, Bibig Yu 2, ad Eric J. Feuer 3 1 Syracuse Uiversity, 2 Natioal Istitute of Agig, ad 3 Natioal Cacer Istitute Supplemetary
More informationTopic-7. Large Sample Estimation
Topic-7 Large Sample Estimatio TYPES OF INFERENCE Ò Estimatio: É Estimatig or predictig the value of the parameter É What is (are) the most likely values of m or p? Ò Hypothesis Testig: É Decidig about
More informationpoint estimator a random variable (like P or X) whose values are used to estimate a population parameter
Estimatio We have oted that the pollig problem which attempts to estimate the proportio p of Successes i some populatio ad the measuremet problem which attempts to estimate the mea value µ of some quatity
More informationGame Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012
Game Theory Lecture Notes By Y. Narahari Departmet of Computer Sciece ad Automatio Idia Istitute of Sciece Bagalore, Idia July 01 Chapter 4: Domiat Strategy Equilibria Note: This is a oly a draft versio,
More information1 Random Variables and Key Statistics
Review of Statistics 1 Radom Variables ad Key Statistics Radom Variable: A radom variable is a variable that takes o differet umerical values from a sample space determied by chace (probability distributio,
More informationChapter 8: Estimation of Mean & Proportion. Introduction
Chapter 8: Estimatio of Mea & Proportio 8.1 Estimatio, Poit Estimate, ad Iterval Estimate 8.2 Estimatio of a Populatio Mea: σ Kow 8.3 Estimatio of a Populatio Mea: σ Not Kow 8.4 Estimatio of a Populatio
More informationA random variable is a variable whose value is a numerical outcome of a random phenomenon.
The Practice of Statistics, d ed ates, Moore, ad Stares Itroductio We are ofte more iterested i the umber of times a give outcome ca occur tha i the possible outcomes themselves For example, if we toss
More informationMaximum Empirical Likelihood Estimation (MELE)
Maximum Empirical Likelihood Estimatio (MELE Natha Smooha Abstract Estimatio of Stadard Liear Model - Maximum Empirical Likelihood Estimator: Combiatio of the idea of imum likelihood method of momets,
More informationThe Valuation of the Catastrophe Equity Puts with Jump Risks
The Valuatio of the Catastrophe Equity Puts with Jump Risks Shih-Kuei Li Natioal Uiversity of Kaohsiug Joit work with Chia-Chie Chag Outlie Catastrophe Isurace Products Literatures ad Motivatios Jump Risk
More information43. A 000 par value 5-year bod with 8.0% semiaual coupos was bought to yield 7.5% covertible semiaually. Determie the amout of premium amortized i the 6 th coupo paymet. (A).00 (B).08 (C).5 (D).5 (E).34
More information18.S096 Problem Set 5 Fall 2013 Volatility Modeling Due Date: 10/29/2013
18.S096 Problem Set 5 Fall 2013 Volatility Modelig Due Date: 10/29/2013 1. Sample Estimators of Diffusio Process Volatility ad Drift Let {X t } be the price of a fiacial security that follows a geometric
More informationIntroduction to Probability and Statistics Chapter 7
Itroductio to Probability ad Statistics Chapter 7 Ammar M. Sarha, asarha@mathstat.dal.ca Departmet of Mathematics ad Statistics, Dalhousie Uiversity Fall Semester 008 Chapter 7 Statistical Itervals Based
More informationMinhyun Yoo, Darae Jeong, Seungsuk Seo, and Junseok Kim
Hoam Mathematical J. 37 (15), No. 4, pp. 441 455 http://dx.doi.org/1.5831/hmj.15.37.4.441 A COMPARISON STUDY OF EXPLICIT AND IMPLICIT NUMERICAL METHODS FOR THE EQUITY-LINKED SECURITIES Mihyu Yoo, Darae
More informationAUTOMATIC GENERATION OF FUZZY PAYOFF MATRIX IN GAME THEORY
AUTOMATIC GENERATION OF FUZZY PAYOFF MATRIX IN GAME THEORY Dr. Farha I. D. Al Ai * ad Dr. Muhaed Alfarras ** * College of Egieerig ** College of Coputer Egieerig ad scieces Gulf Uiversity * Dr.farha@gulfuiversity.et;
More information14.30 Introduction to Statistical Methods in Economics Spring 2009
MIT OpeCourseWare http://ocwmitedu 430 Itroductio to Statistical Methods i Ecoomics Sprig 009 For iformatio about citig these materials or our Terms of Use, visit: http://ocwmitedu/terms 430 Itroductio
More informationFINM6900 Finance Theory How Is Asymmetric Information Reflected in Asset Prices?
FINM6900 Fiace Theory How Is Asymmetric Iformatio Reflected i Asset Prices? February 3, 2012 Referece S. Grossma, O the Efficiecy of Competitive Stock Markets where Traders Have Diverse iformatio, Joural
More informationSummary. Recap. Last Lecture. .1 If you know MLE of θ, can you also know MLE of τ(θ) for any function τ?
Last Lecture Biostatistics 60 - Statistical Iferece Lecture Cramer-Rao Theorem Hyu Mi Kag February 9th, 03 If you kow MLE of, ca you also kow MLE of τ() for ay fuctio τ? What are plausible ways to compare
More informationFaster Alternating Direction Method of Multipliers with a Worst-case O(1/n 2 ) Convergence Rate
Faster Alteratig Directio Method of Multipliers with a Worst-case O1/ Covergece Rate WENYI TIAN XIAOMING YUAN July 17, 016 Abstract. The alteratig directio method of multipliers ADMM is beig widely used
More informationPolicy Improvement for Repeated Zero-Sum Games with Asymmetric Information
Policy Improvemet for Repeated Zero-Sum Games with Asymmetric Iformatio Malachi Joes ad Jeff S. Shamma Abstract I a repeated zero-sum game, two players repeatedly play the same zero-sum game over several
More informationResearch Article The Probability That a Measurement Falls within a Range of n Standard Deviations from an Estimate of the Mean
Iteratioal Scholarly Research Network ISRN Applied Mathematics Volume 0, Article ID 70806, 8 pages doi:0.540/0/70806 Research Article The Probability That a Measuremet Falls withi a Rage of Stadard Deviatios
More informationLecture 4: Parameter Estimation and Confidence Intervals. GENOME 560 Doug Fowler, GS
Lecture 4: Parameter Estimatio ad Cofidece Itervals GENOME 560 Doug Fowler, GS (dfowler@uw.edu) 1 Review: Probability Distributios Discrete: Biomial distributio Hypergeometric distributio Poisso distributio
More informationii. Interval estimation:
1 Types of estimatio: i. Poit estimatio: Example (1) Cosider the sample observatios 17,3,5,1,18,6,16,10 X 8 X i i1 8 17 3 5 118 6 16 10 8 116 8 14.5 14.5 is a poit estimate for usig the estimator X ad
More informationNotes on Expected Revenue from Auctions
Notes o Epected Reveue from Auctios Professor Bergstrom These otes spell out some of the mathematical details about first ad secod price sealed bid auctios that were discussed i Thursday s lecture You
More informationCAUCHY'S FORMULA AND EIGENVAULES (PRINCIPAL STRESSES) IN 3-D
GG303 Lecture 19 11/5/0 1 CAUCHY'S FRMULA AN EIGENVAULES (PRINCIPAL STRESSES) IN 3- I II Mai Topics A Cauchy s formula Pricipal stresses (eigevectors ad eigevalues) Cauchy's formula A Relates tractio vector
More informationOverlapping Generations
Eco. 53a all 996 C. Sims. troductio Overlappig Geeratios We wat to study how asset markets allow idividuals, motivated by the eed to provide icome for their retiremet years, to fiace capital accumulatio
More informationToday: Finish Chapter 9 (Sections 9.6 to 9.8 and 9.9 Lesson 3)
Today: Fiish Chapter 9 (Sectios 9.6 to 9.8 ad 9.9 Lesso 3) ANNOUNCEMENTS: Quiz #7 begis after class today, eds Moday at 3pm. Quiz #8 will begi ext Friday ad ed at 10am Moday (day of fial). There will be
More informationFOUNDATION ACTED COURSE (FAC)
FOUNDATION ACTED COURSE (FAC) What is the Foudatio ActEd Course (FAC)? FAC is desiged to help studets improve their mathematical skills i preparatio for the Core Techical subjects. It is a referece documet
More information5 Statistical Inference
5 Statistical Iferece 5.1 Trasitio from Probability Theory to Statistical Iferece 1. We have ow more or less fiished the probability sectio of the course - we ow tur attetio to statistical iferece. I statistical
More informationDepartment of Mathematics, S.R.K.R. Engineering College, Bhimavaram, A.P., India 2
Skewess Corrected Cotrol charts for two Iverted Models R. Subba Rao* 1, Pushpa Latha Mamidi 2, M.S. Ravi Kumar 3 1 Departmet of Mathematics, S.R.K.R. Egieerig College, Bhimavaram, A.P., Idia 2 Departmet
More informationChapter 5: Sequences and Series
Chapter 5: Sequeces ad Series 1. Sequeces 2. Arithmetic ad Geometric Sequeces 3. Summatio Notatio 4. Arithmetic Series 5. Geometric Series 6. Mortgage Paymets LESSON 1 SEQUENCES I Commo Core Algebra I,
More informationSubject CT1 Financial Mathematics Core Technical Syllabus
Subject CT1 Fiacial Mathematics Core Techical Syllabus for the 2018 exams 1 Jue 2017 Subject CT1 Fiacial Mathematics Core Techical Aim The aim of the Fiacial Mathematics subject is to provide a groudig
More informationr i = a i + b i f b i = Cov[r i, f] The only parameters to be estimated for this model are a i 's, b i 's, σe 2 i
The iformatio required by the mea-variace approach is substatial whe the umber of assets is large; there are mea values, variaces, ad )/2 covariaces - a total of 2 + )/2 parameters. Sigle-factor model:
More informationDESCRIPTION OF MATHEMATICAL MODELS USED IN RATING ACTIVITIES
July 2014, Frakfurt am Mai. DESCRIPTION OF MATHEMATICAL MODELS USED IN RATING ACTIVITIES This documet outlies priciples ad key assumptios uderlyig the ratig models ad methodologies of Ratig-Agetur Expert
More informationPositivity Preserving Schemes for Black-Scholes Equation
Research Joural of Fiace ad Accoutig IN -97 (Paper) IN -7 (Olie) Vol., No.7, 5 Positivity Preservig chemes for Black-choles Equatio Mohammad Mehdizadeh Khalsaraei (Correspodig author) Faculty of Mathematical
More informationINTERVAL GAMES. and player 2 selects 1, then player 2 would give player 1 a payoff of, 1) = 0.
INTERVAL GAMES ANTHONY MENDES Let I ad I 2 be itervals of real umbers. A iterval game is played i this way: player secretly selects x I ad player 2 secretly ad idepedetly selects y I 2. After x ad y are
More informationMoving frame and integrable system of the discrete centroaffine curves in R 3
Movig frame ad itegrable system of the discrete cetroaffie curves i R 3 Yu Yag, Yahua Yu Departmet of Mathematics, Northeaster Uiversity, Sheyag 0004, P R Chia arxiv:6006530v2 [mathdg] 27 Nov 206 Abstract
More informationSupersedes: 1.3 This procedure assumes that the minimal conditions for applying ISO 3301:1975 have been met, but additional criteria can be used.
Procedures Category: STATISTICAL METHODS Procedure: P-S-01 Page: 1 of 9 Paired Differece Experiet Procedure 1.0 Purpose 1.1 The purpose of this procedure is to provide istructios that ay be used for perforig
More informationMarking Estimation of Petri Nets based on Partial Observation
Markig Estimatio of Petri Nets based o Partial Observatio Alessadro Giua ( ), Jorge Júlvez ( ) 1, Carla Seatzu ( ) ( ) Dip. di Igegeria Elettrica ed Elettroica, Uiversità di Cagliari, Italy {giua,seatzu}@diee.uica.it
More informationBayes Estimator for Coefficient of Variation and Inverse Coefficient of Variation for the Normal Distribution
Iteratioal Joural of Statistics ad Systems ISSN 0973-675 Volume, Number 4 (07, pp. 7-73 Research Idia Publicatios http://www.ripublicatio.com Bayes Estimator for Coefficiet of Variatio ad Iverse Coefficiet
More informationInferential Statistics and Probability a Holistic Approach. Inference Process. Inference Process. Chapter 8 Slides. Maurice Geraghty,
Iferetial Statistics ad Probability a Holistic Approach Chapter 8 Poit Estimatio ad Cofidece Itervals This Course Material by Maurice Geraghty is licesed uder a Creative Commos Attributio-ShareAlike 4.0
More informationThe Time Value of Money in Financial Management
The Time Value of Moey i Fiacial Maagemet Muteau Irea Ovidius Uiversity of Costata irea.muteau@yahoo.com Bacula Mariaa Traia Theoretical High School, Costata baculamariaa@yahoo.com Abstract The Time Value
More informationThe material in this chapter is motivated by Experiment 9.
Chapter 5 Optimal Auctios The material i this chapter is motivated by Experimet 9. We wish to aalyze the decisio of a seller who sets a reserve price whe auctioig off a item to a group of bidders. We begi
More informationChapter 8. Confidence Interval Estimation. Copyright 2015, 2012, 2009 Pearson Education, Inc. Chapter 8, Slide 1
Chapter 8 Cofidece Iterval Estimatio Copyright 2015, 2012, 2009 Pearso Educatio, Ic. Chapter 8, Slide 1 Learig Objectives I this chapter, you lear: To costruct ad iterpret cofidece iterval estimates for
More informationWe learned: $100 cash today is preferred over $100 a year from now
Recap from Last Week Time Value of Moey We leared: $ cash today is preferred over $ a year from ow there is time value of moey i the form of willigess of baks, busiesses, ad people to pay iterest for its
More informationCAPITAL PROJECT SCREENING AND SELECTION
CAPITAL PROJECT SCREEIG AD SELECTIO Before studyig the three measures of ivestmet attractiveess, we will review a simple method that is commoly used to scree capital ivestmets. Oe of the primary cocers
More informationMonopoly vs. Competition in Light of Extraction Norms. Abstract
Moopoly vs. Competitio i Light of Extractio Norms By Arkadi Koziashvili, Shmuel Nitza ad Yossef Tobol Abstract This ote demostrates that whether the market is competitive or moopolistic eed ot be the result
More informationMODIFICATION OF HOLT S MODEL EXEMPLIFIED BY THE TRANSPORT OF GOODS BY INLAND WATERWAYS TRANSPORT
The publicatio appeared i Szoste R.: Modificatio of Holt s model exemplified by the trasport of goods by ilad waterways trasport, Publishig House of Rzeszow Uiversity of Techology No. 85, Maagemet ad Maretig
More informationCHAPTER 8 Estimating with Confidence
CHAPTER 8 Estimatig with Cofidece 8.2 Estimatig a Populatio Proportio The Practice of Statistics, 5th Editio Stares, Tabor, Yates, Moore Bedford Freema Worth Publishers Estimatig a Populatio Proportio
More informationThis article is part of a series providing
feature Bryce Millard ad Adrew Machi Characteristics of public sector workers SUMMARY This article presets aalysis of public sector employmet, ad makes comparisos with the private sector, usig data from
More informationSubject CT5 Contingencies Core Technical. Syllabus. for the 2011 Examinations. The Faculty of Actuaries and Institute of Actuaries.
Subject CT5 Cotigecies Core Techical Syllabus for the 2011 Examiatios 1 Jue 2010 The Faculty of Actuaries ad Istitute of Actuaries Aim The aim of the Cotigecies subject is to provide a groudig i the mathematical
More informationMixed and Implicit Schemes Implicit Schemes. Exercise: Verify that ρ is unimodular: ρ = 1.
Mixed ad Implicit Schemes 3..4 The leapfrog scheme is stable for the oscillatio equatio ad ustable for the frictio equatio. The Euler forward scheme is stable for the frictio equatio but ustable for the
More informationCalculation of the Annual Equivalent Rate (AER)
Appedix to Code of Coduct for the Advertisig of Iterest Bearig Accouts. (31/1/0) Calculatio of the Aual Equivalet Rate (AER) a) The most geeral case of the calculatio is the rate of iterest which, if applied
More information1 The Power of Compounding
1 The Power of Compoudig 1.1 Simple vs Compoud Iterest You deposit $1,000 i a bak that pays 5% iterest each year. At the ed of the year you will have eared $50. The bak seds you a check for $50 dollars.
More informationStandard Deviations for Normal Sampling Distributions are: For proportions For means _
Sectio 9.2 Cofidece Itervals for Proportios We will lear to use a sample to say somethig about the world at large. This process (statistical iferece) is based o our uderstadig of samplig models, ad will
More informationCHAPTER 2 PRICING OF BONDS
CHAPTER 2 PRICING OF BONDS CHAPTER SUARY This chapter will focus o the time value of moey ad how to calculate the price of a bod. Whe pricig a bod it is ecessary to estimate the expected cash flows ad
More informationMath 124: Lecture for Week 10 of 17
What we will do toight 1 Lecture for of 17 David Meredith Departmet of Mathematics Sa Fracisco State Uiversity 2 3 4 April 8, 2008 5 6 II Take the midterm. At the ed aswer the followig questio: To be revealed
More informationUnbiased estimators Estimators
19 Ubiased estimators I Chapter 17 we saw that a dataset ca be modeled as a realizatio of a radom sample from a probability distributio ad that quatities of iterest correspod to features of the model distributio.
More informationad covexity Defie Macaulay duratio D Mod = r 1 = ( CF i i k (1 + r k) i ) (1.) (1 + r k) C = ( r ) = 1 ( CF i i(i + 1) (1 + r k) i+ k ) ( ( i k ) CF i
Fixed Icome Basics Cotets Duratio ad Covexity Bod Duratios ar Rate, Spot Rate, ad Forward Rate Flat Forward Iterpolatio Forward rice/yield, Carry, Roll-Dow Example Duratio ad Covexity For a series of cash
More informationLET G = (V (G), E(G)) be a graph with vertex
O Maximal Icidece Eergy of Graphs with Give Coectivity Qu Liu a,b Abstract Let G be a graph of order. The icidece eergy IE(G) of graph G, IE for short, is defied as the sum of all sigular values of its
More informationMonetary Economics: Problem Set #5 Solutions
Moetary Ecoomics oblem Set #5 Moetary Ecoomics: oblem Set #5 Solutios This problem set is marked out of 1 poits. The weight give to each part is idicated below. Please cotact me asap if you have ay questios.
More informationRandom Sequences Using the Divisor Pairs Function
Radom Sequeces Usig the Divisor Pairs Fuctio Subhash Kak Abstract. This paper ivestigates the radomess properties of a fuctio of the divisor pairs of a atural umber. This fuctio, the atecedets of which
More informationWhen you click on Unit V in your course, you will see a TO DO LIST to assist you in starting your course.
UNIT V STUDY GUIDE Percet Notatio Course Learig Outcomes for Uit V Upo completio of this uit, studets should be able to: 1. Write three kids of otatio for a percet. 2. Covert betwee percet otatio ad decimal
More informationA Note About Maximum Likelihood Estimator in Hypergeometric Distribution
Comuicacioes e Estadística Juio 2009, Vol. 2, No. 1 A Note About Maximum Likelihood Estimator i Hypergeometric Distributio Ua ota sobre los estimadores de máxima verosimilitud e la distribució hipergeométrica
More informationA point estimate is the value of a statistic that estimates the value of a parameter.
Chapter 9 Estimatig the Value of a Parameter Chapter 9.1 Estimatig a Populatio Proportio Objective A : Poit Estimate A poit estimate is the value of a statistic that estimates the value of a parameter.
More informationResearch Article The Average Lower Connectivity of Graphs
Applied Mathematics, Article ID 807834, 4 pages http://dx.doi.org/10.1155/2014/807834 Research Article The Average Lower Coectivity of Graphs Ersi Asla Turgutlu Vocatioal Traiig School, Celal Bayar Uiversity,
More informationWe consider the planning of production over the infinite horizon in a system with timevarying
Ifiite Horizo Productio Plaig i Time-varyig Systems with Covex Productio ad Ivetory Costs Robert L. Smith j Rachel Q. Zhag Departmet of Idustrial ad Operatios Egieerig, Uiversity of Michiga, A Arbor, Michiga
More informationOutline. Plotting discrete-time signals. Sampling Process. Discrete-Time Signal Representations Important D-T Signals Digital Signals
Outlie Discrete-Time Sigals-Itroductio. Plottig discrete-time sigals. Samplig Process. Discrete-Time Sigal Represetatios Importat D-T Sigals Digital Sigals Discrete-Time Sigals-Itroductio The time variable
More informationEVEN NUMBERED EXERCISES IN CHAPTER 4
Joh Riley 7 July EVEN NUMBERED EXERCISES IN CHAPTER 4 SECTION 4 Exercise 4-: Cost Fuctio of a Cobb-Douglas firm What is the cost fuctio of a firm with a Cobb-Douglas productio fuctio? Rather tha miimie
More informationLecture 5: Sampling Distribution
Lecture 5: Samplig Distributio Readigs: Sectios 5.5, 5.6 Itroductio Parameter: describes populatio Statistic: describes the sample; samplig variability Samplig distributio of a statistic: A probability
More informationThe Communication Complexity of Coalition Formation among Autonomous Agents
The Commuicatio Complexity of Coalitio Formatio amog Autoomous Agets Ariel D. Procaccia Jeffrey S. Roseschei School of Egieerig ad Computer Sciece The Hebrew Uiversity of Jerusalem Jerusalem, Israel {arielpro,
More informationON DIFFERENTIATION AND HARMONIC NUMBERS
ON DIFFERENTIATION AND HARMONIC NUMBERS ERIC MORTENSON Abstract. I a paper of Adrews ad Uchimura [AU, it is show how differetiatio applied to hypergeometric idetities produces formulas for harmoic ad q-harmoic
More informationEstimating Forward Looking Distribution with the Ross Recovery Theorem
roceedigs of the Asia acific Idustrial Egieerig & Maagemet Systems Coferece 5 Estimatig Forward Lookig Distributio with the Ross Recovery Theorem Takuya Kiriu Graduate School of Sciece ad Techology Keio
More informationJournal of Statistical Software
JSS Joural of Statistical Software Jue 2007, Volume 19, Issue 6. http://www.jstatsoft.org/ Ratioal Arithmetic Mathematica Fuctios to Evaluate the Oe-sided Oe-sample K-S Cumulative Samplig Distributio J.
More informationChapter 4 - Consumer. Household Demand and Supply. Solving the max-utility problem. Working out consumer responses. The response function
Almost essetial Cosumer: Optimisatio Chapter 4 - Cosumer Osa 2: Household ad supply Cosumer: Welfare Useful, but optioal Firm: Optimisatio Household Demad ad Supply MICROECONOMICS Priciples ad Aalysis
More information. The firm makes different types of furniture. Let x ( x1,..., x n. If the firm produces nothing it rents out the entire space and so has a profit of
Joh Riley F Maimizatio with a sigle costrait F3 The Ecoomic approach - - shadow prices Suppose that a firm has a log term retal of uits of factory space The firm ca ret additioal space at a retal rate
More informationSampling Distributions and Estimation
Cotets 40 Samplig Distributios ad Estimatio 40.1 Samplig Distributios 40. Iterval Estimatio for the Variace 13 Learig outcomes You will lear about the distributios which are created whe a populatio is
More information