The Uniformity Principle: A New Tool for. Probabilistic Robustness Analysis. B. R. Barmish and C. M. Lagoa. further discussion.
|
|
- Morris Flowers
- 6 years ago
- Views:
Transcription
1 The Uniformity Principle A New Tool for Probabilistic Robustness Analysis B. R. Barmish and C. M. Lagoa Department of Electrical and Computer Engineering University of Wisconsin-Madison, Madison, WI Abstract This paper provides a new mathematical framework for analysis of control systems which are operated with admissible values of uncertain parameters which exceed the bounds specied by classical robustness theory. In such a case, it is important to quantify the tradeos between risk of performance degradation and increased tolerance of uncertainty. If a large increase in the uncertainty bound can be established, an acceptably small risk may often be justied. Since robustness problem formulations do not include statistical descriptions of the uncertainty, the question arises whether it is possible to provide such assurances in a \distribution-free" manner. In other words, if F denotes a class of admissible probability distributions for the uncertainty X, we seek some worstcase f 2 F having the following property The probability of performance satisfaction under f is smaller than the probability under any other f 2 F. Said another way, f provides the best possible guarantee. Within this new framework, the main result, Theorem 2., is called the Uniformity Principle. To apply this theorem, we require the uncertain parameters X i to be zero-mean independent random variables with known support interval. For each uncertainty X i, the class F is assumed to consist of density functions f i (x i ) which are symmetric and non-increasing with respect to jx i j. Then, for a given symmetric target X for X, the Uniformity Principle indicates the probability X is in X is minimized by the uniform distribution for X. The interpretation of this result in a feedback control context is given in [].. Introduction This paper provides the mathematical underpinnings associated with a new approach to robustness problems; see [] for a full exposition in a controltheoretic framework. The main result, which we call the Uniformity Principle, facilitates probabilistic assessment of systems in a so-called \distribution-free" manner. That is, without having a detailed statistical description of the uncertain parameters, we want to make a worst-case probabilistic assessment some performance specication is satised. Although it may seem ad hoc to assume a uniform distribution when statistical information about the uncertain parameters is unavailable, the Uniformity Principle justies such an assumption under rather mild conditions on the \shape" of the underlying density functions. For more general cases than those covered by the Theorem 2.2 to follow, it is also proven a class of truncated uniform distributions leads to the worst case. However, for this more general nonlinear problem class, the results of this paper should be viewed as preliminary because the truncation points for these distributions are not characterized; see Section 3 for further discussion. The problem setup in the next section is reminiscent of the formulation of Huber [2] in the eld of statistics. In contrast to his distributional robustness formulation, however, robustness motivation dictates almost no apriori information about the \shape" of the underlying density functions should be assumed. if X i denotes the i-th uncertain parameter, we do not take its density f i as a contamination of some other known density. Instead, it is only assumed f i (x i ) is symmetric and nonincreasing with respect to jx i j. If one interprets the results of this paper in a control framework, there is consistency with the work of [3]-[6]. The key dierence between the framework of this paper and these references is simple to explain In [3]-[5], since sampling of the X i is involved, a choice of density function for each parameter is required. In this regard, the results in this paper can be interpreted to say the uniform sampling of each X i is the \right" way to proceed. That is, probabilities which are estimated using a uniform distribution are \tight" in the sense the do not underestimate the true risk. In [6], cases are identied for which a worst-case distribution turns out to be impulsive. In contrast with this paper, the results in [6] require an adequate number of uncertain parameters so the hypotheses associated with the Central Limit Theorem are satised. For a problem with xed input data, it often turns out the central limit predictor is not justied, but use of the uniform distribution is nevertheless correct. In other words, under the assumptions to follow, the uniform distribution is seen to be the worst case independently of the number of uncertain parameters. Finally, numerical results obtained in [] support a conclusion reached in [3]-[6]. That is, there are many cases for which one can operate well above the classical robustness margin while keeping the risk of performance violation very small. 2. Formulation and Main Result In this section, the main objective is to establish the so-called Uniformity Principle. Its proof is given
2 with the help of a number of preliminary lemmas. 2. Preliminary Notation Throughout this section, X = (X ; X 2 ; ; X`) is taken to be a a vector of independent zero-mean random variables. For each X i, the support is supp X i = [?; ] the support for X is the unit cube in R` which is denoted by B. Now, consistent with the discussion in Section, a density function f i (x i ) is said to be admissible for X i if it is symmetric and nonincreasing with respect to jx i j. The class of admissible density functions for each X i is denoted by F. Finally, when f 2 F is written for a joint density function f(x ; x 2 ; ; x`) = f (x )f 2 (x 2 ) f`(x`); the understanding is each marginal f i is in F. The density function for the uniform distribution u is expressed in terms of its marginals u(x ; x 2 ; ; x`) = u (x )u 2 (x 2 ) u`(x`) When it needs to be made clear a density function f is attached to X, the notation X f is used with i-th component X f;i. 2.2 The Uniformity Principle (See Section 2.6 for Proof) Let X be closed convex symmetric set in R` with center x 0 = 0. Then it follows min f2f ProbfX f 2 X g = ProbfX u 2 X g 2.3 Notation for Supporting Lemmas In order to establish the Uniformity Principle, some notation associated with the proof is introduced. First, the standard notation I is used to denote the indicator function of a set ; i.e., I () = for 2 and I () = 0 otherwise. In the sequel, `() denotes the classical Lebesgue measure of a set R`. When a lower-dimensional volume measure is required, the following convention is used If is a (`? )-dimensional subset of R`, then `? () is the volume of with respect to R`?. Now, two subsets of F are dened The notation F s is used to denote the class of piecewise-constant (simple) density functions f 2 F which, for > 0, can be expressed as f() = k I [ N ; N k )() for some positive integer N. Note being a density function forces the k 0. Furthermore, the non-increasing condition for membership in F dictates 2 N ; and the requirement f integrates to unity forces k = N 2 Now, the class of truncated uniform distributions is denoted by U T. More precisely, a joint density function u t (x ; x 2 ; ; x`) = u t; (x )u t;2 (x 2 ) u t;`(x`) is in U T if there exist positive constants t ; t 2 ; ; t` such u t;i (x i ) = I (?ti;t 2t i)(x i ) i for i = ; 2; ; `. Note the special case of uniform distribution corresponds to all t i =. Finally, to conclude this subsection, we summarize by noting u 2 U T F s F The objective of the next three lemmas is to establish ProbfX f 2 X g can be minimized by restricting our attention to truncated uniform distributions in U T. To this end, a \rst principles" development is provided. Note, however, a more direct and less elementary route to Lemma 2.6 is possible by expressing densities f 2 F as continuous mixtures of densities in U T. 2.4 Lemma Let X be a closed set in R`. Then inf f2f ProbfX f 2 X g = inf ProbfX fs 2 X g f s2f s Proof In order to prove the lemma, it suces to show for any density f 2 F and any > 0, there exists some f s 2 F s such ProbfX fs 2 X g ProbfX f 2 X g + This being the case, the conclusion of the lemma follows by taking the inmum on both sides above. The desired density f s above is now constructed. Indeed, since the i-th component f i of the joint density f(x ; x 2 ; ; x`) = f (x )f 2 (x 2 ) f`(x`) is integrable and non-increasing, it is Riemann integrable. Hence, with F? i (k; N) = lim f i (x i ) x i" N k for each positive integer N and k 2 f; 2; ; N g, each of the lower Riemann sums converges. That is, F i (N) = 2 N F? i (k; N) lim N! F i(n) = f i ()d =? there exists a positive integer N enough so with it follows F (N) = F (N)F 2 (N) F`(N); 0? F (N) < 2 large For the remainder of the proof, N is held xed. This denes the partitions of [?; ] which enables construction of the desired density function f s 2 F s. Indeed, we claim for x i > 0 and f s;i (?x i ) = f s;i (x i ), the marginals of f s dened by f s;i (x i ) = F i (N) F? i (k; N)I [ N ; k N )(x i)
3 are in F s. To prove this claim, it is rst noted for x i 0, the non-increasing property for each f i (x i ) implies for k 2 > k, F? i (k 2; N) F? i (k ; N) Hence, f s;i 2 F s for i = ; 2; ; `. To complete the proof of the lemma, with B denoting the unit cube, it suces to show ProbfX fs 2 X g = f s dx f dx + = ProbfX f 2 X g + with the understanding the integrals above are over subsets of R`. The denition of N is now used in combination with the fact the approximation to f dened by ^f s;i (x i ) = F i (N)f s;i (x i ) satises f i (x i ) ^f s;i (x i ) for x i 0. This leads to the chain of inequalities (f? f s ) dx jf? ^f j dx + B (f? ^f) dx +? F (N) = 2(? F (N)) < (f s? ^f) dx The next lemma involves simple concepts about linear functions and linear inequalities. 2.5 Lemma Let = ( ; 2 ; ; m ) 2 R m and assume a ; a 2 ; ; a m are real scalars. Then, the problem of minimizing the linear function subject to () = mx i= a i i 2 m 0 and m = is solved by one of the m vectors () ; (2) ; ; (m) given by (k) i = 8 < k for i = ; 2; ; k; 0 otherwise Proof From the theory of convex analysis (for example, see [8]), it is well known a linear function on a polytope is maximized at an extreme point. Now, it is straightforward to verify the linear inequality constraints for generate a polytope whose extreme points are a subset of the list of (k) above. 2.6 Lemma Let X be a closed set in R`. Then inf f2f ProbfX f 2 X g = inf ProbfX ut 2 X g u t2u T Proof In view of Lemma 2.4, it suces to prove the following Given any f s 2 F s, there exists some u t 2 U T such ProbfX ut 2 X g ProbfX fs 2 X g Hence f s 2 F s is taken as xed and its density is expressed as f s (x ; x 2 ; ; x`) = f s; (x )f s;2 (x 2 ) f s;`(x`) with piecewise-constant components of the form f s;i (x i ) = XN i for x i 0, with ik 0 and XN i ik I [ N i ; k N i ) (x i) ik = N i 2 for i = ; 2; ; `. Now, to minimize the probability of inclusion in X, an optimization with respect to the ik is set up. That is, a set of ik is sought which minimizes the probability X fs 2 X. To complete the proof of the lemma, it suces to x all ik with index i > and prove the half-probability () = XN X k I [ N ; kn )(x )f s;2 (x 2 ) f s;`(x`)dx is minimized by a set of f k g corresponding to a truncated uniform distribution in the class U T. Note once the result is proven for the rst component f s;, it can be repeated for the remaining components f s;2 ; f s;3 ; ; f s;`. The desired minimum above is now established by invoking Lemma 2.5. That is, with scalars a k = I [ N ; kn )(x )f s;2 (x 2 ) f s;`(x`)dx X for k = ; 2; ; N, modulo scaling, the function () = XN a k k and the constraints on the k satisfy the hypotheses of Lemma Lemma (Brunn{Minkowski; see [7]) Let A and B be compact sets in R k and dene = fa + (? )b a 2 A; b 2 Bg C for 2 [0; ]. Then with Lebesgue measure k (C ) = the function h() = [ k (C )] k C dx; is concave. We establish the next lemma via application of the Brunn{Minkowski result above. The reader is reminded about the convention used for (`? )-dimensional volume measures in R`; see Section 2.3.
4 2.8 Lemma Let X be a compact convex symmetric set in R` with center x 0 = 0. Dene sections X i () = fx = (x ; x 2 ; ; x`) 2 X x i = g for i = ; 2; ; ` and assume is real. ` 2, each of the functions g i () = `? (X i ()) Then, for is non-increasing for 0 and non-decreasing for 0. Proof The result is established for i =, and it is noted an identical proof can be used for the other sections. In addition, only 0 is considered because symmetry of X implies an identical proof can be used for 0. 2 > 0 is xed and we claim g ( ) g ( 2 ). To prove this, dene the (`? )-dimensional sets ~X() = f~x 2 R`? (; ~x) 2 X g and observe for any 0, Now, for 2 [0; ], let `? ( ~ X ()) = `? (X ()) ~X = ~ X (2 ) + (? ) ~ X (?2 ); and make the following identications with Lemma 2.7 A ~ X ( 2 ); B ~ X (? 2 ); C ~ X ; h() [`? ( X ~ )] `? Since X is symmetric with center x 0 = 0 then h(0) = h(). Moreover, by Lemma 2.7, h() is concave. h() h() for all 2 [0; ]. Now, we x = = and observe = 2?(? ) 2. Furthermore, since X is convex, the inclusion X ( ) X ( 2 ) + (? )X (? 2 ) leads to ~X ( ) ~ X = ~ X (2 ) + (? ) ~ X (? 2 ) `? ( ~ X ( )) `? ( ~ X ) Now, monotonicity of `? for 0 implies [`? ( ~ X ( ))] `? [`? ( ~ X )] `? = h( ) h() = [`? ( ~ X( 2 ))] `? `? (X ( )) = `? ( ~ X ( )) `? ( ~ X (2 )) = `? (X ( 2 )) Equivalently, it follows g ( ) g ( 2 ). 2.9 Proof of the Uniformity Principle In view of Lemma 2.6, only truncated uniform distributions u t = (u t; ; u t;2 ; ; u t;`) 2 U T are considered. Letting (?t i ; t i ) denote the support of u t;i, an optimization problem in the variable t = (t ; t 2 ; ; t`) is set up. To prove the Uniformity Principle, it must be shown the truncation vector t = t = (; ; ; ; ) minimizes ProbfX ut 2 X g with respect to t 2 B. To establish t is the minimizer, it suces to prove the minimizer has rst co-ordinate t = t = ; if this fact is established, the same argument can be repeated for t 2 ; t 3 ; ; t`. t = is treated as a variable and t i = t i is xed for i = 2; 3; ; `. Now with t = (; t2 ; t 3 ; ; t`), we claim the function '() = ProbfX ut 2 X g is minimized by =. To prove this claim, observe '() = I (?;) (x )I 2`t 2 t 3 (x (?t2;t2) 2) t` X I (x`)dx (?t`;t`) dx` In order to complete the proof, the integral above is re-written in a form which makes application of Lemma 2.8 transparent. To this end, we dene the symmetric convex set = fx 2 X jxi j t i for i = 2; 3; ; `g; X t the hyperplanes = f(x ; x 2 ; ; x`) x = g H and the function g() = 2`? `? (H \ X t 2 t 3 t ) t` for ; 2 [0; ] and ` 2. For the degenerate case ` =, the simpler formula g() = 2 I X () is used. Then, with this notation, the integral dening '() reduces to '() = 8 < g(0) for = 0; R 0 g()d otherwise Moreover, for ` 2, Lemma 2.8 guarantees g() is non-increasing. For ` =, the convexity of X leads to the same guarantee. It is now clear '() is precisely equal to the average value of the function g() over the interval [0; ]. Since g() is nonincreasing, this average is minimized when is maximal; i.e., = minimizes '(). 3. Conclusions and Further Research In this section, some extensions and renements of the theory are presented and new directions for research are discussed. The results in this paper suggest some obvious continuations. Of foremost interest
5 For a large class of nonlinear functions of independent random variables, the worst-case corresponds to a truncated uniform distribution in the class U T. This leads to two problems of immediate interest First, suppose the support of the i-th marginal u t;i 2 U T is denoted by (?t i ; t i ) [?; ]. Then, it would be important to characterize the truncation points t i. If these scalars can be readily computed, it becomes possible to implement eective Monte Carlo solutions to a number of problems which are known to be NPhard when analyzed in a more traditional framework. It might even turn out for the scenario in the subsection above, there is a large class of problems for which all t i =. In other words, no truncation is required and the uniform distribution emerges again as the worst-case. A limited number of experiments to date lead us to conjecture this may indeed be true for a rich class of multilinear uncertainty structures and targets. If this proves to be the case, then more general versions of the Uniformity Principle (see Section 2) could also be established. Another direction for future work involves elimination of the symmetry requirement associated with distributions f 2 F. To this end, if the denition of U T is modied to allow asymmetric truncations, the statement of Lemma 2.6 remains intact. In other words, the worst-case distribution has i-th component u t;i which has one constant value over an interval of the form [?t? i ; 0] and possibly a dierent value over an interval of the form [0; t + i ]. It appears also possible to embellish a number of the results in this paper so as to accommodate additional apriori information about the class of density functions F. To illustrate, suppose F is now the set of all admissible density functions whose decay rate satises certain constraints. Then, it is possible to modify the technical results in this paper to take this information into account. There are many additional open future research problems associated with taking more apriori information into account. To conclude, note the results in this paper enable us to take a new approach in the analysis of uncertain dynamical systems. Often, one can operate well above the robusteness margin given by classical methods and still expect robust stability and/or performance with high condence levels. References [] Barmish, B. R. and C. M. Lagoa (995). \The Uniform Distribution A Rigorous Justication for its Use in Robustness Analysis," Technical Report ECE{ 95{2, Department of Electrical and Computer Engineering, University of Wisconsin-Madison. [2] Huber, P. J. (98). Robust Statistics, John Wiley & Sons, New York. [3] Stengel, R. F. and L. R. Ray (99). \Stochastic Robustness of Linear Time-Invariant Systems," IEEE Transactions on Automatic Control, AC-36, pp [4] Ray, L. R. and R. F. Stengel (993). \A Monte Carlo Approach to the Analysis of Control Systems Robustness," Automatica, vol. 3, pp [5] Tempo, R., E. W. Bai (995). \Robustness Analysis with Nonlinear Parametric Uncertainty A Probabilistic Approach," CENS-CNR Report, Politecnico di Torino. [6] Barmish, B. R., B. T. Polyak (996). \A New Approach to Open Robustness Problems Based on Probabilistic Prediction Formulae." Submitted to IFAC World Congress, San Francisco, California. [7] Berger, M. (987). Geometry, Springer-Verlag, Berlin, New York. [8] Rockafellar, R. T. (970). Convex Analysis, Princeton University Press, Princeton. Acknowledgements This research was supported by the U.S.National Science Foundation under Grant Number ECS and by funds of JNICT-Portugal. The authors express their thanks to Professors Rajeev Agrawal and John Gubner for a number of discussions about this work. In addition, gratitude is expressed to Professors Victor Klee and Carsten Schuett for pointing out relevant references associated with the Brunn{Minkowski theory and Saeed Asgari for extensive comments about the readability of the manuscript.
A Worst-Case Estimate of Stability Probability for Engineering Drive
A Worst-Case Estimate of Stability Probability for Polynomials with Multilinear Uncertainty Structure Sheila R. Ross and B. Ross Barmish Department of Electrical and Computer Engineering University of
More informationProceedings of the 34th Annual Conference on Information Sciences and Systems (CISS 2000), Princeton, New Jersey, March, 2000
2000 Conference on Information Sciences and Systems, Princeton University, March 15-17, 2000 Proceedings of the 34th Annual Conference on Information Sciences and Systems (CISS 2000), Princeton, New Jersey,
More informationATYPICAL Monte Carlo simulation for a circuit begins
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: REGULAR PAPERS, VOL. 53, NO. 6, JUNE 2006 1289 A New Monte Carlo Circuit Simulation Paradigm With Specific Results for Resistive Networks Houssain Kettani B.
More information3.1 Basic properties of real numbers - continuation Inmum and supremum of a set of real numbers
Chapter 3 Real numbers The notion of real number was introduced in section 1.3 where the axiomatic denition of the set of all real numbers was done and some basic properties of the set of all real numbers
More informationRichard DiSalvo. Dr. Elmer. Mathematical Foundations of Economics. Fall/Spring,
The Finite Dimensional Normed Linear Space Theorem Richard DiSalvo Dr. Elmer Mathematical Foundations of Economics Fall/Spring, 20-202 The claim that follows, which I have called the nite-dimensional normed
More informationStochastic dominance with imprecise information
Stochastic dominance with imprecise information Ignacio Montes, Enrique Miranda, Susana Montes University of Oviedo, Dep. of Statistics and Operations Research. Abstract Stochastic dominance, which is
More informationOptimal Rejuvenation for. Tolerating Soft Failures. Andras Pfening, Sachin Garg, Antonio Puliato, Miklos Telek, Kishor S. Trivedi.
Optimal Rejuvenation for Tolerating Soft Failures Andras Pfening, Sachin Garg, Antonio Puliato, Miklos Telek, Kishor S. Trivedi Abstract In the paper we address the problem of determining the optimal time
More information2 C. A. Gunter ackground asic Domain Theory. A poset is a set D together with a binary relation v which is reexive, transitive and anti-symmetric. A s
1 THE LARGEST FIRST-ORDER-AXIOMATIZALE CARTESIAN CLOSED CATEGORY OF DOMAINS 1 June 1986 Carl A. Gunter Cambridge University Computer Laboratory, Cambridge C2 3QG, England Introduction The inspiration for
More informationRearrangements and polar factorisation of countably degenerate functions G.R. Burton, School of Mathematical Sciences, University of Bath, Claverton D
Rearrangements and polar factorisation of countably degenerate functions G.R. Burton, School of Mathematical Sciences, University of Bath, Claverton Down, Bath BA2 7AY, U.K. R.J. Douglas, Isaac Newton
More informationON STATISTICAL INFERENCE UNDER ASYMMETRIC LOSS. Abstract. We introduce a wide class of asymmetric loss functions and show how to obtain
ON STATISTICAL INFERENCE UNDER ASYMMETRIC LOSS FUNCTIONS Michael Baron Received: Abstract We introduce a wide class of asymmetric loss functions and show how to obtain asymmetric-type optimal decision
More informationNull controllable region of LTI discrete-time systems with input saturation
Automatica 38 (2002) 2009 2013 www.elsevier.com/locate/automatica Technical Communique Null controllable region of LTI discrete-time systems with input saturation Tingshu Hu a;, Daniel E. Miller b,liqiu
More informationRobust linear optimization under general norms
Operations Research Letters 3 (004) 50 56 Operations Research Letters www.elsevier.com/locate/dsw Robust linear optimization under general norms Dimitris Bertsimas a; ;, Dessislava Pachamanova b, Melvyn
More informationMaster of Arts In Mathematics
ESTIMATING THE FRACTAL DIMENSION OF SETS DETERMINED BY NONERGODIC PARAMETERS A thesis submitted to the faculty of San Francisco State University In partial fulllment of The Requirements for The Degree
More informationStochastic Nonlinear Stabilization Part II: Inverse Optimality Hua Deng and Miroslav Krstic Department of Mechanical Engineering h
Stochastic Nonlinear Stabilization Part II: Inverse Optimality Hua Deng and Miroslav Krstic Department of Mechanical Engineering denghua@eng.umd.edu http://www.engr.umd.edu/~denghua/ University of Maryland
More informationMARIA GIRARDI Fact 1.1. For a bounded linear operator T from L 1 into X, the following statements are equivalent. (1) T is Dunford-Pettis. () T maps w
DENTABILITY, TREES, AND DUNFORD-PETTIS OPERATORS ON L 1 Maria Girardi University of Illinois at Urbana-Champaign Pacic J. Math. 148 (1991) 59{79 Abstract. If all bounded linear operators from L1 into a
More informationGarrett: `Bernstein's analytic continuation of complex powers' 2 Let f be a polynomial in x 1 ; : : : ; x n with real coecients. For complex s, let f
1 Bernstein's analytic continuation of complex powers c1995, Paul Garrett, garrettmath.umn.edu version January 27, 1998 Analytic continuation of distributions Statement of the theorems on analytic continuation
More informationINVERSE LIMITS WITH SET VALUED FUNCTIONS. 1. Introduction
INVERSE LIMITS WITH SET VALUED FUNCTIONS VAN NALL Abstract. We begin to answer the question of which continua in the Hilbert cube can be the inverse limit with a single upper semi-continuous bonding map
More informationIN THIS paper we will consider nonlinear systems of the
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 44, NO. 1, JANUARY 1999 3 Robust Stabilization of Nonlinear Systems Pointwise Norm-Bounded Uncertainties: A Control Lyapunov Function Approach Stefano Battilotti,
More informationrad/sec
In this chapter we present Kharitonov's Theorem on robust Hurwitz stability of interval polynomials, dealing with both the real and complex cases This elegant result forms the basis for many of the results,
More informationNovel Approach to Analysis of Nonlinear Recursions. 1 Department of Physics, Bar-Ilan University, Ramat-Gan, ISRAEL
Novel Approach to Analysis of Nonlinear Recursions G.Berkolaiko 1 2, S. Rabinovich 1,S.Havlin 1 1 Department of Physics, Bar-Ilan University, 529 Ramat-Gan, ISRAEL 2 Department of Mathematics, Voronezh
More informationThe subject of this paper is nding small sample spaces for joint distributions of
Constructing Small Sample Spaces for De-Randomization of Algorithms Daphne Koller Nimrod Megiddo y September 1993 The subject of this paper is nding small sample spaces for joint distributions of n Bernoulli
More informationPower Calculations for Preclinical Studies Using a K-Sample Rank Test and the Lehmann Alternative Hypothesis
Power Calculations for Preclinical Studies Using a K-Sample Rank Test and the Lehmann Alternative Hypothesis Glenn Heller Department of Epidemiology and Biostatistics, Memorial Sloan-Kettering Cancer Center,
More informationGaussian Estimation under Attack Uncertainty
Gaussian Estimation under Attack Uncertainty Tara Javidi Yonatan Kaspi Himanshu Tyagi Abstract We consider the estimation of a standard Gaussian random variable under an observation attack where an adversary
More informationSUBSPACES OF COMPUTABLE VECTOR SPACES
SUBSPACES OF COMPUTABLE VECTOR SPACES RODNEY G. DOWNEY, DENIS R. HIRSCHFELDT, ASHER M. KACH, STEFFEN LEMPP, JOSEPH R. MILETI, AND ANTONIO MONTALB AN Abstract. We show that the existence of a nontrivial
More informationExponential stability of families of linear delay systems
Exponential stability of families of linear delay systems F. Wirth Zentrum für Technomathematik Universität Bremen 28334 Bremen, Germany fabian@math.uni-bremen.de Keywords: Abstract Stability, delay systems,
More informationLinear Systems with Saturating Controls: An LMI Approach. subject to control saturation. No assumption is made concerning open-loop stability and no
Output Feedback Robust Stabilization of Uncertain Linear Systems with Saturating Controls: An LMI Approach Didier Henrion 1 Sophie Tarbouriech 1; Germain Garcia 1; Abstract : The problem of robust controller
More informationWinter Lecture 10. Convexity and Concavity
Andrew McLennan February 9, 1999 Economics 5113 Introduction to Mathematical Economics Winter 1999 Lecture 10 Convexity and Concavity I. Introduction A. We now consider convexity, concavity, and the general
More informationLEBESGUE INTEGRATION. Introduction
LEBESGUE INTEGATION EYE SJAMAA Supplementary notes Math 414, Spring 25 Introduction The following heuristic argument is at the basis of the denition of the Lebesgue integral. This argument will be imprecise,
More informationMethods for a Class of Convex. Functions. Stephen M. Robinson WP April 1996
Working Paper Linear Convergence of Epsilon-Subgradient Descent Methods for a Class of Convex Functions Stephen M. Robinson WP-96-041 April 1996 IIASA International Institute for Applied Systems Analysis
More informationSOME MEASURABILITY AND CONTINUITY PROPERTIES OF ARBITRARY REAL FUNCTIONS
LE MATEMATICHE Vol. LVII (2002) Fasc. I, pp. 6382 SOME MEASURABILITY AND CONTINUITY PROPERTIES OF ARBITRARY REAL FUNCTIONS VITTORINO PATA - ALFONSO VILLANI Given an arbitrary real function f, the set D
More informationApproximation Algorithms for Maximum. Coverage and Max Cut with Given Sizes of. Parts? A. A. Ageev and M. I. Sviridenko
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts? A. A. Ageev and M. I. Sviridenko Sobolev Institute of Mathematics pr. Koptyuga 4, 630090, Novosibirsk, Russia fageev,svirg@math.nsc.ru
More informationSTOCHASTIC DIFFERENTIAL EQUATIONS WITH EXTRA PROPERTIES H. JEROME KEISLER. Department of Mathematics. University of Wisconsin.
STOCHASTIC DIFFERENTIAL EQUATIONS WITH EXTRA PROPERTIES H. JEROME KEISLER Department of Mathematics University of Wisconsin Madison WI 5376 keisler@math.wisc.edu 1. Introduction The Loeb measure construction
More informationON SCALAR CONSERVATION LAWS WITH POINT SOURCE AND STEFAN DIEHL
ON SCALAR CONSERVATION LAWS WITH POINT SOURCE AND DISCONTINUOUS FLUX FUNCTION STEFAN DIEHL Abstract. The conservation law studied is @u(x;t) + @ F u(x; t); x @t @x = s(t)(x), where u is a f(u); x > 0 concentration,
More informationStructural Grobner Basis. Bernd Sturmfels and Markus Wiegelmann TR May Department of Mathematics, UC Berkeley.
I 1947 Center St. Suite 600 Berkeley, California 94704-1198 (510) 643-9153 FAX (510) 643-7684 INTERNATIONAL COMPUTER SCIENCE INSTITUTE Structural Grobner Basis Detection Bernd Sturmfels and Markus Wiegelmann
More informationMMSE Dimension. snr. 1 We use the following asymptotic notation: f(x) = O (g(x)) if and only
MMSE Dimension Yihong Wu Department of Electrical Engineering Princeton University Princeton, NJ 08544, USA Email: yihongwu@princeton.edu Sergio Verdú Department of Electrical Engineering Princeton University
More informationOn Kusuoka Representation of Law Invariant Risk Measures
MATHEMATICS OF OPERATIONS RESEARCH Vol. 38, No. 1, February 213, pp. 142 152 ISSN 364-765X (print) ISSN 1526-5471 (online) http://dx.doi.org/1.1287/moor.112.563 213 INFORMS On Kusuoka Representation of
More informationFor later use we dene a constraint-set Z k utilizing an expression for the state predictor Z k (x k )=fz k =( k k ): k 2 ^ k 2 ^ k = F k ( k x k )g 8
IDENTIFICATION AND CONVEITY IN OPTIMIZING CONTROL Bjarne A. Foss Department of Engineering Cybernetics, Norwegian University of Science and Technology, N-734 Trondheim, Norway. Email: baf@itk.unit.no Tor
More informationFUNCTIONAL COMPRESSION-EXPANSION FIXED POINT THEOREM
Electronic Journal of Differential Equations, Vol. 28(28), No. 22, pp. 1 12. ISSN: 172-6691. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu (login: ftp) FUNCTIONAL
More informationDimensionality in the Stability of the Brunn-Minkowski Inequality: A blessing or a curse?
Dimensionality in the Stability of the Brunn-Minkowski Inequality: A blessing or a curse? Ronen Eldan, Tel Aviv University (Joint with Bo`az Klartag) Berkeley, September 23rd 2011 The Brunn-Minkowski Inequality
More informationLinear Regression and Its Applications
Linear Regression and Its Applications Predrag Radivojac October 13, 2014 Given a data set D = {(x i, y i )} n the objective is to learn the relationship between features and the target. We usually start
More informationSolutions Final Exam May. 14, 2014
Solutions Final Exam May. 14, 2014 1. (a) (10 points) State the formal definition of a Cauchy sequence of real numbers. A sequence, {a n } n N, of real numbers, is Cauchy if and only if for every ɛ > 0,
More informationProblem Description The problem we consider is stabilization of a single-input multiple-state system with simultaneous magnitude and rate saturations,
SEMI-GLOBAL RESULTS ON STABILIZATION OF LINEAR SYSTEMS WITH INPUT RATE AND MAGNITUDE SATURATIONS Trygve Lauvdal and Thor I. Fossen y Norwegian University of Science and Technology, N-7 Trondheim, NORWAY.
More informationSpecial Classes of Fuzzy Integer Programming Models with All-Dierent Constraints
Transaction E: Industrial Engineering Vol. 16, No. 1, pp. 1{10 c Sharif University of Technology, June 2009 Special Classes of Fuzzy Integer Programming Models with All-Dierent Constraints Abstract. K.
More informationAPPROXIMATE SOLUTION OF A SYSTEM OF LINEAR EQUATIONS WITH RANDOM PERTURBATIONS
APPROXIMATE SOLUTION OF A SYSTEM OF LINEAR EQUATIONS WITH RANDOM PERTURBATIONS P. Date paresh.date@brunel.ac.uk Center for Analysis of Risk and Optimisation Modelling Applications, Department of Mathematical
More informationQuantum logics with given centres and variable state spaces Mirko Navara 1, Pavel Ptak 2 Abstract We ask which logics with a given centre allow for en
Quantum logics with given centres and variable state spaces Mirko Navara 1, Pavel Ptak 2 Abstract We ask which logics with a given centre allow for enlargements with an arbitrary state space. We show in
More informationWorst-Case Violation of Sampled Convex Programs for Optimization with Uncertainty
Worst-Case Violation of Sampled Convex Programs for Optimization with Uncertainty Takafumi Kanamori and Akiko Takeda Abstract. Uncertain programs have been developed to deal with optimization problems
More informationOn the Stabilization of Neutrally Stable Linear Discrete Time Systems
TWCCC Texas Wisconsin California Control Consortium Technical report number 2017 01 On the Stabilization of Neutrally Stable Linear Discrete Time Systems Travis J. Arnold and James B. Rawlings Department
More informationMarch 16, Abstract. We study the problem of portfolio optimization under the \drawdown constraint" that the
ON PORTFOLIO OPTIMIZATION UNDER \DRAWDOWN" CONSTRAINTS JAKSA CVITANIC IOANNIS KARATZAS y March 6, 994 Abstract We study the problem of portfolio optimization under the \drawdown constraint" that the wealth
More informationElementary 2-Group Character Codes. Abstract. In this correspondence we describe a class of codes over GF (q),
Elementary 2-Group Character Codes Cunsheng Ding 1, David Kohel 2, and San Ling Abstract In this correspondence we describe a class of codes over GF (q), where q is a power of an odd prime. These codes
More informationCitation for published version (APA): van der Vlerk, M. H. (1995). Stochastic programming with integer recourse [Groningen]: University of Groningen
University of Groningen Stochastic programming with integer recourse van der Vlerk, Maarten Hendrikus IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to
More informationOn It^o's formula for multidimensional Brownian motion
On It^o's formula for multidimensional Brownian motion by Hans Follmer and Philip Protter Institut fur Mathemati Humboldt-Universitat D-99 Berlin Mathematics and Statistics Department Purdue University
More informationThe iterative convex minorant algorithm for nonparametric estimation
The iterative convex minorant algorithm for nonparametric estimation Report 95-05 Geurt Jongbloed Technische Universiteit Delft Delft University of Technology Faculteit der Technische Wiskunde en Informatica
More informationOptimal Sojourn Time Control within an Interval 1
Optimal Sojourn Time Control within an Interval Jianghai Hu and Shankar Sastry Department of Electrical Engineering and Computer Sciences University of California at Berkeley Berkeley, CA 97-77 {jianghai,sastry}@eecs.berkeley.edu
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More information(1.) For any subset P S we denote by L(P ) the abelian group of integral relations between elements of P, i.e. L(P ) := ker Z P! span Z P S S : For ea
Torsion of dierentials on toric varieties Klaus Altmann Institut fur reine Mathematik, Humboldt-Universitat zu Berlin Ziegelstr. 13a, D-10099 Berlin, Germany. E-mail: altmann@mathematik.hu-berlin.de Abstract
More informationSUM x. 2x y x. x y x/2. (i)
Approximate Majorization and Fair Online Load Balancing Ashish Goel Adam Meyerson y Serge Plotkin z July 7, 2000 Abstract This paper relates the notion of fairness in online routing and load balancing
More informationpercentage of problems with ( 1 lb/ub ) <= x percentage of problems with ( 1 lb/ub ) <= x n= n=8 n= n=32 n= log10( x )
Soft vs. Hard Bounds in Probabilistic Robustness Analysis Xiaoyun Zhu Yun Huang John Doyle California Institute of Technology, Pasadena, CA 925 Abstract The relationship between soft vs. hard bounds and
More informationOptimization Problems with Probabilistic Constraints
Optimization Problems with Probabilistic Constraints R. Henrion Weierstrass Institute Berlin 10 th International Conference on Stochastic Programming University of Arizona, Tucson Recommended Reading A.
More informationA CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE
Journal of Applied Analysis Vol. 6, No. 1 (2000), pp. 139 148 A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE A. W. A. TAHA Received
More informationDivision of the Humanities and Social Sciences. Supergradients. KC Border Fall 2001 v ::15.45
Division of the Humanities and Social Sciences Supergradients KC Border Fall 2001 1 The supergradient of a concave function There is a useful way to characterize the concavity of differentiable functions.
More informationFractional Roman Domination
Chapter 6 Fractional Roman Domination It is important to discuss minimality of Roman domination functions before we get into the details of fractional version of Roman domination. Minimality of domination
More informationf(z)dz = 0. P dx + Qdy = D u dx v dy + i u dy + v dx. dxdy + i x = v
MA525 ON CAUCHY'S THEOREM AND GREEN'S THEOREM DAVID DRASIN (EDITED BY JOSIAH YODER) 1. Introduction No doubt the most important result in this course is Cauchy's theorem. Every critical theorem in the
More informationCongurations of periodic orbits for equations with delayed positive feedback
Congurations of periodic orbits for equations with delayed positive feedback Dedicated to Professor Tibor Krisztin on the occasion of his 60th birthday Gabriella Vas 1 MTA-SZTE Analysis and Stochastics
More informationRICE UNIVERSITY. System Identication for Robust Control. Huipin Zhang. A Thesis Submitted. in Partial Fulfillment of the. Requirements for the Degree
RICE UNIVERSITY System Identication for Robust Control by Huipin Zhang A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree Master of Science Approved, Thesis Committee: Athanasios
More informationProbabilistic Optimal Estimation and Filtering
Probabilistic Optimal Estimation and Filtering Least Squares and Randomized Algorithms Fabrizio Dabbene 1 Mario Sznaier 2 Roberto Tempo 1 1 CNR - IEIIT Politecnico di Torino 2 Northeastern University Boston
More informationOn the Design of Robust Controllers for Arbitrary Uncertainty Structures
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 48, NO., NOVEMBER 003 06 On the Design of Robust Controllers for Arbitrary Uncertainty Structures Constantino M. Lagoa, Xiang Li, and Mario Snaier Abstract
More informationThe ϵ-capacity of a gain matrix and tolerable disturbances: Discrete-time perturbed linear systems
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 11, Issue 3 Ver. IV (May - Jun. 2015), PP 52-62 www.iosrjournals.org The ϵ-capacity of a gain matrix and tolerable disturbances:
More informationWidely applicable periodicity results for higher order di erence equations
Widely applicable periodicity results for higher order di erence equations István Gy½ori, László Horváth Department of Mathematics University of Pannonia 800 Veszprém, Egyetem u. 10., Hungary E-mail: gyori@almos.uni-pannon.hu
More informationPARAMETERIZATION OF MODEL VALIDATING SETS FOR UNCERTAINTY BOUND OPTIMIZATIONS. K.B. Lim, D.P. Giesy y. NASA Langley Research Center.
PARAMETERIZATION OF MODEL VALIDATING SETS FOR UNCERTAINTY BOUND OPTIMIZATIONS KB Lim, DP Giesy y NASA Langley Research Center Hampton, Virginia Abstract Given experimental data and a priori assumptions
More informationApplied Mathematics 505b January 22, Today Denitions, survey of applications. Denition A PDE is an equation of the form F x 1 ;x 2 ::::;x n ;~u
Applied Mathematics 505b January 22, 1998 1 Applied Mathematics 505b Partial Dierential Equations January 22, 1998 Text: Sobolev, Partial Dierentail Equations of Mathematical Physics available at bookstore
More information2 Garrett: `A Good Spectral Theorem' 1. von Neumann algebras, density theorem The commutant of a subring S of a ring R is S 0 = fr 2 R : rs = sr; 8s 2
1 A Good Spectral Theorem c1996, Paul Garrett, garrett@math.umn.edu version February 12, 1996 1 Measurable Hilbert bundles Measurable Banach bundles Direct integrals of Hilbert spaces Trivializing Hilbert
More informationMathematical Institute, University of Utrecht. The problem of estimating the mean of an observed Gaussian innite-dimensional vector
On Minimax Filtering over Ellipsoids Eduard N. Belitser and Boris Y. Levit Mathematical Institute, University of Utrecht Budapestlaan 6, 3584 CD Utrecht, The Netherlands The problem of estimating the mean
More informationRobust Optimization for Risk Control in Enterprise-wide Optimization
Robust Optimization for Risk Control in Enterprise-wide Optimization Juan Pablo Vielma Department of Industrial Engineering University of Pittsburgh EWO Seminar, 011 Pittsburgh, PA Uncertainty in Optimization
More information1 Introduction This work follows a paper by P. Shields [1] concerned with a problem of a relation between the entropy rate of a nite-valued stationary
Prexes and the Entropy Rate for Long-Range Sources Ioannis Kontoyiannis Information Systems Laboratory, Electrical Engineering, Stanford University. Yurii M. Suhov Statistical Laboratory, Pure Math. &
More informationAverage Reward Parameters
Simulation-Based Optimization of Markov Reward Processes: Implementation Issues Peter Marbach 2 John N. Tsitsiklis 3 Abstract We consider discrete time, nite state space Markov reward processes which depend
More informationCharacterising FS domains by means of power domains
Theoretical Computer Science 264 (2001) 195 203 www.elsevier.com/locate/tcs Characterising FS domains by means of power domains Reinhold Heckmann FB 14 Informatik, Universitat des Saarlandes, Postfach
More informationOptimal Reinsurance Strategy with Bivariate Pareto Risks
University of Wisconsin Milwaukee UWM Digital Commons Theses and Dissertations May 2014 Optimal Reinsurance Strategy with Bivariate Pareto Risks Evelyn Susanne Gaus University of Wisconsin-Milwaukee Follow
More informationTo appear in Optimization Methods and Software DISCRIMINATION OF TWO LINEARLY INSEPARABLE SETS. Computer Sciences Department, University of Wisconsin,
To appear in Optimization Methods and Software ROBUST LINEAR PROGRAMMING DISCRIMINATION OF TWO LINEARLY INSEPARABLE SETS KRISTIN P. BENNETT and O. L. MANGASARIAN Computer Sciences Department, University
More informationWEAK LOWER SEMI-CONTINUITY OF THE OPTIMAL VALUE FUNCTION AND APPLICATIONS TO WORST-CASE ROBUST OPTIMAL CONTROL PROBLEMS
WEAK LOWER SEMI-CONTINUITY OF THE OPTIMAL VALUE FUNCTION AND APPLICATIONS TO WORST-CASE ROBUST OPTIMAL CONTROL PROBLEMS ROLAND HERZOG AND FRANK SCHMIDT Abstract. Sufficient conditions ensuring weak lower
More informationLinear Codes, Target Function Classes, and Network Computing Capacity
Linear Codes, Target Function Classes, and Network Computing Capacity Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, and Kenneth Zeger IEEE Transactions on Information Theory Submitted:
More informationA Representation of Excessive Functions as Expected Suprema
A Representation of Excessive Functions as Expected Suprema Hans Föllmer & Thomas Knispel Humboldt-Universität zu Berlin Institut für Mathematik Unter den Linden 6 10099 Berlin, Germany E-mail: foellmer@math.hu-berlin.de,
More information2 S. FELSNER, W. T. TROTTER S. S. Kislitsyn [9] made the following conjecture, which remains of the most intriguing problems in the combinatorial theo
COLLOQUIA MATHEMATICA SOCIETATIS J ANOS BOLYA I 64. COMBINATORICS, KESZTHELY (HUNGARY), 1993 Balancing Pairs in Partially Ordered Sets S. FELSNER 1 and W. T. TROTTER Dedicated to Paul Erdos on his eightieth
More informationDisturbance Attenuation Properties for Discrete-Time Uncertain Switched Linear Systems
Disturbance Attenuation Properties for Discrete-Time Uncertain Switched Linear Systems Hai Lin Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556, USA Panos J. Antsaklis
More informationExpressions for the covariance matrix of covariance data
Expressions for the covariance matrix of covariance data Torsten Söderström Division of Systems and Control, Department of Information Technology, Uppsala University, P O Box 337, SE-7505 Uppsala, Sweden
More information1 Introduction Future high speed digital networks aim to serve integrated trac, such as voice, video, fax, and so forth. To control interaction among
On Deterministic Trac Regulation and Service Guarantees: A Systematic Approach by Filtering Cheng-Shang Chang Dept. of Electrical Engineering National Tsing Hua University Hsinchu 30043 Taiwan, R.O.C.
More informationResearch Article Convex Polyhedron Method to Stability of Continuous Systems with Two Additive Time-Varying Delay Components
Applied Mathematics Volume 202, Article ID 689820, 3 pages doi:0.55/202/689820 Research Article Convex Polyhedron Method to Stability of Continuous Systems with Two Additive Time-Varying Delay Components
More informationConvex Analysis and Economic Theory AY Elementary properties of convex functions
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory AY 2018 2019 Topic 6: Convex functions I 6.1 Elementary properties of convex functions We may occasionally
More informationComonotonicity and Maximal Stop-Loss Premiums
Comonotonicity and Maximal Stop-Loss Premiums Jan Dhaene Shaun Wang Virginia Young Marc J. Goovaerts November 8, 1999 Abstract In this paper, we investigate the relationship between comonotonicity and
More informationTHE GENERALIZED RIEMANN INTEGRAL ON LOCALLY COMPACT SPACES. Department of Computing. Imperial College. 180 Queen's Gate, London SW7 2BZ.
THE GENEALIED IEMANN INTEGAL ON LOCALLY COMPACT SPACES Abbas Edalat Sara Negri Department of Computing Imperial College 180 Queen's Gate, London SW7 2B Abstract We extend the basic results on the theory
More informationL 2 -induced Gains of Switched Systems and Classes of Switching Signals
L 2 -induced Gains of Switched Systems and Classes of Switching Signals Kenji Hirata and João P. Hespanha Abstract This paper addresses the L 2-induced gain analysis for switched linear systems. We exploit
More informationA Forgery Attack on the Candidate LTE Integrity Algorithm 128-EIA3 (updated version)
A Forgery Attack on the Candidate LTE Integrity Algorithm 128-EIA3 (updated version) Thomas Fuhr, Henri Gilbert, Jean-René Reinhard, and Marion Videau ANSSI, France Abstract In this note we show that the
More informationMatematicas Aplicadas. c1998 Universidad de Chile A CONVERGENT TRANSFER SCHEME TO THE. Av. Ejercito de Los Andes 950, 5700 San Luis, Argentina.
Rev. Mat. Apl. 19:23-35 Revista de Matematicas Aplicadas c1998 Universidad de Chile Departamento de Ingeniera Matematica A CONVERGENT TRANSFER SCHEME TO THE CORE OF A TU-GAME J.C. CESCO Instituto de Matematica
More informationConvexity in R n. The following lemma will be needed in a while. Lemma 1 Let x E, u R n. If τ I(x, u), τ 0, define. f(x + τu) f(x). τ.
Convexity in R n Let E be a convex subset of R n. A function f : E (, ] is convex iff f(tx + (1 t)y) (1 t)f(x) + tf(y) x, y E, t [0, 1]. A similar definition holds in any vector space. A topology is needed
More informationOn nonexpansive and accretive operators in Banach spaces
Available online at www.isr-publications.com/jnsa J. Nonlinear Sci. Appl., 10 (2017), 3437 3446 Research Article Journal Homepage: www.tjnsa.com - www.isr-publications.com/jnsa On nonexpansive and accretive
More informationDefining the Integral
Defining the Integral In these notes we provide a careful definition of the Lebesgue integral and we prove each of the three main convergence theorems. For the duration of these notes, let (, M, µ) be
More informationThe best expert versus the smartest algorithm
Theoretical Computer Science 34 004 361 380 www.elsevier.com/locate/tcs The best expert versus the smartest algorithm Peter Chen a, Guoli Ding b; a Department of Computer Science, Louisiana State University,
More informationNecessary and Sufficient Conditions for Reachability on a Simplex
Necessary and Sufficient Conditions for Reachability on a Simplex Bartek Roszak a, Mireille E. Broucke a a Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto,
More information1. Introduction Let the least value of an objective function F (x), x2r n, be required, where F (x) can be calculated for any vector of variables x2r
DAMTP 2002/NA08 Least Frobenius norm updating of quadratic models that satisfy interpolation conditions 1 M.J.D. Powell Abstract: Quadratic models of objective functions are highly useful in many optimization
More informationNumerical Solution of Hybrid Fuzzy Dierential Equation (IVP) by Improved Predictor-Corrector Method
Available online at http://ijim.srbiau.ac.ir Int. J. Industrial Mathematics Vol. 1, No. 2 (2009)147-161 Numerical Solution of Hybrid Fuzzy Dierential Equation (IVP) by Improved Predictor-Corrector Method
More informationTopological vectorspaces
(July 25, 2011) Topological vectorspaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ Natural non-fréchet spaces Topological vector spaces Quotients and linear maps More topological
More information