Stochastic Optimization with Inequality Constraints Using Simultaneous Perturbations and Penalty Functions
|
|
- Magnus Hensley
- 5 years ago
- Views:
Transcription
1 Stochatic Optimization with Inequality Contraint Uing Simultaneou Perturbation and Penalty Function I-Jeng Wang* and Jame C. Spall** The John Hopkin Univerity Applied Phyic Laboratory John Hopkin Road Laurel, MD , USA Abtract We preent a tochatic approximation algorithm baed on penalty function method and a imultaneou perturbation gradient etimate for olving tochatic optimization problem with general inequality contraint. We preent a general convergence reult that applie to a cla of penalty function including the quadratic penalty function, the augmented Lagrangian, and the abolute penalty function. We alo etablih an aymptotic normality reult for the algorithm with mooth penalty function under minor aumption. Numerical reult are given to compare the performance of the propoed algorithm with different penalty function. I. INTRODUCTION In thi paper, we conider a contrained tochatic optimization problem for which only noiy meaurement of the cot function are available. More pecifically, we are aimed to olve the following optimization problem: minl(θ), (1) θ G where L: R d R i a real-valued cot function, θ R d i the parameter vector, and G R d i the contraint et. We alo aume that the gradient of L( ) exit and i denoted by g( ). We aume that there exit a unique olution θ for the contrained optimization problem defined by (1). We conider the ituation where no explicit cloed-form expreion of the function L i available (or i very complicated even if available), and the only information are noiy meaurement of L at pecified value of the parameter vector θ. Thi cenario arie naturally for imulation-baed optimization where the cot function L i defined a the expected value of a random cot aociated with the tochatic imulation of a complex ytem. We alo aume that ignificant cot (in term of time and/or computational cot) are involved in obtaining each meaurement (or ample) of L(θ). Thee contraint prevent u from etimating the gradient (or Heian) of L( ) accurately, hence prohibit the application of effective nonlinear programming technique for inequality contraint, for example, the equential quadratic programming method (ee; for example, ection 4.3 of [1]). Throughout the paper we ue θ n to denote the nth etimate of the olution θ. Thi work wa upported by the JHU/APL Independent Reearch and Development Program. *Phone: ; i-jeng.wang@jhuapl.edu. **Phone: ; jame.pall@jhuapl.edu. Several reult have been preented for contrained optimization in the tochatic domain. In the area of tochatic approximation (SA), mot of the available reult are baed on the imple idea of projecting the etimate θ n back to it nearet point in G whenever θ n lie outide the contraint et G. Thee projection-baed SA algorithm are typically of the following form: θ n+1 = π G [θ n a n ĝ n (θ n )], (2) where π G : R d G i the et projection operator, and ĝ n (θ n ) i an etimate of the gradient g(θ n ); ee, for example [2], [3], [5], [6]. The main difficulty for thi projection approach lie in the implementation (calculation) of the projection operator π G. Except for imple contraint like interval or linear contraint, calculation of π G (θ) for an arbitrary vector θ i a formidable tak. Other technique for dealing with contraint have alo been conidered: Hiriart-Urruty [7] and Pflug [8] preent and analyze a SA algorithm baed on the penalty function method for tochatic optimization of a convex function with convex inequality contraint; Kuhner and Clark [3] preent everal SA algorithm baed on the Lagrange multiplier method, the penalty function method, and a combination of both. Mot of thee technique rely on the Kiefer-Wofolwitz (KW) [4] type of gradient etimate when the gradient of the cot function i not readily available. Furthermore, the convergence of thee SA algorithm baed on non-projection technique generally require complicated aumption on the cot function L and the contraint et G. In thi paper, we preent and tudy the convergence of a cla of algorithm baed on the penalty function method and the imultaneou perturbation (SP) gradient etimate [9]. The advantage of the SP gradient etimate over the KW-type etimate for uncontrained optimization ha been demontrated with the imultaneou perturbation tochatic approximation (SPSA) algorithm. And whenever poible, we preent ufficient condition (a remark) that can be more eaily verified than the much weaker condition ued in our convergence proof. We focu on general explicit inequality contraint where G i defined by G θ R d : q j (θ) 0, j = 1,...,}, (3)
2 where q j : R d R are continuouly differentiable realvalued function. We aume that the analytical expreion of the function q j i available. We extend the reult preented in [10] to incorporate a larger clae of penalty function baed on the augmented Lagragian method. We alo etablih the aymptotic normality for the propoed algorithm. Simulation reult are preented to illutrated the performance of the technique for tochatic optimization. II. CONSTRAINED SPSA ALGORITHMS A. Penalty Function The baic idea of the penalty-function approach i to convert the originally contrained optimization problem (1) into an uncontrained one defined by min θ L r(θ) L(θ)+rP(θ), (4) where P: R d R i the penalty function and r i a poitive real number normally referred to a the penalty parameter. The penalty function are defined uch that P i an increaing function of the contraint function q j ; P > 0 if and only if q j > 0 for any j; P a q j ; and P l (l 0) a q j. In thi paper, we conider a penalty function method baed on the augmented Lagrangian function defined by } [max0,λ j + rq j (θ)}] 2 λ j 2, L r (θ,λ) = L(θ)+ 1 2r (5) where λ R can be viewed a an etimate of the Lagrange multiplier vector. The aociated penalty function i P(θ) = 1 2r 2 [max0,λ j + rq j (θ)}] 2 λ 2 j }. (6) Let r n } be a poitive and trictly increaing equence with r n and λ n } be a bounded nonnegative equence in R. It can be hown (ee; for example, ection 4.2 of [1]) that the minimum of the equence function L n }, defined by L n (θ) L rn (θ,λ n ), converge to the olution of the original contrained problem (1). Since the penalized cot function (or the augmented Lagrangian) (5) i a differentiable function of θ, we can apply the tandard tochatic approximation technique with the SP gradient etimate for L to minimize L n ( )}. In other word, the original problem can be olved with an algorithm of the following form: θ n+1 = θ n a n ˆ Ln (θ n ) = θ n a n ĝ n a n r n P(θ n ), where ĝ n i the SP etimate of the gradient g( ) at θ n that we hall pecify later. Note that ince we aume the contraint are explicitly given, the gradient of the penalty function P( ) i directly ued in the algorithm. Note that when λ n = 0, the penalty function defined by (6) reduce to the tandard quadratic penalty function dicued in [10] L r (θ,0) = L(θ)+r [max0,q j (θ)}] 2. Even though the convergence of the propoed algorithm only require λ n } be bounded (hence we can et λ n = 0), we can ignificantly improve the performance of the algorithm with appropriate choice of the equence baed on concept from Lagrange multiplier theory. Moreover, it ha been hown [1] that, with the tandard quadratic penalty function, the penalized cot function L n = L + r n P can become illconditioned a r n increae (that i, the condition number of the Heian matrix of L n at θ n diverge to with r n ). The ue of the general penalty function defined in (6) can prevent thi difficulty if λ n } i choen o that it i cloe to the true Lagrange multiplier. In Section IV, we will preent an iterative method baed on the method of multiplier (ee; for example, [11]) to update λ n and compare it performance with the tandard quadratic penalty function. B. A SPSA Algorithm for Inequality Contraint In thi ection, we preent the pecific form of the algorithm for olving the contrained tochatic optimization problem. The algorithm we conider i defined by θ n+1 = θ n a n ĝ n (θ n ) a n r n P(θ n ), (7) where ĝ n (θ n ) i an etimate of the gradient of L, g( ), at θ n, r n } i an increaing equence of poitive calar with lim n r n =, P(θ) i the gradient of P(θ) at θ, and a n } i a poitive calar equence atifying a n 0 and n=1 a n =. The gradient etimate ĝ n i obtained from two noiy meaurement of the cot function L by (L(θ n + c n n )+ε + n ) (L(θ n c n n )+ε n ) 2c n 1 n, (8) where n R d i a random perturbation vector, c n 0 i a poitive equence, ε n + and εn [ are noie in ] the meaurement. and 1 n denote the vector 1,..., 1. For analyi, we 1 n d n rewrite the algorithm (7) into θ n+1 = θ n a n g(θ n ) a n r n P(θ n )+a n d n a n, (9) 2c n n where d n and ε n are defined by d n g(θ n ) L(θ n + c n n ) L(θ n c n n ) 2c n n, ε n ε + n ε n, repectively. We etablih the convergence of the algorithm (7) and the aociated aymptotic normality under appropriate aumption in the next ection. ε n
3 III. CONVERGENCE AND ASYMPTOTIC NORMALITY A. Convergence Theorem To etablih convergence of the algorithm (7), we need to tudy the aymptotic behavior of an SA algorithm with a time-varying regreion function. In other word, we need to conider the convergence of an SA algorithm of the following form: θ n+1 = θ n a n f n (θ n )+a n d n + a n e n, (10) where f n ( )} i a equence of function. We tate here without proof a verion of the convergence theorem given by Spall and Crition in [13] for an algorithm in the generic form (10). Theorem 1: Aume the following condition hold: (A.1) For each n large enough ( N for ome N N), there exit a unique θn uch that f n (θn) = 0. Furthermore, lim n θn = θ. (A.2) d n 0, and n k=1 a ke k converge. (A.3) For ome N <, any ρ > 0 and for each n N, if θ θ ρ, then there exit a δ n (ρ) > 0 uch that (θ θ ) T f n (θ) δ n (ρ) θ θ where δ n (ρ) atifie n=1 a nδ n (ρ) = and d n δ n (ρ) 1 0. (A.4) For each i = 1,2,...,d, and any ρ > 0, if θ ni (θ ) i > ρ eventually, then either f ni (θ n ) 0 eventually or f ni (θ n ) < 0 eventually. (A.5) For any τ > 0 and nonempty S 1,2,...,d}, there exit a ρ (τ,s) > τ uch that for all θ θ R d : (θ θ ) i < τ when i S, (θ θ ) i ρ (τ,s) when i S.}, lim up i S (θ θ ) i f ni (θ) n i S (θ θ ) i f ni (θ) < 1. Then the equence θ n } defined by the algorithm (10) converge to θ. Baed on Theorem 1, we give a convergence reult for algorithm (7) by ubtituting L n (θ n ) = g(θ n ) + r n P(θ n ), ε n 2c n n d n, and into f n (θ n ), d n, and e n in (10), repectively. We need the following aumption: (C.1) There exit K 1 N uch that for all n K 1, we have a unique θn R d with L n (θn) = 0. (C.2) ni } are i.i.d. and ymmetrically ditributed about 0, with ni α 0 a.. and E 1 ni α 1. a k ε k 2c k k (C.3) n k=1 converge almot urely. (C.4) If θ θ ρ, then there exit a δ(ρ) > 0 uch that (i) if θ G, (θ θ ) T g(θ) δ(ρ) θ θ > 0. (ii) if θ G, at leat one of the following two condition hold (θ θ ) T g(θ) δ(ρ) θ θ and (θ θ ) T P(θ) 0. (θ θ ) T g(θ) M and (θ θ ) T P(θ) δ(ρ) θ θ > 0 (C.5) a n r n 0, g( ) and P( ) are Lipchitz. (See comment below) (C.6) L n ( ) atifie condition (A5) Theorem 2: Suppoe that aumption (C.1 C.6) hold. Then the equence θ n } defined by (7) converge to θ almot urely. Proof: We only need to verify the condition (A.1 A.5) in Theorem 1 to how the deired reult: Condition (A.1) baically require the tationary point of the equence L n ( )} converge to θ. Aumption (C.1) together with exiting reult on penalty function method etablihe thi deired convergence. From the reult in [9], [14] and aumption (C.2 C.3), we can how that condition (A.2) hold. Since r n, we have condition (A.3) hold from aumption (C.4). From (9), aumption (C.1) and (C.5), we have (θ n+1 θ n ) i < (θ n θ ) i for large n if θ ni (θ ) i > ρ. Hence for large n, the equence θ ni } doe not jump over the interval between (θ ) i and θ ni. Therefore if θ ni (θ ) i > ρ eventually, then the equence f ni (θ n )} doe not change ign eventually. That i, condition (A.4) hold. Aumption (A.5) hold directly from (C.6). Theorem 2 given above i general in the ene that it doe not pecify the exact type of penalty function P( ) to adopt. In particular, aumption (C.4) eem difficult to atify. In fact, aumption (C.4) i fairly weak and doe addre the limitation of the penalty function baed gradient decent algorithm. For example, uppoe that a contraint function q k ( ) ha a local minimum at θ with q k (θ ) > 0. Then for every θ with q j (θ) 0, j k, we have (θ θ ) T P(θ) > 0 whenever θ i cloe enough to θ. A r n get larger, the term P(θ) would dominate the behavior of the algorithm and reult in a poible convergence to θ, a wrong olution. We alo like to point out that aumption (C.4) i atified if cot function L and contraint function q j, j = 1,..., are convex and atify the later condition, that i, the minimum cot function value L(θ ) i finite and there exit a θ R d uch that q j (θ) < 0 for all j (thi i the cae tudied in [8]). Aumption (C.6) enure that for n ufficiently large each element of g(θ) + r n P(θ) make a non-negligible contribution to product of the form (θ θ ) T (g(θ)+r n P(θ)) when (θ θ ) i 0. A ufficient condition for (C.6) i that for each i, g i (θ)+r n i P(θ) be uniformly bounded both away from 0 and when (θ θ ) i ρ > 0 for all i. Theorem 2 in the tated form doe require that the penalty function P be differentiable. However, it i poible to extend the tated reult to the cae where P i Lipchitz but not differentiable at a et of point with zero meaure, for example, the abolute value penalty function P(θ) = max,..., max 0,qj (θ) }}.
4 In the cae where the denity function of meaurement noie (ε n + and εn in (8)) exit and ha infinite upport, we can take advantage of the fact that iteration of the algorithm viit any zero-meaure et with zero probability. Auming that the et D θ R d : P(θ)doe not exit} ha Lebegue meaure 0 and the random perturbation n follow Bernoulli ditribution (P( i n = 0) = P( i n = 1) = 1 2 ), we can contruct a imple proof to how that Pθ n D i.o.} = 0 if Pθ 0 D} = 0. Therefore, the convergence reult in Theorem 2 applie to the penalty function with non-moothne at a et with meaure zero. Hence in any practical application, we can imply ignore thi technical difficulty and ue P(θ) = max0,q J(θ) (θ)} q J(θ) (θ), where J(θ) = argmax,..., q j (θ) (note that J(θ) i uniquely defined for θ D). An alternative approach to handle thi technical difficulty i to apply the SP gradient etimate directly to the penalized cot L(θ) + rp(θ) and adopt the convergence analyi preented in [15] for nondifferentiable optimization with additional convexity aumption. Ue of non-differentiable penalty function might allow u to avoid the difficulty of ill-conditioning a r n without uing the more complicated penalty function method uch a the augmented Lagrangian method ued here. The rationale here i that there exit a contant r = λ j (λ j i the Lagrange multiplier aociate with the jth contraint) uch that the minimum of L + rp i identical to the olution of the original contrained problem for all r > r, baed on the theory of exact penaltie (ee; for example, ection 4.3 of [1]). Thi property of the abolute value penalty function allow u to ue a contant penalty parameter r > r (intead of r n ) to avoid the iue of ill-conditioning. However, it i difficult to obtain a good etimate for r in our ituation where the analytical expreion of g( ) (the gradient of the cot function L( )) i not available. And it i not clear that the application of exact penalty function with r n would lead to better performance than the augmented Lagrangian baed technique. In SectionIV we will alo illutrate (via numerical reult) the potential poor performance of the algorithm with an arbitrarily choen large r. B. Aymptotic Normality When differentiable penalty function are ued, we can etablih the aymptotic normality for the propoed algorithm. In the cae where q j (θ ) < 0 for all j = 1,..., (that i, there i no active contraint at θ ), the aymptotic behavior of the algorithm i exactly the ame a the uncontrained SPSA algorithm and ha been etablihed in [9]. Here we conider the cae where at leat one of contraint i active at θ, that i, the et A j = 1,...: q j (θ ) = 0} i not empty. We etablih the aymptotic Normality for the algorithm with mooth penalty function of the form P(θ) = p j (q j (θ)), which including both the quadratic penalty and augmented Lagrangian function. Aume further that E[e n F n, n ] = 0 a.., E[e 2 n F n ] σ 2 a.., E[( i n) 2 ] ρ 2, and E[( i n) 2 ] ξ 2, where F n i the σ- algebra generated by θ 1,...,θ n. Let H(θ) denote the Heian matrix of L(θ) and H p (θ) = 2 (p j (q j (θ))). j A The next propoition etablihe the aymptotic normality for the propoed algorithm with the following choice of parameter: a n = an α, c n = cn γ and r n = rn η with a,c,r > 0, β = α η 2γ > 0, and 3γ α 2 + 3η 2 0. Propoition 1: Aume that condition (C.1-6) hold. Let P be orthogonal with PH p (θ )P T = a 1 r 1 diag(λ 1,...,λ d ) Then n β/2 (θ n θ ) dit N(µ,PMPT ), n where M = 4 1a2 r 2 c 2 σ 2 ρ 2 diag[(2λ 1 β + ) 1,...,(2λ d β + ) 1 ] with β + = β < 2min i λ i if α = 1 and β + = 0 if α < 1, and 0 if 3γ α µ = 2 + 3η 2 > 0, (arh p (θ ) 2 1β +I) 1 T if 3γ 2 α + 3η 2 = 0, where the lth element of T i [ 1 6 ac2 ξ 2 L (3) lll (θ )+3 p i=1,i l Proof: For large enough n, we have L (3) iii (θ ) E[ĝ n (θ n ) θ n ] = H( θ n )(θ n θ )+b n (θ n ), P(θ n ) = H p ( θ n)(θ n θ ), where b n (θ n ) = E[ĝ n (θ n ) g(θ n ) θ n ]. Rewrite the algorithm into θ n+1 θ = (I n α+η Γ n )(θ n θ )+n (α η+β)/2 Φ n V n where Γ n +n α+η β/2 T n, = an η H( θ n )+arh p ( θ n), V n = n γ [ĝ n (θ n ) E(ĝ n (θ n ) θ n )] Φ n = ai, T k = an β/2 η b n (θ n ). Following the technique ued in [9] and the general Normality reult from [16] we can etablih the deired reult. Note that baed on the reult in Propoition 1, the convergence rate at n 1 3 i achieved with α = 1 and γ = 1 6 η > 0. ].
5 IV. NUMERICAL EXPERIMENTS We tet our algorithm on a contrained optimization problem decribed in [17, p.352]: min θ L(θ) = θ θ θ θ 2 4 5θ 1 5θ 2 21θ 3 + 7θ 4 ubject to q 1 (θ) = 2θ θ θ θ 1 θ 2 θ q 2 (θ) = θ θ θ θ θ 1 θ 2 + θ 3 θ q 3 (θ) = θ θ θ θ 2 4 θ 1 θ The minimum cot L(θ ) = 44 under contraint occur at θ = [0,1,2, 1] T where the contraint q 1 ( ) 0 and q 2 ( ) 0 are active. The Lagrange multiplier i [λ 1,λ 2,λ 3 ]T = [2,1,0] T. The problem had not been olved to atifactory accuracy with determinitic earch method that operate directly with contraint (claimed by [17]). Further, we increae the difficulty of the problem by adding i.i.d. zeromean Gauian noie to L(θ) and aume that only noiy meaurement of the cot function L are available (without gradient). The initial point i choen at [0,0,0,0] T ; and the tandard deviation of the added Gauian noie i 4.0 (roughly equal to the initial error). We conider three different penalty function: Quadratic penalty function: P(θ) = 1 2 [max0,q j (θ)}] 2. (11) In thi cae the gradient of P( ) required in the algorithm i P(θ) = Augmented Lagrangian: P(θ) = 1 2r 2 max0,q j (θ)} q j (θ). (12) [max0,λ j + rq j (θ)}] 2 λ 2. (13) In thi cae, the actual penalty function ued will vary over iteration depending on the pecific value elected for r n and λ n. The gradient of the penalty function required in the algorithm for the nth iteration i P(θ) = 1 r n max0,λ n j + r n q j (θ)} q j (θ). (14) To properly update λ n, we adopt a variation of the multiplier method [1]: λ n j = max0,λ n j + r n q j (θ n ),M}, (15) where λ n j denote the jth element of the vector λ n, and M R + i a large contant calar. Since (15) enure that λ n } i bounded, convergence of the minimum of L n ( )} remain valid. Furthermore, λ n } will be cloe to the true Lagrange multiplier a n. Average error over 100 imulation Abolute value penalty r = 10 Quadratic penalty Augmented Lagrangian Abolute value penalty r = Number of Iteration Fig. 1. Error to the optimum ( θ n θ ) averaged over 100 independent imulation. Abolute value penalty function: P(θ) = max max 0,qj (θ) }}. (16),..., A dicued earlier, we will ignore the technical difficulty that P( ) i not differentiable everywhere. The gradient of P( ) when it exit i P(θ) = max0,q J(θ) (θ)} q J(θ) (θ), (17) where J(θ) = argmax,..., q j (θ). For all the imulation we ue the following parameter value: a n = 0.1(n + 100) and c n = n Thee parameter for a n and c n are choen following a practical implementation guideline recommended in [18]. For the augmented Lagrangian method, λ n i initialized a a zero vector. For the quadratic penalty function and augmented Lagrangian, we ue r n = 10n 0.1 for the penalty parameter. For the abolute value penalty function, we conider two poible value for the contant penalty: r n = r = 3.01 and r n = r = 10. Note that in our experiment, r = λ j = 3. Hence the firt choice of r at 3.01 i theoretically optimal but not practical ince there i no reliable way to etimate r. The econd choice of r repreent a more typical cenario where an upper bound on r i etimated. Figure 1 plot the averaged error (over 100 independent imulation) to the optimum over 4000 iteration of the algorithm. The imulation reult in Figure 1 eem to ugget that the propoed algorithm with the quadratic penalty function and the augmented Lagrangian led to comparable performance (the augmented Lagrangian method performed lightly better than the tandard quadratic technique). Thi ugget that a more effective update cheme for λ n than (15) i needed for the augmented Lagrangian technique. The abolute value function with r = 3.01( r = 3) ha the bet performance. However, when an arbitrary upper bound on r i
6 ued (r = 10), the performance i much wore than both the quadratic penalty function and the augmented Lagrangian. Thi illutrate a key difficulty in effective application of the exact penalty theorem with the abolute penalty function. V. CONCLUSIONS AND REMARKS We preent a tochatic approximation algorithm baed on penalty function method and a imultaneou perturbation gradient etimate for olving tochatic optimization problem with general inequality contraint. We alo preent a general convergence reult and the aociated aymptotic Normality for the propoed algorithm. Numerical reult are included to demontrate the performance of the propoed algorithm with the tandard quadratic penalty function and a more complicated penalty function baed on the augmented Lagrangian method. In thi paper, we conider the explicit contraint where the analytical expreion of the contraint are available. It i alo poible to apply the ame algorithm with appropriate gradient etimate for P(θ) to problem with implicit contraint where contraint can only be meaured or etimated with poible error. The ucce of thi approach would depend on efficient technique to obtain unbiaed gradient etimate of the penalty function. For example, if we can meaure or etimate a value of the penalty function P(θ n ) at arbitrary location with zero-mean error, then the SP gradient etimate can be applied. Of coure, in thi ituation further aumption on r n need to ) be atified (in general, 2 we would at leat need n=1( an r n c n < ). However, in a typical application, we mot likely can only meaure the value of contraint q j (θ n ) with zero-mean error. Additional bia would be preent if the tandard finite-difference or the SP technique were applied to etimate P(θ n ) directly in thi ituation. A novel technique to obtain unbiaed etimate of P(θ n ) baed on a reaonable number of meaurement i required to make the algorithm propoed in thi paper feaible in dealing with implicit contraint. VI. REFERENCES [1] D. P. Berteka, Nonlinear Programming, Athena Scientific, Belmont, MA, [2] P. Dupui and H. J. Kuhner, Aymptotic behavior of contrained tochatic approximation via the theory of large deviation, Probability Theory and Related Field, vol. 75, pp , [3] H. Kuhner and D. Clark, Stochatic Approximation Method for Contrained and Uncontrained Sytem. Springer-Verlag, [4] J. Kiefer and J. Wolfowitz, Stochatic etimation of the maximum of a regreion function, Ann. Math. Statit., vol. 23, pp , [5] H. Kuhner and G. Yin, Stochatic Approximation Algorithm and Application. Springer-Verlag, [6] P. Sadegh, Contrained optimization via tochatic approximation with a imultaneou perturbation gradient approximation, Automatica, vol. 33, no. 5, pp , [7] J. Hiriart-Urruty, Algorithm of penalization type and of dual type for the olution of tochatic optimization problem with tochatic contraint, in Recent Development in Statitic (J. Barra, ed.), pp , North Holland Publihing Company, [8] G. C. Pflug, On the convergence of a penalty-type tochatic optimization procedure, Journal of Information and Optimization Science, vol. 2, no. 3, pp , [9] J. C. Spall, Multivariate tochatic approximation uing a imultaneou perturbation gradient approximation, IEEE Tranaction on Automatic Control, vol. 37, pp , March [10] I-J. Wang and J. C. Spall, A contrained imultaneou perturbation tochatic approximation algorithm baed on penalty function method, in Proceeding of the 1999 American Control Conference, vol. 1, pp , San Diego, CA, June [11] D. P. Berteka, Contrained Optimization and Lagragne Mulitplier Method, Academic Pre, NY, [12] E. K. Chong and S. H. Żak, An Introduction to Optimization. New York, New York: John Wiley and Son, [13] J. C. Spall and J. A. Crition, Model-free control of nonlinear tochatic ytem with dicrete-time meaurement, IEEE Tranaction on Automatic Control, vol. 43, no. 9, pp , [14] I-J. Wang, Analyi of Stochatic Approximation and Related Algorithm. PhD thei, School of Electrical and Computer Engineering, Purdue Univerity, Augut [15] Y. He, M. C. Fu, and S. I. Marcu, Convergence of imultaneou perturbation tochatic approximation for nondifferentiable optimization, IEEE Tranaction on Automatic Control, vol. 48, no. 8, pp , [16] V. Fabian, On aymptotic normality in tochatic approximation, The Annal of Mathematical Statitic, vol. 39, no. 4, pp , [17] H.-P. Schwefel, Evolution and Optimum Seeking. John Wiley and Son, Inc., [18] J. C. Spall, Implementation of the imultaneou perturbation algorithm for tochatic optimization, IEEE Tranaction on Aeropace and Electronic Sytem, vol. 34, no. 3, pp , 1998.
Stochastic Optimization with Inequality Constraints Using Simultaneous Perturbations and Penalty Functions
International Journal of Control Vol. 00, No. 00, January 2007, 1 10 Stochastic Optimization with Inequality Constraints Using Simultaneous Perturbations and Penalty Functions I-JENG WANG and JAMES C.
More informationA Constraint Propagation Algorithm for Determining the Stability Margin. The paper addresses the stability margin assessment for linear systems
A Contraint Propagation Algorithm for Determining the Stability Margin of Linear Parameter Circuit and Sytem Lubomir Kolev and Simona Filipova-Petrakieva Abtract The paper addree the tability margin aement
More informationOne Class of Splitting Iterative Schemes
One Cla of Splitting Iterative Scheme v Ciegi and V. Pakalnytė Vilniu Gedimina Technical Univerity Saulėtekio al. 11, 2054, Vilniu, Lithuania rc@fm.vtu.lt Abtract. Thi paper deal with the tability analyi
More informationMulti-dimensional Fuzzy Euler Approximation
Mathematica Aeterna, Vol 7, 2017, no 2, 163-176 Multi-dimenional Fuzzy Euler Approximation Yangyang Hao College of Mathematic and Information Science Hebei Univerity, Baoding 071002, China hdhyywa@163com
More informationCHAPTER 4 DESIGN OF STATE FEEDBACK CONTROLLERS AND STATE OBSERVERS USING REDUCED ORDER MODEL
98 CHAPTER DESIGN OF STATE FEEDBACK CONTROLLERS AND STATE OBSERVERS USING REDUCED ORDER MODEL INTRODUCTION The deign of ytem uing tate pace model for the deign i called a modern control deign and it i
More informationStochastic Optimization with Inequality Constraints Using Simultaneous Perturbations and Penalty Functions
Proceedings of the 42nd LEEE Conference on Decision and Control Maui, Hawaii USA, December 2003 I T h M 07-2 Stochastic Optimization with Inequality Constraints Using Simultaneous Perturbations and Penalty
More informationCodes Correcting Two Deletions
1 Code Correcting Two Deletion Ryan Gabry and Frederic Sala Spawar Sytem Center Univerity of California, Lo Angele ryan.gabry@navy.mil fredala@ucla.edu Abtract In thi work, we invetigate the problem of
More informationBy Xiaoquan Wen and Matthew Stephens University of Michigan and University of Chicago
Submitted to the Annal of Applied Statitic SUPPLEMENTARY APPENDIX TO BAYESIAN METHODS FOR GENETIC ASSOCIATION ANALYSIS WITH HETEROGENEOUS SUBGROUPS: FROM META-ANALYSES TO GENE-ENVIRONMENT INTERACTIONS
More informationSocial Studies 201 Notes for November 14, 2003
1 Social Studie 201 Note for November 14, 2003 Etimation of a mean, mall ample ize Section 8.4, p. 501. When a reearcher ha only a mall ample ize available, the central limit theorem doe not apply to the
More informationAn Inequality for Nonnegative Matrices and the Inverse Eigenvalue Problem
An Inequality for Nonnegative Matrice and the Invere Eigenvalue Problem Robert Ream Program in Mathematical Science The Univerity of Texa at Dalla Box 83688, Richardon, Texa 7583-688 Abtract We preent
More informationON THE APPROXIMATION ERROR IN HIGH DIMENSIONAL MODEL REPRESENTATION. Xiaoqun Wang
Proceeding of the 2008 Winter Simulation Conference S. J. Maon, R. R. Hill, L. Mönch, O. Roe, T. Jefferon, J. W. Fowler ed. ON THE APPROXIMATION ERROR IN HIGH DIMENSIONAL MODEL REPRESENTATION Xiaoqun Wang
More informationIEOR 3106: Fall 2013, Professor Whitt Topics for Discussion: Tuesday, November 19 Alternating Renewal Processes and The Renewal Equation
IEOR 316: Fall 213, Profeor Whitt Topic for Dicuion: Tueday, November 19 Alternating Renewal Procee and The Renewal Equation 1 Alternating Renewal Procee An alternating renewal proce alternate between
More informationBeta Burr XII OR Five Parameter Beta Lomax Distribution: Remarks and Characterizations
Marquette Univerity e-publication@marquette Mathematic, Statitic and Computer Science Faculty Reearch and Publication Mathematic, Statitic and Computer Science, Department of 6-1-2014 Beta Burr XII OR
More informationCHAPTER 8 OBSERVER BASED REDUCED ORDER CONTROLLER DESIGN FOR LARGE SCALE LINEAR DISCRETE-TIME CONTROL SYSTEMS
CHAPTER 8 OBSERVER BASED REDUCED ORDER CONTROLLER DESIGN FOR LARGE SCALE LINEAR DISCRETE-TIME CONTROL SYSTEMS 8.1 INTRODUCTION 8.2 REDUCED ORDER MODEL DESIGN FOR LINEAR DISCRETE-TIME CONTROL SYSTEMS 8.3
More informationClustering Methods without Given Number of Clusters
Clutering Method without Given Number of Cluter Peng Xu, Fei Liu Introduction A we now, mean method i a very effective algorithm of clutering. It mot powerful feature i the calability and implicity. However,
More informationProblem Set 8 Solutions
Deign and Analyi of Algorithm April 29, 2015 Maachuett Intitute of Technology 6.046J/18.410J Prof. Erik Demaine, Srini Devada, and Nancy Lynch Problem Set 8 Solution Problem Set 8 Solution Thi problem
More informationLINEAR system identification has been the subject of
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL., NO., 1 Set-Memberhip error-in-variable identification through convex relaxation technique Vito Cerone, Member, IEEE, Dario Piga, Member, IEEE, and Diego Regruto,
More informationResearch Article Existence for Nonoscillatory Solutions of Higher-Order Nonlinear Differential Equations
International Scholarly Reearch Network ISRN Mathematical Analyi Volume 20, Article ID 85203, 9 page doi:0.502/20/85203 Reearch Article Exitence for Nonocillatory Solution of Higher-Order Nonlinear Differential
More informationFactor Analysis with Poisson Output
Factor Analyi with Poion Output Gopal Santhanam Byron Yu Krihna V. Shenoy, Department of Electrical Engineering, Neurocience Program Stanford Univerity Stanford, CA 94305, USA {gopal,byronyu,henoy}@tanford.edu
More informationGeneral System of Nonconvex Variational Inequalities and Parallel Projection Method
Mathematica Moravica Vol. 16-2 (2012), 79 87 General Sytem of Nonconvex Variational Inequalitie and Parallel Projection Method Balwant Singh Thakur and Suja Varghee Abtract. Uing the prox-regularity notion,
More informationSocial Studies 201 Notes for March 18, 2005
1 Social Studie 201 Note for March 18, 2005 Etimation of a mean, mall ample ize Section 8.4, p. 501. When a reearcher ha only a mall ample ize available, the central limit theorem doe not apply to the
More informationEfficient Methods of Doppler Processing for Coexisting Land and Weather Clutter
Efficient Method of Doppler Proceing for Coexiting Land and Weather Clutter Ça gatay Candan and A Özgür Yılmaz Middle Eat Technical Univerity METU) Ankara, Turkey ccandan@metuedutr, aoyilmaz@metuedutr
More informationTHE STOCHASTIC SCOUTING PROBLEM. Ana Isabel Barros
THE STOCHASTIC SCOUTING PROBLEM Ana Iabel Barro TNO, P.O. Box 96864, 2509 JG The Hague, The Netherland and Faculty of Military Science, Netherland Defence Academy, P.O. Box 10000, 1780 CA Den Helder, The
More informationEFFECT ON PERSISTENCE OF INTRA-SPECIFIC COMPETITION IN COMPETITION MODELS
Electronic Journal of Differential Equation, Vol. 2007(2007, No. 25, pp. 0. ISSN: 072-669. URL: http://ejde.math.txtate.edu or http://ejde.math.unt.edu ftp ejde.math.txtate.edu (login: ftp EFFECT ON PERSISTENCE
More informationSource slideplayer.com/fundamentals of Analytical Chemistry, F.J. Holler, S.R.Crouch. Chapter 6: Random Errors in Chemical Analysis
Source lideplayer.com/fundamental of Analytical Chemitry, F.J. Holler, S.R.Crouch Chapter 6: Random Error in Chemical Analyi Random error are preent in every meaurement no matter how careful the experimenter.
More informationMulticolor Sunflowers
Multicolor Sunflower Dhruv Mubayi Lujia Wang October 19, 2017 Abtract A unflower i a collection of ditinct et uch that the interection of any two of them i the ame a the common interection C of all of
More informationμ + = σ = D 4 σ = D 3 σ = σ = All units in parts (a) and (b) are in V. (1) x chart: Center = μ = 0.75 UCL =
Our online Tutor are available 4*7 to provide Help with Proce control ytem Homework/Aignment or a long term Graduate/Undergraduate Proce control ytem Project. Our Tutor being experienced and proficient
More informationOptimal Coordination of Samples in Business Surveys
Paper preented at the ICES-III, June 8-, 007, Montreal, Quebec, Canada Optimal Coordination of Sample in Buine Survey enka Mach, Ioana Şchiopu-Kratina, Philip T Rei, Jean-Marc Fillion Statitic Canada New
More informationOnline Appendix for Managerial Attention and Worker Performance by Marina Halac and Andrea Prat
Online Appendix for Managerial Attention and Worker Performance by Marina Halac and Andrea Prat Thi Online Appendix contain the proof of our reult for the undicounted limit dicued in Section 2 of the paper,
More informationConvergence criteria and optimization techniques for beam moments
Pure Appl. Opt. 7 (1998) 1221 1230. Printed in the UK PII: S0963-9659(98)90684-5 Convergence criteria and optimization technique for beam moment G Gbur and P S Carney Department of Phyic and Atronomy and
More information[Saxena, 2(9): September, 2013] ISSN: Impact Factor: INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY
[Saena, (9): September, 0] ISSN: 77-9655 Impact Factor:.85 IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY Contant Stre Accelerated Life Teting Uing Rayleigh Geometric Proce
More informationControl Systems Analysis and Design by the Root-Locus Method
6 Control Sytem Analyi and Deign by the Root-Locu Method 6 1 INTRODUCTION The baic characteritic of the tranient repone of a cloed-loop ytem i cloely related to the location of the cloed-loop pole. If
More informationSOME RESULTS ON INFINITE POWER TOWERS
NNTDM 16 2010) 3, 18-24 SOME RESULTS ON INFINITE POWER TOWERS Mladen Vailev - Miana 5, V. Hugo Str., Sofia 1124, Bulgaria E-mail:miana@abv.bg Abtract To my friend Kratyu Gumnerov In the paper the infinite
More informationSome Sets of GCF ϵ Expansions Whose Parameter ϵ Fetch the Marginal Value
Journal of Mathematical Reearch with Application May, 205, Vol 35, No 3, pp 256 262 DOI:03770/jin:2095-26520503002 Http://jmredluteducn Some Set of GCF ϵ Expanion Whoe Parameter ϵ Fetch the Marginal Value
More informationSimple Observer Based Synchronization of Lorenz System with Parametric Uncertainty
IOSR Journal of Electrical and Electronic Engineering (IOSR-JEEE) ISSN: 78-676Volume, Iue 6 (Nov. - Dec. 0), PP 4-0 Simple Oberver Baed Synchronization of Lorenz Sytem with Parametric Uncertainty Manih
More informationTRIPLE SOLUTIONS FOR THE ONE-DIMENSIONAL
GLASNIK MATEMATIČKI Vol. 38583, 73 84 TRIPLE SOLUTIONS FOR THE ONE-DIMENSIONAL p-laplacian Haihen Lü, Donal O Regan and Ravi P. Agarwal Academy of Mathematic and Sytem Science, Beijing, China, National
More informationA SIMPLE NASH-MOSER IMPLICIT FUNCTION THEOREM IN WEIGHTED BANACH SPACES. Sanghyun Cho
A SIMPLE NASH-MOSER IMPLICIT FUNCTION THEOREM IN WEIGHTED BANACH SPACES Sanghyun Cho Abtract. We prove a implified verion of the Nah-Moer implicit function theorem in weighted Banach pace. We relax the
More informationResearch Article A New Kind of Weak Solution of Non-Newtonian Fluid Equation
Hindawi Function Space Volume 2017, Article ID 7916730, 8 page http://doi.org/10.1155/2017/7916730 Reearch Article A New Kind of Weak Solution of Non-Newtonian Fluid Equation Huahui Zhan 1 and Bifen Xu
More informationEstimation of Current Population Variance in Two Successive Occasions
ISSN 684-8403 Journal of Statitic Volume 7, 00, pp. 54-65 Etimation of Current Population Variance in Two Succeive Occaion Abtract Muhammad Azam, Qamruz Zaman, Salahuddin 3 and Javed Shabbir 4 The problem
More informationStochastic Perishable Inventory Control in a Service Facility System Maintaining Inventory for Service: Semi Markov Decision Problem
Stochatic Perihable Inventory Control in a Service Facility Sytem Maintaining Inventory for Service: Semi Markov Deciion Problem R.Mugeh 1,S.Krihnakumar 2, and C.Elango 3 1 mugehrengawamy@gmail.com 2 krihmathew@gmail.com
More informationLinear Quadratic Stochastic Differential Games under Asymmetric Value of Information
Preprint of the 2th World Congre The International Federation of Automatic Control Touloue, France, July 9-4, 27 Linear Quadratic Stochatic Differential Game under Aymmetric Value of Information Dipankar
More informationA FUNCTIONAL BAYESIAN METHOD FOR THE SOLUTION OF INVERSE PROBLEMS WITH SPATIO-TEMPORAL PARAMETERS AUTHORS: CORRESPONDENCE: ABSTRACT
A FUNCTIONAL BAYESIAN METHOD FOR THE SOLUTION OF INVERSE PROBLEMS WITH SPATIO-TEMPORAL PARAMETERS AUTHORS: Zenon Medina-Cetina International Centre for Geohazard / Norwegian Geotechnical Intitute Roger
More informationA Simple Approach to Synthesizing Naïve Quantized Control for Reference Tracking
A Simple Approach to Syntheizing Naïve Quantized Control for Reference Tracking SHIANG-HUA YU Department of Electrical Engineering National Sun Yat-Sen Univerity 70 Lien-Hai Road, Kaohiung 804 TAIAN Abtract:
More informationNCAAPMT Calculus Challenge Challenge #3 Due: October 26, 2011
NCAAPMT Calculu Challenge 011 01 Challenge #3 Due: October 6, 011 A Model of Traffic Flow Everyone ha at ome time been on a multi-lane highway and encountered road contruction that required the traffic
More informationPerformance Bounds for Constrained Linear Min-Max Control
01 European Control Conference (ECC) July 1-19, 01, Zürich, Switzerland. Performance Bound for Contrained Linear Min-Max Control Tyler H. Summer and Paul J. Goulart Abtract Thi paper propoe a method to
More informationSTOCHASTIC EVOLUTION EQUATIONS WITH RANDOM GENERATORS. By Jorge A. León 1 and David Nualart 2 CINVESTAV-IPN and Universitat de Barcelona
The Annal of Probability 1998, Vol. 6, No. 1, 149 186 STOCASTIC EVOLUTION EQUATIONS WIT RANDOM GENERATORS By Jorge A. León 1 and David Nualart CINVESTAV-IPN and Univeritat de Barcelona We prove the exitence
More informationOn the Stability Region of Congestion Control
On the Stability Region of Congetion Control Xiaojun Lin and Ne B. Shroff School of Electrical and Computer Engineering Purdue Univerity, Wet Lafayette, IN 47906 {linx,hroff}@ecn.purdue.edu Abtract It
More informationEXTENDED STABILITY MARGINS ON CONTROLLER DESIGN FOR NONLINEAR INPUT DELAY SYSTEMS. Otto J. Roesch, Hubert Roth, Asif Iqbal
EXTENDED STABILITY MARGINS ON CONTROLLER DESIGN FOR NONLINEAR INPUT DELAY SYSTEMS Otto J. Roech, Hubert Roth, Aif Iqbal Intitute of Automatic Control Engineering Univerity Siegen, Germany {otto.roech,
More informationUSING NONLINEAR CONTROL ALGORITHMS TO IMPROVE THE QUALITY OF SHAKING TABLE TESTS
October 12-17, 28, Beijing, China USING NONLINEAR CONTR ALGORITHMS TO IMPROVE THE QUALITY OF SHAKING TABLE TESTS T.Y. Yang 1 and A. Schellenberg 2 1 Pot Doctoral Scholar, Dept. of Civil and Env. Eng.,
More informationLecture 4 Topic 3: General linear models (GLMs), the fundamentals of the analysis of variance (ANOVA), and completely randomized designs (CRDs)
Lecture 4 Topic 3: General linear model (GLM), the fundamental of the analyi of variance (ANOVA), and completely randomized deign (CRD) The general linear model One population: An obervation i explained
More informationA BATCH-ARRIVAL QUEUE WITH MULTIPLE SERVERS AND FUZZY PARAMETERS: PARAMETRIC PROGRAMMING APPROACH
Mathematical and Computational Application Vol. 11 No. pp. 181-191 006. Aociation for Scientific Reearch A BATCH-ARRIVA QEE WITH MTIPE SERVERS AND FZZY PARAMETERS: PARAMETRIC PROGRAMMING APPROACH Jau-Chuan
More informationLecture 21. The Lovasz splitting-off lemma Topics in Combinatorial Optimization April 29th, 2004
18.997 Topic in Combinatorial Optimization April 29th, 2004 Lecture 21 Lecturer: Michel X. Goeman Scribe: Mohammad Mahdian 1 The Lovaz plitting-off lemma Lovaz plitting-off lemma tate the following. Theorem
More informationUnbounded solutions of second order discrete BVPs on infinite intervals
Available online at www.tjna.com J. Nonlinear Sci. Appl. 9 206), 357 369 Reearch Article Unbounded olution of econd order dicrete BVP on infinite interval Hairong Lian a,, Jingwu Li a, Ravi P Agarwal b
More informationReliability Analysis of Embedded System with Different Modes of Failure Emphasizing Reboot Delay
International Journal of Applied Science and Engineering 3., 4: 449-47 Reliability Analyi of Embedded Sytem with Different Mode of Failure Emphaizing Reboot Delay Deepak Kumar* and S. B. Singh Department
More informationBogoliubov Transformation in Classical Mechanics
Bogoliubov Tranformation in Claical Mechanic Canonical Tranformation Suppoe we have a et of complex canonical variable, {a j }, and would like to conider another et of variable, {b }, b b ({a j }). How
More informationGain and Phase Margins Based Delay Dependent Stability Analysis of Two- Area LFC System with Communication Delays
Gain and Phae Margin Baed Delay Dependent Stability Analyi of Two- Area LFC Sytem with Communication Delay Şahin Sönmez and Saffet Ayaun Department of Electrical Engineering, Niğde Ömer Halidemir Univerity,
More informationSuggested Answers To Exercises. estimates variability in a sampling distribution of random means. About 68% of means fall
Beyond Significance Teting ( nd Edition), Rex B. Kline Suggeted Anwer To Exercie Chapter. The tatitic meaure variability among core at the cae level. In a normal ditribution, about 68% of the core fall
More informationNew bounds for Morse clusters
New bound for More cluter Tamá Vinkó Advanced Concept Team, European Space Agency, ESTEC Keplerlaan 1, 2201 AZ Noordwijk, The Netherland Tama.Vinko@ea.int and Arnold Neumaier Fakultät für Mathematik, Univerität
More informationONLINE APPENDIX: TESTABLE IMPLICATIONS OF TRANSLATION INVARIANCE AND HOMOTHETICITY: VARIATIONAL, MAXMIN, CARA AND CRRA PREFERENCES
ONLINE APPENDIX: TESTABLE IMPLICATIONS OF TRANSLATION INVARIANCE AND HOMOTHETICITY: VARIATIONAL, MAXMIN, CARA AND CRRA PREFERENCES CHRISTOPHER P. CHAMBERS, FEDERICO ECHENIQUE, AND KOTA SAITO In thi online
More informationThe Hassenpflug Matrix Tensor Notation
The Haenpflug Matrix Tenor Notation D.N.J. El Dept of Mech Mechatron Eng Univ of Stellenboch, South Africa e-mail: dnjel@un.ac.za 2009/09/01 Abtract Thi i a ample document to illutrate the typeetting of
More information1. The F-test for Equality of Two Variances
. The F-tet for Equality of Two Variance Previouly we've learned how to tet whether two population mean are equal, uing data from two independent ample. We can alo tet whether two population variance are
More informationAssessment of Performance for Single Loop Control Systems
Aement of Performance for Single Loop Control Sytem Hiao-Ping Huang and Jyh-Cheng Jeng Department of Chemical Engineering National Taiwan Univerity Taipei 1617, Taiwan Abtract Aement of performance in
More informationON A CERTAIN FAMILY OF QUARTIC THUE EQUATIONS WITH THREE PARAMETERS. Volker Ziegler Technische Universität Graz, Austria
GLASNIK MATEMATIČKI Vol. 1(61)(006), 9 30 ON A CERTAIN FAMILY OF QUARTIC THUE EQUATIONS WITH THREE PARAMETERS Volker Ziegler Techniche Univerität Graz, Autria Abtract. We conider the parameterized Thue
More informationCHEAP CONTROL PERFORMANCE LIMITATIONS OF INPUT CONSTRAINED LINEAR SYSTEMS
Copyright 22 IFAC 5th Triennial World Congre, Barcelona, Spain CHEAP CONTROL PERFORMANCE LIMITATIONS OF INPUT CONSTRAINED LINEAR SYSTEMS Tritan Pérez Graham C. Goodwin Maria M. Serón Department of Electrical
More informationTCER WORKING PAPER SERIES GOLDEN RULE OPTIMALITY IN STOCHASTIC OLG ECONOMIES. Eisei Ohtaki. June 2012
TCER WORKING PAPER SERIES GOLDEN RULE OPTIMALITY IN STOCHASTIC OLG ECONOMIES Eiei Ohtaki June 2012 Working Paper E-44 http://www.tcer.or.jp/wp/pdf/e44.pdf TOKYO CENTER FOR ECONOMIC RESEARCH 1-7-10 Iidabahi,
More informationOptimal revenue management in two class pre-emptive delay dependent Markovian queues
Optimal revenue management in two cla pre-emptive delay dependent Markovian queue Manu K. Gupta, N. Hemachandra and J. Venkatewaran Indutrial Engineering and Operation Reearch, IIT Bombay March 15, 2015
More informationThe Dynamics of Learning Vector Quantization
The Dynamic of Learning Vector Quantization Barbara Hammer TU Clauthal-Zellerfeld Intitute of Computing Science Michael Biehl, Anarta Ghoh Rijkuniveriteit Groningen Mathematic and Computing Science Introduction
More informationDYNAMIC MODELS FOR CONTROLLER DESIGN
DYNAMIC MODELS FOR CONTROLLER DESIGN M.T. Tham (996,999) Dept. of Chemical and Proce Engineering Newcatle upon Tyne, NE 7RU, UK.. INTRODUCTION The problem of deigning a good control ytem i baically that
More informationWhite Rose Research Online URL for this paper: Version: Accepted Version
Thi i a repoitory copy of Identification of nonlinear ytem with non-peritent excitation uing an iterative forward orthogonal leat quare regreion algorithm. White Roe Reearch Online URL for thi paper: http://eprint.whiteroe.ac.uk/107314/
More informationPARAMETRIC ESTIMATION OF HAZARD FUNCTIONS WITH STOCHASTIC COVARIATE PROCESSES
Sankhyā : The Indian Journal of Statitic 1999, Volume 61, Serie A, Pt. 2, pp. 174-188 PARAMETRIC ESTIMATION OF HAZARD FUNCTIONS WITH STOCHASTIC COVARIATE PROCESSES By SIMEON M. BERMAN Courant Intitute
More informationA Simplified Methodology for the Synthesis of Adaptive Flight Control Systems
A Simplified Methodology for the Synthei of Adaptive Flight Control Sytem J.ROUSHANIAN, F.NADJAFI Department of Mechanical Engineering KNT Univerity of Technology 3Mirdamad St. Tehran IRAN Abtract- A implified
More informationA PLC BASED MIMO PID CONTROLLER FOR MULTIVARIABLE INDUSTRIAL PROCESSES
ABCM Sympoium Serie in Mechatronic - Vol. 3 - pp.87-96 Copyright c 8 by ABCM A PLC BASE MIMO PI CONOLLE FO MULIVAIABLE INUSIAL POCESSES Joé Maria Galvez, jmgalvez@ufmg.br epartment of Mechanical Engineering
More informationTAYLOR POLYNOMIALS FOR NABLA DYNAMIC EQUATIONS ON TIME SCALES
TAYLOR POLYNOMIALS FOR NABLA DYNAMIC EQUATIONS ON TIME SCALES DOUGLAS R. ANDERSON Abtract. We are concerned with the repreentation of polynomial for nabla dynamic equation on time cale. Once etablihed,
More informationPreemptive scheduling on a small number of hierarchical machines
Available online at www.ciencedirect.com Information and Computation 06 (008) 60 619 www.elevier.com/locate/ic Preemptive cheduling on a mall number of hierarchical machine György Dóa a, Leah Eptein b,
More informationAlternate Dispersion Measures in Replicated Factorial Experiments
Alternate Diperion Meaure in Replicated Factorial Experiment Neal A. Mackertich The Raytheon Company, Sudbury MA 02421 Jame C. Benneyan Northeatern Univerity, Boton MA 02115 Peter D. Krau The Raytheon
More informationON A CERTAIN FAMILY OF QUARTIC THUE EQUATIONS WITH THREE PARAMETERS
ON A CERTAIN FAMILY OF QUARTIC THUE EQUATIONS WITH THREE PARAMETERS VOLKER ZIEGLER Abtract We conider the parameterized Thue equation X X 3 Y (ab + (a + bx Y abxy 3 + a b Y = ±1, where a, b 1 Z uch that
More informationRELIABILITY OF REPAIRABLE k out of n: F SYSTEM HAVING DISCRETE REPAIR AND FAILURE TIMES DISTRIBUTIONS
www.arpapre.com/volume/vol29iue1/ijrras_29_1_01.pdf RELIABILITY OF REPAIRABLE k out of n: F SYSTEM HAVING DISCRETE REPAIR AND FAILURE TIMES DISTRIBUTIONS Sevcan Demir Atalay 1,* & Özge Elmataş Gültekin
More information7.2 INVERSE TRANSFORMS AND TRANSFORMS OF DERIVATIVES 281
72 INVERSE TRANSFORMS AND TRANSFORMS OF DERIVATIVES 28 and i 2 Show how Euler formula (page 33) can then be ued to deduce the reult a ( a) 2 b 2 {e at co bt} {e at in bt} b ( a) 2 b 2 5 Under what condition
More informationApproximate Analytical Solution for Quadratic Riccati Differential Equation
Iranian J. of Numerical Analyi and Optimization Vol 3, No. 2, 2013), pp 21-31 Approximate Analytical Solution for Quadratic Riccati Differential Equation H. Aminikhah Abtract In thi paper, we introduce
More informationChapter Landscape of an Optimization Problem. Local Search. Coping With NP-Hardness. Gradient Descent: Vertex Cover
Coping With NP-Hardne Chapter 12 Local Search Q Suppoe I need to olve an NP-hard problem What hould I do? A Theory ay you're unlikely to find poly-time algorithm Mut acrifice one of three deired feature
More informationarxiv: v3 [math.pr] 21 Aug 2015
On dynamical ytem perturbed by a null-recurrent fat motion: The continuou coefficient cae with independent driving noie Zolt Pajor-Gyulai, Michael Salin arxiv:4.4625v3 [math.pr] 2 Aug 25 Department of
More informationConnectivity in large mobile ad-hoc networks
Weiertraß-Intitut für Angewandte Analyi und Stochatik Connectivity in large mobile ad-hoc network WOLFGANG KÖNIG (WIAS und U Berlin) joint work with HANNA DÖRING (Onabrück) and GABRIEL FARAUD (Pari) Mohrentraße
More informationBayesian-Based Decision Making for Object Search and Characterization
9 American Control Conference Hyatt Regency Riverfront, St. Loui, MO, USA June -, 9 WeC9. Bayeian-Baed Deciion Making for Object Search and Characterization Y. Wang and I. I. Huein Abtract Thi paper focue
More informationSupplementary Figures
Supplementary Figure Supplementary Figure S1: Extraction of the SOF. The tandard deviation of meaured V xy at aturated tate (between 2.4 ka/m and 12 ka/m), V 2 d Vxy( H, j, hm ) Vxy( H, j, hm ) 2. The
More informationNon-stationary phase of the MALA algorithm
Stoch PDE: Anal Comp 018) 6:446 499 http://doi.org/10.1007/4007-018-0113-1 on-tationary phae of the MALA algorithm Juan Kuntz 1 Michela Ottobre Andrew M. Stuart 3 Received: 3 Augut 017 / Publihed online:
More informationNonlinear Single-Particle Dynamics in High Energy Accelerators
Nonlinear Single-Particle Dynamic in High Energy Accelerator Part 6: Canonical Perturbation Theory Nonlinear Single-Particle Dynamic in High Energy Accelerator Thi coure conit of eight lecture: 1. Introduction
More informationDesign By Emulation (Indirect Method)
Deign By Emulation (Indirect Method he baic trategy here i, that Given a continuou tranfer function, it i required to find the bet dicrete equivalent uch that the ignal produced by paing an input ignal
More informationSemilinear obstacle problem with measure data and generalized reflected BSDE
Semilinear obtacle problem with meaure data and generalized reflected BSDE Andrzej Rozkoz (joint work with T. Klimiak) Nicolau Copernicu Univerity (Toruń, Poland) 6th International Conference on Stochatic
More informationStandard Guide for Conducting Ruggedness Tests 1
Deignation: E 69 89 (Reapproved 996) Standard Guide for Conducting Ruggedne Tet AMERICA SOCIETY FOR TESTIG AD MATERIALS 00 Barr Harbor Dr., Wet Conhohocken, PA 948 Reprinted from the Annual Book of ASTM
More informationFebruary 5, :53 WSPC/INSTRUCTION FILE Mild solution for quasilinear pde
February 5, 14 1:53 WSPC/INSTRUCTION FILE Mild olution for quailinear pde Infinite Dimenional Analyi, Quantum Probability and Related Topic c World Scientific Publihing Company STOCHASTIC QUASI-LINEAR
More informationFinding the location of switched capacitor banks in distribution systems based on wavelet transform
UPEC00 3t Aug - 3rd Sept 00 Finding the location of witched capacitor bank in ditribution ytem baed on wavelet tranform Bahram nohad Shahid Chamran Univerity in Ahvaz bahramnohad@yahoo.com Mehrdad keramatzadeh
More informationChapter 12 Simple Linear Regression
Chapter 1 Simple Linear Regreion Introduction Exam Score v. Hour Studied Scenario Regreion Analyi ued to quantify the relation between (or more) variable o you can predict the value of one variable baed
More information696 Fu Jing-Li et al Vol. 12 form in generalized coordinate Q ffiq dt = 0 ( = 1; ;n): (3) For nonholonomic ytem, ffiq are not independent of
Vol 12 No 7, July 2003 cfl 2003 Chin. Phy. Soc. 1009-1963/2003/12(07)/0695-05 Chinee Phyic and IOP Publihing Ltd Lie ymmetrie and conerved quantitie of controllable nonholonomic dynamical ytem Fu Jing-Li(ΛΠ±)
More informationEE Control Systems LECTURE 14
Updated: Tueday, March 3, 999 EE 434 - Control Sytem LECTURE 4 Copyright FL Lewi 999 All right reerved ROOT LOCUS DESIGN TECHNIQUE Suppoe the cloed-loop tranfer function depend on a deign parameter k We
More informationStratified Analysis of Probabilities of Causation
Stratified Analyi of Probabilitie of Cauation Manabu Kuroki Sytem Innovation Dept. Oaka Univerity Toyonaka, Oaka, Japan mkuroki@igmath.e.oaka-u.ac.jp Zhihong Cai Biotatitic Dept. Kyoto Univerity Sakyo-ku,
More informationChapter 4. The Laplace Transform Method
Chapter 4. The Laplace Tranform Method The Laplace Tranform i a tranformation, meaning that it change a function into a new function. Actually, it i a linear tranformation, becaue it convert a linear combination
More informationLocal Fractional Laplace s Transform Based Local Fractional Calculus
From the SelectedWork of Xiao-Jun Yang 2 Local Fractional Laplace Tranform Baed Local Fractional Calculu Yang Xiaojun Available at: http://workbeprecom/yang_iaojun/8/ Local Fractional Laplace Tranform
More informationStochastic Neoclassical Growth Model
Stochatic Neoclaical Growth Model Michael Bar May 22, 28 Content Introduction 2 2 Stochatic NGM 2 3 Productivity Proce 4 3. Mean........................................ 5 3.2 Variance......................................
More informationAdvanced D-Partitioning Analysis and its Comparison with the Kharitonov s Theorem Assessment
Journal of Multidiciplinary Engineering Science and Technology (JMEST) ISSN: 59- Vol. Iue, January - 5 Advanced D-Partitioning Analyi and it Comparion with the haritonov Theorem Aement amen M. Yanev Profeor,
More informationarxiv: v1 [cs.sy] 9 Aug 2017
Trade-Off in Stochatic Event-Triggered Control Burak Demirel, Alex S Leong, Vijay Gupta and Daniel E Quevedo arxiv:70802756v csy 9 Aug 207 Abtract Thi paper tudie the optimal output-feedback control of
More information