B-469 Simplified Copositive and Lagrangian Relaxations for Linearly Constrained Quadratic Optimization Problems in Continuous and Binary Variables
|
|
- Vivien Boone
- 5 years ago
- Views:
Transcription
1 B-469 Simplified Copositive and Lagrangian Relaxations for Linearly Constrained Qadratic Optimization Problems in Continos and Binary Variables Naohiko Arima, Snyong Kim and Masakaz Kojima October 2012, Revised November 2012 Abstract. For a qadratic optimization problem QOP with linear eqality constraints in continos nonnegative variables and binary variables, we propose three relaxations in simplified forms with a parameter λ: Lagrangian, completely positive, and copositive relaxations. hese relaxations are obtained by redcing the QOP to an eqivalent QOP with a single qadratic eqality constraint in nonnegative variables, and applying the Lagrangian relaxation to the reslting QOP. As a reslt, an nconstrained QOP with a Lagrangian mltiplier λ in nonnegative variables is obtained. he other two relaxations are a primal-dal pair of a completely positive programming CPP relaxation in a variable matrix with the pper-left element set to 1 and a copositive programming CP relaxation in a single variable. he CPP relaxation is derived from the nconstrained QOP with the parameter λ, based on the recent reslt by Arima, Kim and Kojima. he three relaxations with a same parameter vale λ > 0 work as relaxations of the original QOP. he optimal vales ζλ of the three relaxations coincide, and monotonically converge to the optimal vale of the original QOP as λ tends to infinity nder a moderate assmption. he parameter λ serves as a penalty parameter when it is chosen to be positive. hs, the standard theory on the penalty fnction method can be applied to establish the convergence. Key words. Nonconvex qadratic optimization, 0-1 mixed integer program, Lagrangian relaxation, copositve programming relaxation, completely positive programming relaxation. AMS Classification. 90C20, 90C25, 90C26 Department of Mathematical and Compting Sciences, okyo Institte of echnology, Oh-Okayama, Megro-k, okyo Japan. arima.n.ab@m.titech.ac.jp Department of Mathematics, Ewha W. University, 11-1 Dahyn-dong, Sdaemoon-g, Seol Korea. he research was spported by NRF 2012-R1A1A and NRF skim@ewha.ac.kr Department of Mathematical and Compting Sciences, okyo Institte of echnology, Oh-Okayama, Megro-k, okyo Japan, and Research and Development Initiative & JS CRES, Cho University, , Kasga, Bnkyo-k, okyo Japan. his research was spported by Grant-in-Aid for Scientific Research B and the Japan Science and echnology Agency JS, the Core Research of Evoltionary Science and echnology CRES research project. kojima@is.titech.ac.jp 1
2 1 Introdction We consider a class of linearly constrained qadratic optimization problems QOPs in continos nonnegative and binary variables. he standard 0-1 mixed integer linear optimization problem is inclded in this class as a special case. his class of QOPs has long been stdied for varios soltion methods, inclding semidefinite programming SDP relaxation. Recently, completely positive programming CPP relaxation for this class of QOPs was proposed by Brer [3]. he class was extended to a more general class of QOPs by Eichfelder and Povh [6, 7] and by Arima, Kim and Kojima [1]. heoretically strong reslts were presented in their papers [3, 6, 7, 1] showing that the exact optimal vales of QOPs in their classes coincide with the optimal vales of their CPP relaxation problems. A general CPP problem is characterized as linear optimization problems over closed convex cones as a general SDP problem. It is well-known, however, that solving a general CPP problem, or even a simple CPP problem derived as the CPP relaxation problem of the QOP over the simplex [2] is mch more difficlt than solving a general SDP problem. Efficient nmerical methods for solving CPPs have not been developed whereas the primal-dal interior-point methods have been effective for solving SDPs. In fact, the fndamental problem of determining whether a given variable matrix is completely positive or copositive still remains a very challenging problem. If developing efficient nmerical methods for CPP relaxations from QOPs in the classes is an important goal to achieve in the ftre, a first step toward that goal may be representing the QOPs in a simplified form. We say that the QOPs are in a simplified form if the nmbers of constrains and variables are redced. hen, CPP relaxations derived from the simplified QOPs have a redced nmber of constraints and variables, alleviating some of difficlties of handling a large nmber of constrains and variables. his will decrease the difficlty of solving CPP relaxations. For this prpose, three types of extremely simple relaxations are proposed for a class of linearly constrained QOPs in continos and nonnegative variables and binary variables, the class stdied in Brer [3]. he first relaxation is an nconstrained QOP in nonnegative variables. he other two relaxations are a primal-dal pair of an nconstrained CPP problem in a variable matrix whose pper-left element is fixed to 1 and a copositive programming CP problem in a single variable. We may regard that sch a CPP is one of the simplest CPPs, except trivial ones over the completely positive cone with no constraint, and that sch a CP problem is one of the simplest CPs, except trivial ones with no variable. If the problem of determining whether a given variable matrix is completely positive is resolved in the ftre [15], the proposed relaxations can be sed for designing efficient nmerical methods for solving the class of QOPs. A techniqe to redce a linearly constrained QOP in continos nonnegative variables and binary variables to a QOP with a single qadratic eqality constraint in nonnegative variables was introdced by Arima, Kim and Kojima in [1]. he reslting QOP was relaxed to a CPP problem with a single linear eqality constraint in a variable matrix with pper-left element fixed to 1. hey showed that the optimal vale of the CPP relaxation problem coincides with the optimal vale of the original QOP. aking the dal of the CPP problem leads to a CP problem in two variables. As will be shown in the sbseqent section, the dal CP has no optimal soltion in general. his is the second motivation of this paper. he first proposed relaxation is obtained by applying the Lagrangian relaxation to the QOP with a single qadratic eqality constraint in nonnegative variables, which has been redced from the given QOPs sing the techniqe in [1]. he application of the Lagrangian relaxation reslts in an nconstrained QOP with the Lagrangian mltiplier parameter λ in nonnegative variables. For 2
3 any fixed λ, the optimal vale of this nconstrained QOP in nonnegative variables, denoted by ζλ, bonds the optimal vale of the original linearly constrained QOP in continos nonnegative variables and binary variables, denoted by ζ, from below. If the Lagrangian mltiplier parameter λ is chosen to be positive, λ works as a penalty parameter. hs, the standard theory on the penalty fnction method [8] can be tilized to prove that the optimal vale ζλ of the nconstrained QOP with the parameter vale λ > 0 monotonically converges to ζ as λ tends to nder a moderate assmption. In addition, the nconstrained QOP may play an important role for developing nmerical methods. More precisely, if the feasible region of the original QOP can be scaled into the nit box [0, 1] n, then the box constraints can be added to the nconstrained QOP. Many global optimization techniqe developed for this type of QOPs can be sed. See, for example, [4, 5]. he application of CPP relaxation in [1] to the QOP with the parameter λ > 0 provides a primal-dal pair of an nconstrained CPP problem with the parameter λ > 0 in a variable matrix with the pper-left element fixed to 1 and a CP problem with the parameter λ in a single variable. We show nder the same moderate assmption that the primal-dal pair of problems with the parameter vale λ > 0 both have optimal soltions with no dality gap, and share the optimal vale ζλ with the QOP for the parameter vale λ > 0. After introdcing notation and symbols in Section 2, we state or main reslts, heorems 3.1 and 3.3 in Section 3. We give a proof of heorem 3.1 in Section 4, and some remarks in Section 5. 2 Notation and symbols We se the following notation and symbols throghot the paper. R n = the space of n-dimensional colmn vectors, R n + = the nonnegative orthant of R n, S n = the space of n n symmetric matrices, S n + = the cone of n n symmetric positive semidefinite matrices, C = { A S n : x Ax 0 for all x R n +} the copositive cone, { } C = x j x j : x j R n + j = 1, 2,..., r for some r 1 the completely positive cone, Y Z = trace of Y Z for every Y, Z S n the inner prodct, cl conv G = the closre of the convex hll of G S n. 3 Main reslts 3.1 Linearly constrained QOPs in continos and binary variables Let A be a q m matrix, b R q, c R m and r m a positive integer. We consider a QOP of the form minimize sbject to Q 0 + 2c R m +, A + b = 0, i 1 i = 0 i = 1, 2,..., r. Brer [3] stdied this type of QOP, and proposed a completely positive cone programming CPP relaxation whose objective vale is the same as the QOP 1. When Q 0 = O is taken, the problem 3 1
4 becomes a standard 0-1 mixed integer linear optimization problem. We assme throghot the paper that QOP 1 has an optimal soltion with the optimal vale ζ. We first convert the QOP 1 into a QOP with a single eqality constraint according to the discssions in Section 5.1 and 5.2 of [1]. Note that the constraint i 1 i = 0 implies 0 i 1 i = 1, 2,..., r, ths, we may assme withot loss of generality that q r, m 2r, and that the eqalities i + i+r 1 = 0 i = 1, 2,..., r are inclded in the eqality A + b = 0. More precisely, we assme that A and b are of the forms A = A11 A 12 A 13 I I O b1, b = e, 2 where I denotes an r r matrix and e the r-dimensional colmn vector of ones. If the 0-1 constraint i 1 i = 0 is replaced by the complementarity constraint i i+r = 0 i = 1, 2,..., r and the linear eqality constraint A + b = 0 by a qadratic eqality constraint A + b A + b = 0, QOP 1 is rewritten by minimize sbject to Q 0 + 2c R m +, A + b A + b = 0, i i+r = 0 i = 1, 2,..., r. 3 Notice that the left hand sides of all qadratic eqality constraints A + b A + b = 0 and i i+r = 0 i = 1, 2,..., r are nonnegative for every R m +. hs, we can nify the constraints into a single eqality constraint to redce the QOP 3 to minimize Q 0 + 2c sbject to R m +, g = 0, 4 where g = A + b A + b + i i+r. In the main reslts presented in heorems 3.1 and 3.3, one of the following conditions will be imposed on 4. a he feasible region of QOP 4 is bonded. b Q 0 is copositive-pls and the set of optimal soltions of QOP 4 is bonded. Here A C is called copositive-pls if 0 and A = 0 imply A = A parametric nconstrained QOP over the nonnegative orthant We now introdce a Lagrangian relaxation of QOP 4 by defining a Lagrangian fnction f : R m + R R by f, λ = Q 0 + 2c + gλ, minimize f, λ sbject to R m +. 5 Notice that 5 is an nconstrained QOP over the nonnegative orthant with the Lagrangian mltiplier parameter λ R for the eqality constraint of QOP 4. Let s choose a positive nmber for λ so that g λ : R m + R serves as a penalty fnction for QOP 4. In fact, we see that g 0 for every R m +, g = 0 if and only if R m + satisfies the eqality constraint of 4, gλ as 0 λ otherwise. 4
5 For each λ > 0, define a level set Lλ = { R m + : ζ f, λ } and the optimal objective vale ζλ = inf { f, λ : R m + } of QOP 5. hen, for 0 < λ < µ, Lλ Lµ the set of optimal soltions of 4, ζλ = inf {f, λ : Lλ} ζµ ζ. 6 Hence, if L λ is bonded for some λ > 0 and λ λ, then QOP 5 has an optimal soltion with the finite objective vale ζλ, and all optimal soltions of QOP 5 are contained in the bonded set L λ. he next theorem ensres that QOP 5 with the parameter λ > 0 serves as seqential nconstrained QOPs over R m + for solving QOP 4 nder condition a or b. heorem 3.1. i If condition a is satisfied, then Lλ is bonded for every sfficiently large λ > 0. ii If condition b is satisfied, then Lλ is bonded for any λ > 0. iii Assme that L λ is bonded for some λ > 0. Let { λ k λ : k = 1, 2,..., } be a seqence diverging monotonically to as k, and { k R m + : k = 1, 2,..., } a seqence of { optimal soltions of QOP 5 with λ = λ k. hen, any accmlation point of the seqence k R m } + is an optimal soltion of QOP 4, and ζλ k converges monotonically to ζ as k. Althogh some of the assertions in heorem 3.1 can be proved easily by applying the standard argments on the penalty fnction method for example, see [8], we present complete proofs of all assertions for completeness in Section 4. It wold be desirable if any optimal soltion of the problem 5 were an optimal soltion of 4 for every sfficiently large λ. However, this is not tre in general, as shown in the following illstrative example: minimize 2 1 sbject to 1 0, 1 1 = 0, 7 which has the niqe optimal soltion 1 = 1 with the optimal vale ζ = 2. In this case, the Lagrangian relaxation problem is described as minimize λ sbject to 1 0. For every λ > 1, this problem has the niqe minimizer 1 = 1 1/λ with the optimal vale ζλ = 2 1/λ. 3.3 Completely positive cone programming and copositive cone programming relaxations of QOP 5 with the parameter λ > 0 We now relate the Lagrangian relaxation 5 of QOP 4 to the CPP relaxation of QOP 4, which was discssed in Sections 5.1 and 5.2 of [1]. Let n = m, x = R n 0 c, Q = S n, c Q 0 C i = the m m matrix with the i, i + rth component 1/2 and 0 elsewhere H 0 = i = 1, 2,..., r, 1 0 S n b b b A, H 0 O 1 = A b A A C i + C i.
6 hen, Q xx 0 = Q 0 = Q 0 + 2c 0, H 0 xx 0 = H 0 H 1 xx 0 = H 1 0 for every x = rewrite QOP4 as and QOP 5 as Here, 0 0 = 2 0, = b 0 + A b 0 + A + i i+r R n. It shold be noted that H 0, H 1 C. Using these identities, we minimize Q X sbject to X G 1, 8 minimize Q + H 1 λ X sbject to X G 0. 9 G 0 = { xx S n : x R n +, H 0 xx = 1 } = { xx S n : x R n +, x 2 1 = 1 }, { G 1 = xx G } 0 : H 1 xx = 0 = { xx S n : x R n +, H 0 xx = 1, H 1 xx = 0 }. It was shown in [1] that the constraint sets cl conv G 0 and cl conv G 1 coincide with their CPP relaxations Ĝ0 and Ĝ1, respectively, where Ĝ 0 = {X C : H 0 X = 1} = {X C : X 11 = 1}, { } Ĝ 1 = X Ĝ0 : H 1 X = 0 = {X C : H 0 X = 1, H 1 X = 0}. See heorem 3.5 of [1]. Since the objective fnctions of the problems 8 and 9 are linear with respect to X S n, 8 has the same optimal objective vale as minimize Q X sbject to X Ĝ1 = cl conv G 1, 10 and 9 has the same optimal objective vale as minimize Q + H 1 λ X sbject to X Ĝ0 = cl conv G We note that CPP 10 and QOP 4 have the eqivalent optimal vale ζ, and that both CPP 11 and QOP 5 have the optimal vale ζλ ζ. and As dal problems of 10 and 11, we have maximize y 0 sbject to Q H 0 y 0 + H 1 y 1 C, 12 maximize y 0 sbject to Q H 0 y 0 + H 1 λ C, 13 6
7 respectively. Either 12 or 13 forms a simple copositive cone programming CP. he difference is that y 1 is a variable in 12 whereas λ > 0 is a parameter to be fixed in advance in 13. As a reslt, 13 involves jst one variable. Obviosly, CPP 11 has an interior feasible soltion. By the standard dality theorem see, for examples, heorem of [14], CP 13 and CPP 11 have an eqivalent optimal vale. It is already observed that CPP 11 and QOP 5 share the common optimal vale ζλ. hs, heorem 3.1 leads to the following theorem. It shows that, nder condition a or b, 11 and 13 serve as a parametric CPP relaxation and a parametric CP relaxation, respectively, and these parametric CP and CPP relaxations bond the optimal vale ζ of QOP 4 from below by ζλ converging monotonically to ζ as λ. heorem 3.2. Assme that condition a or b holds. iv CPP 11 and QOP 5 have the eqivalent optimal vale ζλ ζ, which converges monotonically to ζ as λ. v CP 13 and QOP 5 have the eqivalent optimal vale ζλ ζ, which converges monotonically to ζ as λ. Now, we discss whether the dal 12 of CPP 10 has an optimal soltion with the same optimal objective vale ζ of CPP 10. heorem 3.3. vi rank X n rank A if X Ĝ1. vii Assme that condition a or b is satisfied. hen, the strong dality eqality between CPP 10 and CP 12 { } ζ = min Q X : X Ĝ1 = sp {y 0 : Q H 0 y 0 + H 1 y 1 C} 14 holds. Since C S n + and any X S n with rank X < n lies on the bondary of S n +, vi of heorem 3.3 implies that CPP 10 does not have an interior feasible soltion. Hence, the standard dality theorem can not be applied to the primal dal pair of 10 and 12. hs, the assertion vii is important. Proof of vi: Sppose that xx G 1. hen, x R n +, 0 = H 1 xx b b b A 0 0 = A b A + A 0 C i + C i b b b A A b A xx 0 0 0, A 0 C i + C xx 0. i It follows that xx, 0 = x b b b A A b A A x = x b A b A x. 7
8 hs, b A xx = O holds for every xx G 1. Conseqently, we have that b A X = O for every X cl conv G 1 = Ĝ1, which implies that rank X n rank b A = n rank A. Proof of vii: By assertion ii of heorem 3.2, we know that his implies the desired reslt. ζ = lim ζλ = sp max {y 0 : Q H 0 y 0 + H 1 λ C}. 0<λ λ>0 In general, 12 does not have an optimal soltion with the optimal objective vale ζ. o verify this, assme on the contrary that 12 has an optimal soltion y0, y 1 with the optimal vale y0 = ζ. Since H 1 C, y0, y 1 remains an optimal soltion with the optimal vale y0 = ζ for every y 1 y1. hs, 13 attains the optimal vale ζ for every λ > max{0, y1 }. By the weak dality relation, 11 hence 5 attains the optimal vale ζ of QOP 4 for every λ > max{0, y1 }. his contradicts what we have observed in the simple example 7. Frthermore, if we reformlate the simple problem 7 as 8, the constraint of 12 becomes y0 + y 1 1 y 1 C y 1 y 1 We can verify nmerically that if y 0 = ζ = 2, then, for any finite y 1 R, the matrix on the left side has a negative eigenvale λ with a eigenvector v > 0. hs, v 2 + y1 1 y 1 v = λv v < 0. 1 y 1 y 1 As a reslt, the matrix on the left side of 15 with y 0 = ζ = 2 can not be in C for any y 1 R. his is a direct proof for the assertion that 12 does not have an optimal soltion with the optimal vale y 0 = ζ. If y 0 < ζ = 2, then the matrix on the left side of 15 becomes positive definite for every sfficiently large y 1 > 0. hs, the strong dality eqality 14 holds. Remark 3.4. Assme that QOP 1 satisfies condition a and we know a positive constant α sch that e α for any feasible soltion of QOP 1 and the m-dimensional vector of ones e. hen, QOP 1 can be transformed into a QOP in a strictly positive qadratic form, Q 0 with all [Q 0 ] ij > 0, to be minimized over a bonded feasible region. hs, the reslting QOP satisfies condition b. We show this nder the assmption that the last component m of R m serves as a slack variable for the ineqality constraint that bonds the sm of the other components j j = 1, 2,..., m 1 by α, and that the last row of the eqality constraint A + b = 0 is of the form e α = 0. hen, for any β R and every feasible soltion of 1, Q 0 + ce α + ec α + βee = Q 0 + 2c + βα 2. hs, the objective fnction Q 0 +2c can be replaced by Q 0 + ce α + ec α + βee. aking β > 0 sfficiently large, we have a QOP in a strictly positive qadratic form. herefore, in 0 0 the relaxation problems 10, 11, 12 and 13, we can assme that Q is of the form 0 Q 0 with all [Q 0 ] ij > 0. his conversion can be sed for developing nmerical methods for the QOP 1 with a bonded feasible region in the ftre. However, it may not be nmerically efficient becase the coefficient matrix Q 0 of the reslting QOP becomes flly dense. 8
9 4 Proof of heorem 3.1 A seqence { k, λ k R m+1 : k = 1, 2,..., } is sed in the proofs of assertions i, ii and iii below sch that We note that sch a seqence always satisfies k 0, λ k > 0, 16 ζ f k, λ k = k Q 0 k + 2c k k + g k λ k. 17 A k + b A k + b 0, k i k i+r 0, 18 ζ k Q 0 k + 2c k k Proof of assertion i Assme on the contrary that Lλ is nbonded for any λ > 0. hen, λ k and k as k for some seqence { λ k, k : k = 1, 2,..., } satisfying 16 throgh 19. We may assme withot loss of generality that k / k converges to some nonzero d 0. We divide the ineqality 17 by λ k k 2 and the ineqalities in 18 by k 2, respectively, and take the limit on the reslting ineqalities as k. hen, we observe that d 0 satisfies 0 Ad Ad + d k i d k i+r, Ad Ad 0, d k i d k i+r It follows that Ad = 0 and d i = 0 i = 1, 2,..., 2r recall that A is of the form 2. Hence, + νd remains a feasible soltion of 4 for every ν 0. his can not happen if condition a is satisfied. 4.2 Proof of assertion ii Let s fix λ > 0 arbitrarily. Assme that { 0 : ζ f, λ} is nbonded. We can take a seqence { k : k = 1, 2,..., } satisfying 16 throgh 19 with λ k fixed to λ and k as k. We may assme that k / k converges to some nonzero d 0. Since Q 0 is assmed to be copositive-pls, it follows from 17 that ζ 2c k k + A k + b A k + b + k i k i+r λ, 21 and from 19 that ζ 2c k. We first divide the ineqality 21 by λ k 2, the ineqalities in 18 by k 2, and the ineqalities 19 by k 2, respectively. Next, take the limit on the reslting ineqalities and the ineqality ζ / k 2c k / k as k. hen, we obtain 20, which implies Ad = 0 and d i = 0 i = 1, 2,..., 2r, and 0 2c d. In addition, 0 d Q 0 d, which implies d Q 0 d = and Q 0 d = 0 recall that Q 0 is copositive-pls. herefore, + νd remains a feasible soltion of QOP 4 for every ν 0 and that ζ + νd Q 0 + νd + 2c + νd for every ν 0. his contradicts condition b. 9
10 4.3 Proof of assertion iii We observe that the seqence { k, λ k } satisfies 16 throgh 19 with f k, λ k = ζλ k. Let { k j : j = 1, 2,..., } be a sbseqence that converges to ū 0. From 17, ζ λ k j kj Q 0 kj + 2c k kj λ k j + g k j, g k j 0, ζ ζλ k j k j Q 0 k j + 2c k k j j = 1, 2,..., hold. aking the limit as j in the ineqality above, we have gū = 0 and ζ lim j ζλ k j ū Q 0 ū+2c ū. hs, ū is an optimal soltion of 4 and lim j ζλ k j = ζ. By 6, we also know that ζλ ζµ ζ if λ µ. Conseqently, the seqence { ζλ k } itself converges monotonically to ζ as k. 5 Conclding remarks We have proposed the three relaxations, the nconstrained QOP 5 in nonnegative variables, the CPP problem 11 and the CP problem 13. Compting an optimal soltion of any of the proposed relaxations nmerically is difficlt. As mentioned in Section 1, to develop a nmerical method for the second and third relaxations, the problem of checking whether a given matrix lies in the completely positive cone and the copositive cone needs to be resolved, respectively, which was shown in [12] as a co-np-complete problem. One practical method to overcome this difficlty is to relax the completely positive cone C by the so-called dobly nonnegative cone S n + N in 11, where N denotes the cone of n n symmetric matrices with nonnegative components. his idea of replacing C by S n + N in CPP problems has been sed in [9, 16]. Even in their cases, the reslting SDPs can not be solved efficiently when the size of variable matrix X is large becase of the n 1n/2 ineqality constraints X ij 0 1 i < j n. In particlar, the ineqality constraints make it difficlt to exploit sparsity in the SDPs, which is an effective tool to solve large scale SDPs efficiently. If we replace C by S n + N in 11, we have the following problem rewritten as an SDP, which serves as a relaxation of 11. minimize Q + H 1 λ X sbject to X 11 = 1, X ij 0 1 i < j n, X S n Note that the nmber of ineqalities is increased. As a reslt, sparsity can not be exploited efficiently, althogh it involves only a single eqality constraint X 11 = 1. o exploit sparsity in 22, we need to redce the nmber of ineqality constraints. For example, we can take K = {i, j : 1 i < j n, [Q + H 1 λ] ij 0}, expecting that K satisfies a strctred sparsity in practice, and replace the ineqality constraints by X ij 0 i, j K. Frther stdies and nmerical experiments along this direction are important sbjects of ftre research. We refer to [10, 11, 13] for exploiting sparsity in SDPs. References [1] N. Arima, S. Kim and M. Kojima. A qadratically constrained qadratic optimization model for completely positive cone programming. Research Report B-468, Department of Mathematical and Compting Sciences, okyo Institte of echnology, Oh-Okayama, Megro-k, okyo , September
11 [2] I. M. Bomze, M. Dür, E. de Klerk, C. Roos, A. Qist and. erlaky. On copositive programming and standard qadratic optimization problems. J. Global Optim., , [3] S. Brer. On the copositive representation of binary and continos non- convex qadratic programs. Math. Program., 120, , [4] S. Brer and D. Vandenbssche. Globally solving box-constrained nonconvex qadratic programs with semidefinite-based finite branch-and-bond. Compt. Optim. Appl., 43, , [5] A. P. De, P. Pardalos, G. oraldo. Qadratic programming with box constraints. In: I. M. Bomze,. Csendes, R. Horst and P. Pardalos eds. Developments in Global Optimization, pp. 73?94, [6] P. J. C. Dickinson, G. Eichfelder and J. Povh. Erratm to: On the set-semidefinite representation of nonconvex qadratic programs over arbitrary feasible sets [Optim. Letters, 2012], Optimization Online, HML/2012/09/3598.html, September [7] G. Eichfelder and J. Povh. On the set-semidefinite representation of nonconvex qadratic programs over arbitrary feasible sets, Optim. Lett., DOI /s , [8] A. V. Fiacco and G. P. McCormick. Nonlinear Programmig: Seqential Unconstrained Minimization echniqes, John Wiley and Sons, Inc [9] D. Ge and Y. Ye On Dobly Positive Semidefinite Programming Relaxations, Optimization Online, HML/2010/08/2709.html, Agst [10] M. Fkda, M. Kojima, K. Mrota and K. Nakata. Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework. SIAM J. on Optim., 11, , [11] S. Kim, M. Kojima, M. Mevissen and M. Yamashita. Exploiting Sparsity in Linear and Nonlinear Matrix Ineqalities via Positive Semidefinite Matrix Completion. Math. Program., , [12] K. G. Mrty, S. N. Kabadi, Some NP-complete problems in qadratic and non-linear programming. Math. Program., 39, , [13] K. Nakata, K. Fjisawa, M. Fkda, M. Kojima and K. Mrota. Exploiting Sparsity in Semidefinite Programming via Matrix Completion II: Implementation and Nmerical Reslts. Math. Program., 95, , [14] Y. Nesterov and A. Nemirovskii. Interior-Point Polynomial Algorithm in Convex Programming, SIAM, [15] P. Parrilo, Strctred Semidfinite Programs and Semi-algebraic Geometry Methods in Robstness and Optimization, PhD thesis, California Institte of echnology, [16] A. Yoshise and Y. Matskawa, On optimization over the dobly nonnegative cone, Proceedings of 2010 IEEE Mlti-conference on Systems and Control, 13-19,
Lagrangian-Conic Relaxations, Part I: A Unified Framework and Its Applications to Quadratic Optimization Problems
Lagrangian-Conic Relaxations, Part I: A Unified Framework and Its Applications to Quadratic Optimization Problems Naohiko Arima, Sunyoung Kim, Masakazu Kojima, and Kim-Chuan Toh Abstract. In Part I of
More informationLecture 13: Duality Uses and Correspondences
10-725/36-725: Conve Optimization Fall 2016 Lectre 13: Dality Uses and Correspondences Lectrer: Ryan Tibshirani Scribes: Yichong X, Yany Liang, Yanning Li Note: LaTeX template cortesy of UC Berkeley EECS
More informationB-468 A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
B-468 A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming Naohiko Arima, Sunyoung Kim and Masakazu Kojima September 2012 Abstract. We propose a class of quadratic
More informationThe Linear Quadratic Regulator
10 The Linear Qadratic Reglator 10.1 Problem formlation This chapter concerns optimal control of dynamical systems. Most of this development concerns linear models with a particlarly simple notion of optimality.
More informationNonlinear parametric optimization using cylindrical algebraic decomposition
Proceedings of the 44th IEEE Conference on Decision and Control, and the Eropean Control Conference 2005 Seville, Spain, December 12-15, 2005 TC08.5 Nonlinear parametric optimization sing cylindrical algebraic
More informationGradient Projection Anti-windup Scheme on Constrained Planar LTI Systems. Justin Teo and Jonathan P. How
1 Gradient Projection Anti-windp Scheme on Constrained Planar LTI Systems Jstin Teo and Jonathan P. How Technical Report ACL1 1 Aerospace Controls Laboratory Department of Aeronatics and Astronatics Massachsetts
More informationMove Blocking Strategies in Receding Horizon Control
Move Blocking Strategies in Receding Horizon Control Raphael Cagienard, Pascal Grieder, Eric C. Kerrigan and Manfred Morari Abstract In order to deal with the comptational brden of optimal control, it
More informationMixed Type Second-order Duality for a Nondifferentiable Continuous Programming Problem
heoretical Mathematics & Applications, vol.3, no.1, 13, 13-144 SSN: 179-9687 (print), 179-979 (online) Scienpress Ltd, 13 Mied ype Second-order Dality for a Nondifferentiable Continos Programming Problem.
More informationWorst-case analysis of the LPT algorithm for single processor scheduling with time restrictions
OR Spectrm 06 38:53 540 DOI 0.007/s009-06-043-5 REGULAR ARTICLE Worst-case analysis of the LPT algorithm for single processor schedling with time restrictions Oliver ran Fan Chng Ron Graham Received: Janary
More informationMAXIMUM AND ANTI-MAXIMUM PRINCIPLES FOR THE P-LAPLACIAN WITH A NONLINEAR BOUNDARY CONDITION. 1. Introduction. ν = λ u p 2 u.
2005-Ojda International Conference on Nonlinear Analysis. Electronic Jornal of Differential Eqations, Conference 14, 2006, pp. 95 107. ISSN: 1072-6691. URL: http://ejde.math.txstate.ed or http://ejde.math.nt.ed
More informationON OPTIMALITY CONDITIONS FOR ABSTRACT CONVEX VECTOR OPTIMIZATION PROBLEMS
J. Korean Math. Soc. 44 2007), No. 4, pp. 971 985 ON OPTIMALITY CONDITIONS FOR ABSTRACT CONVEX VECTOR OPTIMIZATION PROBLEMS Ge Myng Lee and Kwang Baik Lee Reprinted from the Jornal of the Korean Mathematical
More informationCRITERIA FOR TOEPLITZ OPERATORS ON THE SPHERE. Jingbo Xia
CRITERIA FOR TOEPLITZ OPERATORS ON THE SPHERE Jingbo Xia Abstract. Let H 2 (S) be the Hardy space on the nit sphere S in C n. We show that a set of inner fnctions Λ is sfficient for the prpose of determining
More informationLecture 8: September 26
10-704: Information Processing and Learning Fall 2016 Lectrer: Aarti Singh Lectre 8: September 26 Note: These notes are based on scribed notes from Spring15 offering of this corse. LaTeX template cortesy
More informationThe Replenishment Policy for an Inventory System with a Fixed Ordering Cost and a Proportional Penalty Cost under Poisson Arrival Demands
Scientiae Mathematicae Japonicae Online, e-211, 161 167 161 The Replenishment Policy for an Inventory System with a Fixed Ordering Cost and a Proportional Penalty Cost nder Poisson Arrival Demands Hitoshi
More informationOptimal Control of a Heterogeneous Two Server System with Consideration for Power and Performance
Optimal Control of a Heterogeneos Two Server System with Consideration for Power and Performance by Jiazheng Li A thesis presented to the University of Waterloo in flfilment of the thesis reqirement for
More information1 Undiscounted Problem (Deterministic)
Lectre 9: Linear Qadratic Control Problems 1 Undisconted Problem (Deterministic) Choose ( t ) 0 to Minimize (x trx t + tq t ) t=0 sbject to x t+1 = Ax t + B t, x 0 given. x t is an n-vector state, t a
More informationOn relative errors of floating-point operations: optimal bounds and applications
On relative errors of floating-point operations: optimal bonds and applications Clade-Pierre Jeannerod, Siegfried M. Rmp To cite this version: Clade-Pierre Jeannerod, Siegfried M. Rmp. On relative errors
More informationOn Multiobjective Duality For Variational Problems
The Open Operational Research Jornal, 202, 6, -8 On Mltiobjective Dality For Variational Problems. Hsain *,, Bilal Ahmad 2 and Z. Jabeen 3 Open Access Department of Mathematics, Jaypee University of Engineering
More informationSecond Order Cone Programming Relaxation of Positive Semidefinite Constraint
Research Reports on Mathematical and Computing Sciences Series B : Operations Research Department of Mathematical and Computing Sciences Tokyo Institute of Technology 2-12-1 Oh-Okayama, Meguro-ku, Tokyo
More informationAdmissibility under the LINEX loss function in non-regular case. Hidekazu Tanaka. Received November 5, 2009; revised September 2, 2010
Scientiae Mathematicae Japonicae Online, e-2012, 427 434 427 Admissibility nder the LINEX loss fnction in non-reglar case Hidekaz Tanaka Received November 5, 2009; revised September 2, 2010 Abstract. In
More informationLecture Notes On THEORY OF COMPUTATION MODULE - 2 UNIT - 2
BIJU PATNAIK UNIVERSITY OF TECHNOLOGY, ODISHA Lectre Notes On THEORY OF COMPUTATION MODULE - 2 UNIT - 2 Prepared by, Dr. Sbhend Kmar Rath, BPUT, Odisha. Tring Machine- Miscellany UNIT 2 TURING MACHINE
More informationRemarks on strongly convex stochastic processes
Aeqat. Math. 86 (01), 91 98 c The Athor(s) 01. This article is pblished with open access at Springerlink.com 0001-9054/1/010091-8 pblished online November 7, 01 DOI 10.1007/s00010-01-016-9 Aeqationes Mathematicae
More informationA Geometrical Analysis of a Class of Nonconvex Conic Programs for Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems
A Geometrical Analysis of a Class of Nonconvex Conic Programs for Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh arxiv:1901.02179v1
More informationClassify by number of ports and examine the possible structures that result. Using only one-port elements, no more than two elements can be assembled.
Jnction elements in network models. Classify by nmber of ports and examine the possible strctres that reslt. Using only one-port elements, no more than two elements can be assembled. Combining two two-ports
More informationA Single Species in One Spatial Dimension
Lectre 6 A Single Species in One Spatial Dimension Reading: Material similar to that in this section of the corse appears in Sections 1. and 13.5 of James D. Mrray (), Mathematical Biology I: An introction,
More informationOn relative errors of floating-point operations: optimal bounds and applications
On relative errors of floating-point operations: optimal bonds and applications Clade-Pierre Jeannerod, Siegfried M. Rmp To cite this version: Clade-Pierre Jeannerod, Siegfried M. Rmp. On relative errors
More informationChapter 2 Difficulties associated with corners
Chapter Difficlties associated with corners This chapter is aimed at resolving the problems revealed in Chapter, which are cased b corners and/or discontinos bondar conditions. The first section introdces
More informationA Characterization of the Domain of Beta-Divergence and Its Connection to Bregman Variational Model
entropy Article A Characterization of the Domain of Beta-Divergence and Its Connection to Bregman Variational Model Hyenkyn Woo School of Liberal Arts, Korea University of Technology and Edcation, Cheonan
More informationFREQUENCY DOMAIN FLUTTER SOLUTION TECHNIQUE USING COMPLEX MU-ANALYSIS
7 TH INTERNATIONAL CONGRESS O THE AERONAUTICAL SCIENCES REQUENCY DOMAIN LUTTER SOLUTION TECHNIQUE USING COMPLEX MU-ANALYSIS Yingsong G, Zhichn Yang Northwestern Polytechnical University, Xi an, P. R. China,
More informationOptimal Control, Statistics and Path Planning
PERGAMON Mathematical and Compter Modelling 33 (21) 237 253 www.elsevier.nl/locate/mcm Optimal Control, Statistics and Path Planning C. F. Martin and Shan Sn Department of Mathematics and Statistics Texas
More informationA generalized Alon-Boppana bound and weak Ramanujan graphs
A generalized Alon-Boppana bond and weak Ramanjan graphs Fan Chng Abstract A basic eigenvale bond de to Alon and Boppana holds only for reglar graphs. In this paper we give a generalized Alon-Boppana bond
More informationResearch Reports on Mathematical and Computing Sciences
ISSN 1342-2804 Research Reports on Mathematical and Computing Sciences Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity Hayato Waki,
More informationDecision Oriented Bayesian Design of Experiments
Decision Oriented Bayesian Design of Experiments Farminder S. Anand*, Jay H. Lee**, Matthew J. Realff*** *School of Chemical & Biomoleclar Engineering Georgia Institte of echnology, Atlanta, GA 3332 USA
More informationarxiv: v3 [gr-qc] 29 Jun 2015
QUANTITATIVE DECAY RATES FOR DISPERSIVE SOLUTIONS TO THE EINSTEIN-SCALAR FIELD SYSTEM IN SPHERICAL SYMMETRY JONATHAN LUK AND SUNG-JIN OH arxiv:402.2984v3 [gr-qc] 29 Jn 205 Abstract. In this paper, we stdy
More informationSubcritical bifurcation to innitely many rotating waves. Arnd Scheel. Freie Universitat Berlin. Arnimallee Berlin, Germany
Sbcritical bifrcation to innitely many rotating waves Arnd Scheel Institt fr Mathematik I Freie Universitat Berlin Arnimallee 2-6 14195 Berlin, Germany 1 Abstract We consider the eqation 00 + 1 r 0 k2
More informationResearch Reports on Mathematical and Computing Sciences
ISSN 1342-284 Research Reports on Mathematical and Computing Sciences Exploiting Sparsity in Linear and Nonlinear Matrix Inequalities via Positive Semidefinite Matrix Completion Sunyoung Kim, Masakazu
More informationNon-Lecture I: Linear Programming. Th extremes of glory and of shame, Like east and west, become the same.
The greatest flood has the soonest ebb; the sorest tempest the most sdden calm; the hottest love the coldest end; and from the deepest desire oftentimes enses the deadliest hate. Th extremes of glory and
More informationPower Enhancement in High Dimensional Cross-Sectional Tests
Power Enhancement in High Dimensional Cross-Sectional ests arxiv:30.3899v2 [stat.me] 6 Ag 204 Jianqing Fan, Yan Liao and Jiawei Yao Department of Operations Research and Financial Engineering, Princeton
More informationVectors in Rn un. This definition of norm is an extension of the Pythagorean Theorem. Consider the vector u = (5, 8) in R 2
MATH 307 Vectors in Rn Dr. Neal, WKU Matrices of dimension 1 n can be thoght of as coordinates, or ectors, in n- dimensional space R n. We can perform special calclations on these ectors. In particlar,
More informationRobust Tracking and Regulation Control of Uncertain Piecewise Linear Hybrid Systems
ISIS Tech. Rept. - 2003-005 Robst Tracking and Reglation Control of Uncertain Piecewise Linear Hybrid Systems Hai Lin Panos J. Antsaklis Department of Electrical Engineering, University of Notre Dame,
More informationPulses on a Struck String
8.03 at ESG Spplemental Notes Plses on a Strck String These notes investigate specific eamples of transverse motion on a stretched string in cases where the string is at some time ndisplaced, bt with a
More informationL 1 -smoothing for the Ornstein-Uhlenbeck semigroup
L -smoothing for the Ornstein-Uhlenbeck semigrop K. Ball, F. Barthe, W. Bednorz, K. Oleszkiewicz and P. Wolff September, 00 Abstract Given a probability density, we estimate the rate of decay of the measre
More informationAn improved characterisation of the interior of the completely positive cone
Electronic Journal of Linear Algebra Volume 2 Volume 2 (2) Article 5 2 An improved characterisation of the interior of the completely positive cone Peter J.C. Dickinson p.j.c.dickinson@rug.nl Follow this
More informationApproach to a Proof of the Riemann Hypothesis by the Second Mean-Value Theorem of Calculus
Advances in Pre Mathematics, 6, 6, 97- http://www.scirp.org/jornal/apm ISSN Online: 6-384 ISSN Print: 6-368 Approach to a Proof of the Riemann Hypothesis by the Second Mean-Vale Theorem of Calcls Alfred
More informationCHARACTERIZATIONS OF EXPONENTIAL DISTRIBUTION VIA CONDITIONAL EXPECTATIONS OF RECORD VALUES. George P. Yanev
Pliska Std. Math. Blgar. 2 (211), 233 242 STUDIA MATHEMATICA BULGARICA CHARACTERIZATIONS OF EXPONENTIAL DISTRIBUTION VIA CONDITIONAL EXPECTATIONS OF RECORD VALUES George P. Yanev We prove that the exponential
More informationMEAN VALUE ESTIMATES OF z Ω(n) WHEN z 2.
MEAN VALUE ESTIMATES OF z Ωn WHEN z 2 KIM, SUNGJIN 1 Introdction Let n i m pei i be the prime factorization of n We denote Ωn by i m e i Then, for any fixed complex nmber z, we obtain a completely mltiplicative
More informationA General Framework for Convex Relaxation of Polynomial Optimization Problems over Cones
Research Reports on Mathematical and Computing Sciences Series B : Operations Research Department of Mathematical and Computing Sciences Tokyo Institute of Technology 2-12-1 Oh-Okayama, Meguro-ku, Tokyo
More informationOn a class of topological groups. Key Words: topological groups, linearly topologized groups. Contents. 1 Introduction 25
Bol. Soc. Paran. Mat. (3s.) v. 24 1-2 (2006): 25 34. c SPM ISNN-00378712 On a class of topological grops Dinamérico P. Pombo Jr. abstract: A topological grop is an SNS-grop if its identity element possesses
More informationEssentials of optimal control theory in ECON 4140
Essentials of optimal control theory in ECON 4140 Things yo need to know (and a detail yo need not care abot). A few words abot dynamic optimization in general. Dynamic optimization can be thoght of as
More informationMath 273b: Calculus of Variations
Math 273b: Calcls of Variations Yacob Kreh Homework #3 [1] Consier the 1D length fnctional minimization problem min F 1 1 L, or min 1 + 2, for twice ifferentiable fnctions : [, 1] R with bonary conitions,
More informationSUBORDINATION RESULTS FOR A CERTAIN SUBCLASS OF NON-BAZILEVIC ANALYTIC FUNCTIONS DEFINED BY LINEAR OPERATOR
italian jornal of pre and applied mathematics n. 34 215 375 388) 375 SUBORDINATION RESULTS FOR A CERTAIN SUBCLASS OF NON-BAZILEVIC ANALYTIC FUNCTIONS DEFINED BY LINEAR OPERATOR Adnan G. Alamosh Maslina
More informationEfficient quadratic penalization through the partial minimization technique
This article has been accepted for pblication in a ftre isse of this jornal, bt has not been flly edited Content may change prior to final pblication Citation information: DOI 9/TAC272754474, IEEE Transactions
More informationFormules relatives aux probabilités qui dépendent de très grands nombers
Formles relatives ax probabilités qi dépendent de très grands nombers M. Poisson Comptes rends II (836) pp. 603-63 In the most important applications of the theory of probabilities, the chances of events
More informationResearch Article Permanence of a Discrete Predator-Prey Systems with Beddington-DeAngelis Functional Response and Feedback Controls
Hindawi Pblishing Corporation Discrete Dynamics in Natre and Society Volme 2008 Article ID 149267 8 pages doi:101155/2008/149267 Research Article Permanence of a Discrete Predator-Prey Systems with Beddington-DeAngelis
More informationThe Heat Equation and the Li-Yau Harnack Inequality
The Heat Eqation and the Li-Ya Harnack Ineqality Blake Hartley VIGRE Research Paper Abstract In this paper, we develop the necessary mathematics for nderstanding the Li-Ya Harnack ineqality. We begin with
More informationc 2000 Society for Industrial and Applied Mathematics
SIAM J. OPIM. Vol. 10, No. 3, pp. 750 778 c 2000 Society for Industrial and Applied Mathematics CONES OF MARICES AND SUCCESSIVE CONVEX RELAXAIONS OF NONCONVEX SES MASAKAZU KOJIMA AND LEVEN UNÇEL Abstract.
More informationSufficient Optimality Condition for a Risk-Sensitive Control Problem for Backward Stochastic Differential Equations and an Application
Jornal of Nmerical Mathematics and Stochastics, 9(1) : 48-6, 17 http://www.jnmas.org/jnmas9-4.pdf JNM@S Eclidean Press, LLC Online: ISSN 151-3 Sfficient Optimality Condition for a Risk-Sensitive Control
More informationExecution time certification for gradient-based optimization in model predictive control
Exection time certification for gradient-based optimization in model predictive control Giselsson, Ponts Pblished in: [Host pblication title missing] 2012 Link to pblication Citation for pblished version
More informationSTURM-LIOUVILLE PROBLEMS
STURM-LIOUVILLE PROBLEMS ANTON ZETTL Mathematics Department, Northern Illinois University, DeKalb, Illinois 60115. Dedicated to the memory of John Barrett. ABSTRACT. Reglar and singlar Strm-Lioville problems
More informationA generalized Alon-Boppana bound and weak Ramanujan graphs
A generalized Alon-Boppana bond and weak Ramanjan graphs Fan Chng Department of Mathematics University of California, San Diego La Jolla, CA, U.S.A. fan@csd.ed Sbmitted: Feb 0, 206; Accepted: Jne 22, 206;
More informationTyped Kleene Algebra with Products and Iteration Theories
Typed Kleene Algebra with Prodcts and Iteration Theories Dexter Kozen and Konstantinos Mamoras Compter Science Department Cornell University Ithaca, NY 14853-7501, USA {kozen,mamoras}@cs.cornell.ed Abstract
More informationElements of Coordinate System Transformations
B Elements of Coordinate System Transformations Coordinate system transformation is a powerfl tool for solving many geometrical and kinematic problems that pertain to the design of gear ctting tools and
More informationConvex Hypersurfaces of Constant Curvature in Hyperbolic Space
Srvey in Geometric Analysis and Relativity ALM 0, pp. 41 57 c Higher Edcation Press and International Press Beijing-Boston Convex Hypersrfaces of Constant Crvatre in Hyperbolic Space Bo Gan and Joel Sprck
More informationCharacterizations of probability distributions via bivariate regression of record values
Metrika (2008) 68:51 64 DOI 10.1007/s00184-007-0142-7 Characterizations of probability distribtions via bivariate regression of record vales George P. Yanev M. Ahsanllah M. I. Beg Received: 4 October 2006
More informationNetwork Coding for Multiple Unicasts: An Approach based on Linear Optimization
Network Coding for Mltiple Unicasts: An Approach based on Linear Optimization Danail Traskov, Niranjan Ratnakar, Desmond S. Ln, Ralf Koetter, and Mriel Médard Abstract In this paper we consider the application
More informationA Theory of Markovian Time Inconsistent Stochastic Control in Discrete Time
A Theory of Markovian Time Inconsistent Stochastic Control in Discrete Time Tomas Björk Department of Finance, Stockholm School of Economics tomas.bjork@hhs.se Agatha Mrgoci Department of Economics Aarhs
More informationWhen are Two Numerical Polynomials Relatively Prime?
J Symbolic Comptation (1998) 26, 677 689 Article No sy980234 When are Two Nmerical Polynomials Relatively Prime? BERNHARD BECKERMANN AND GEORGE LABAHN Laboratoire d Analyse Nmériqe et d Optimisation, Université
More informationDYNAMICAL LOWER BOUNDS FOR 1D DIRAC OPERATORS. 1. Introduction We consider discrete, resp. continuous, Dirac operators
DYNAMICAL LOWER BOUNDS FOR D DIRAC OPERATORS ROBERTO A. PRADO AND CÉSAR R. DE OLIVEIRA Abstract. Qantm dynamical lower bonds for continos and discrete one-dimensional Dirac operators are established in
More informationThe Dual of the Maximum Likelihood Method
Department of Agricltral and Resorce Economics University of California, Davis The Dal of the Maximm Likelihood Method by Qirino Paris Working Paper No. 12-002 2012 Copyright @ 2012 by Qirino Paris All
More informationStability of Model Predictive Control using Markov Chain Monte Carlo Optimisation
Stability of Model Predictive Control sing Markov Chain Monte Carlo Optimisation Elilini Siva, Pal Golart, Jan Maciejowski and Nikolas Kantas Abstract We apply stochastic Lyapnov theory to perform stability
More informationInformation Theoretic views of Path Integral Control.
Information Theoretic views of Path Integral Control. Evangelos A. Theodoro and Emannel Todorov Abstract We derive the connections of Path IntegralPI and Klback-LieblerKL control as presented in machine
More informationRELIABILITY ASPECTS OF PROPORTIONAL MEAN RESIDUAL LIFE MODEL USING QUANTILE FUNC- TIONS
RELIABILITY ASPECTS OF PROPORTIONAL MEAN RESIDUAL LIFE MODEL USING QUANTILE FUNC- TIONS Athors: N.UNNIKRISHNAN NAIR Department of Statistics, Cochin University of Science Technology, Cochin, Kerala, INDIA
More informationEXISTENCE AND FAIRNESS OF VALUE ALLOCATION WITHOUT CONVEX PREFERENCES. Nicholas C. Yanne1is. Discussion Paper No.
EXISTENCE AND FAIRNESS OF VALUE ALLOCATION WITHOUT CONVEX PREFERENCES by Nicholas C. Yanne1is Discssion Paper No. 184, Agst, 1983 Center for Economic Research Department of Economics University of Minnesota
More informationFormulas for stopped diffusion processes with stopping times based on drawdowns and drawups
Stochastic Processes and their Applications 119 (009) 563 578 www.elsevier.com/locate/spa Formlas for stopped diffsion processes with stopping times based on drawdowns and drawps Libor Pospisil, Jan Vecer,
More informationCONCERNING A CONJECTURE OF MARSHALL HALL
CONCERNING A CONJECTURE OF MARSHALL HALL RICHARD SINKHORN Introdction. An «X«matrix A is said to be dobly stochastic if Oij; = and if ï i aik = jj_i akj = 1 for all i and j. The set of «X«dobly stochastic
More informationBIOSTATISTICAL METHODS
BIOSTATISTICAL METHOS FOR TRANSLATIONAL & CLINICAL RESEARCH ROC Crve: IAGNOSTIC MEICINE iagnostic tests have been presented as alwas having dichotomos otcomes. In some cases, the reslt of the test ma be
More informationConstructive Root Bound for k-ary Rational Input Numbers
Constrctive Root Bond for k-ary Rational Inpt Nmbers Sylvain Pion, Chee Yap To cite this version: Sylvain Pion, Chee Yap. Constrctive Root Bond for k-ary Rational Inpt Nmbers. 19th Annal ACM Symposim on
More informationConditions for Approaching the Origin without Intersecting the x-axis in the Liénard Plane
Filomat 3:2 (27), 376 377 https://doi.org/.2298/fil7276a Pblished by Faclty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Conditions for Approaching
More informationThe Coset Distribution of Triple-Error-Correcting Binary Primitive BCH Codes
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 5, NO., APRIL 00 177 The Coset Distribtion of iple-error-correcting Binary Primitive BCH Codes Pascale Charpin, Member, IEEE, TorHelleseth, Fellow, IEEE, VictorA.
More informationKrauskopf, B., Lee, CM., & Osinga, HM. (2008). Codimension-one tangency bifurcations of global Poincaré maps of four-dimensional vector fields.
Kraskopf, B, Lee,, & Osinga, H (28) odimension-one tangency bifrcations of global Poincaré maps of for-dimensional vector fields Early version, also known as pre-print Link to pblication record in Explore
More informationOnline Solution of State Dependent Riccati Equation for Nonlinear System Stabilization
> REPLACE American HIS Control LINE Conference WIH YOUR PAPER IDENIFICAION NUMBER (DOUBLE-CLICK HERE O EDI) FrC3. Marriott Waterfront, Baltimore, MD, USA Jne 3-Jly, Online Soltion of State Dependent Riccati
More informationOptimal Mean-Variance Portfolio Selection
Research Report No. 14, 2013, Probab. Statist. Grop Manchester 25 pp Optimal Mean-Variance Portfolio Selection J. L. Pedersen & G. Peskir Assming that the wealth process X is generated self-financially
More informationBridging the Gap Between Multigrid, Hierarchical, and Receding-Horizon Control
Bridging the Gap Between Mltigrid, Hierarchical, and Receding-Horizon Control Victor M. Zavala Mathematics and Compter Science Division Argonne National Laboratory Argonne, IL 60439 USA (e-mail: vzavala@mcs.anl.gov).
More informationControl Systems
6.5 Control Systems Last Time: Introdction Motivation Corse Overview Project Math. Descriptions of Systems ~ Review Classification of Systems Linear Systems LTI Systems The notion of state and state variables
More informationSetting The K Value And Polarization Mode Of The Delta Undulator
LCLS-TN-4- Setting The Vale And Polarization Mode Of The Delta Undlator Zachary Wolf, Heinz-Dieter Nhn SLAC September 4, 04 Abstract This note provides the details for setting the longitdinal positions
More informationEXERCISES WAVE EQUATION. In Problems 1 and 2 solve the heat equation (1) subject to the given conditions. Assume a rod of length L.
.4 WAVE EQUATION 445 EXERCISES.3 In Problems and solve the heat eqation () sbject to the given conditions. Assme a rod of length.. (, t), (, t) (, ),, > >. (, t), (, t) (, ) ( ) 3. Find the temperatre
More informationPrediction of Transmission Distortion for Wireless Video Communication: Analysis
Prediction of Transmission Distortion for Wireless Video Commnication: Analysis Zhifeng Chen and Dapeng W Department of Electrical and Compter Engineering, University of Florida, Gainesville, Florida 326
More informationNonparametric Identification and Robust H Controller Synthesis for a Rotational/Translational Actuator
Proceedings of the 6 IEEE International Conference on Control Applications Mnich, Germany, October 4-6, 6 WeB16 Nonparametric Identification and Robst H Controller Synthesis for a Rotational/Translational
More informationModel Discrimination of Polynomial Systems via Stochastic Inputs
Model Discrimination of Polynomial Systems via Stochastic Inpts D. Georgiev and E. Klavins Abstract Systems biologists are often faced with competing models for a given experimental system. Unfortnately,
More informationOn the circuit complexity of the standard and the Karatsuba methods of multiplying integers
On the circit complexity of the standard and the Karatsba methods of mltiplying integers arxiv:1602.02362v1 [cs.ds] 7 Feb 2016 Igor S. Sergeev The goal of the present paper is to obtain accrate estimates
More informationCHANNEL SELECTION WITH RAYLEIGH FADING: A MULTI-ARMED BANDIT FRAMEWORK. Wassim Jouini and Christophe Moy
CHANNEL SELECTION WITH RAYLEIGH FADING: A MULTI-ARMED BANDIT FRAMEWORK Wassim Joini and Christophe Moy SUPELEC, IETR, SCEE, Avene de la Bolaie, CS 47601, 5576 Cesson Sévigné, France. INSERM U96 - IFR140-
More informationINTERIOR CURVATURE ESTIMATES AND THE ASYMPTOTIC PLATEAU PROBLEM IN HYPERBOLIC SPACE
INTERIOR CURVATURE ESTIMATES AND THE ASYMPTOTIC PLATEAU PROBLEM IN HYPERBOLIC SPACE BO GUAN, JOEL SPRUCK, AND LING XIAO Abstract. We show that for a very general class of crvatre fnctions defined in the
More information1. Tractable and Intractable Computational Problems So far in the course we have seen many problems that have polynomial-time solutions; that is, on
. Tractable and Intractable Comptational Problems So far in the corse we have seen many problems that have polynomial-time soltions; that is, on a problem instance of size n, the rnning time T (n) = O(n
More informationFOUNTAIN codes [3], [4] provide an efficient solution
Inactivation Decoding of LT and Raptor Codes: Analysis and Code Design Francisco Lázaro, Stdent Member, IEEE, Gianligi Liva, Senior Member, IEEE, Gerhard Bach, Fellow, IEEE arxiv:176.5814v1 [cs.it 19 Jn
More informationOPTIMUM EXPRESSION FOR COMPUTATION OF THE GRAVITY FIELD OF A POLYHEDRAL BODY WITH LINEARLY INCREASING DENSITY 1
OPTIMUM EXPRESSION FOR COMPUTATION OF THE GRAVITY FIEL OF A POLYHERAL BOY WITH LINEARLY INCREASING ENSITY 1 V. POHÁNKA2 Abstract The formla for the comptation of the gravity field of a polyhedral body
More informationThe Scalar Conservation Law
The Scalar Conservation Law t + f() = 0 = conserved qantity, f() =fl d dt Z b a (t, ) d = Z b a t (t, ) d = Z b a f (t, ) d = f (t, a) f (t, b) = [inflow at a] [otflow at b] f((a)) f((b)) a b Alberto Bressan
More informationSecond-Order Wave Equation
Second-Order Wave Eqation A. Salih Department of Aerospace Engineering Indian Institte of Space Science and Technology, Thirvananthapram 3 December 016 1 Introdction The classical wave eqation is a second-order
More informationResearch Article Uniqueness of Solutions to a Nonlinear Elliptic Hessian Equation
Applied Mathematics Volme 2016, Article ID 4649150, 5 pages http://dx.doi.org/10.1155/2016/4649150 Research Article Uniqeness of Soltions to a Nonlinear Elliptic Hessian Eqation Siyan Li School of Mathematics
More information1 The space of linear transformations from R n to R m :
Math 540 Spring 20 Notes #4 Higher deriaties, Taylor s theorem The space of linear transformations from R n to R m We hae discssed linear transformations mapping R n to R m We can add sch linear transformations
More informationCONSIDER an array of N sensors (residing in threedimensional. Investigating Hyperhelical Array Manifold Curves Using the Complex Cartan Matrix
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING (SPECIAL ISSUE), VOL.?, NO.?,???? 1 Investigating yperhelical Array Manifold Crves Using the Complex Cartan Matrix Athanassios Manikas, Senior Member,
More information