Twice Epi-Differentiability of Extended-Real-Valued Functions with Applications in Composite Optimization
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
A Note on Indicator-Functions
proceedings of the american mathematical society Volume 39, Number 1, June 1973 A NOTE ON INDICATOR-FUNCTIONS J. MYHILL Abstract. A system has the existence-property for abstracts (existence property for numbers, disjunction-property) if when- ever V(1x)A(x), M(t) for some abstract (t) (M(n) for some numeral n; if whenever VAVB, VAor hß. (3x)A(x), A,Bare closed). We show that the existence-property for numbers and the disjunc- tion property are never provable in the system itself; more strongly, the (classically) recursive functions that encode these properties are not provably recursive functions of the system. It is however possible for a system (e.g., ZF+K=L) to prove the existence- property for abstracts for itself. In [1], I presented an intuitionistic form Z of Zermelo-Frankel set- theory (without choice and with weakened regularity) and proved for it the disfunction-property (if VAvB (closed), then YA or YB), the existence- property (if \-(3x)A(x) (closed), then h4(t) for a (closed) comprehension term t) and the existence-property for numerals (if Y(3x G m)A(x) (closed), then YA(n) for a numeral n). In the appendix to [1], I enquired if these results could be proved constructively; in particular if we could find primitive recursively from the proof of AwB whether it was A or B that was provable, and likewise in the other two cases. Discussion of this question is facilitated by introducing the notion of indicator-functions in the sense of the following Definition. Let T be a consistent theory which contains Heyting arithmetic (possibly by relativization of quantifiers). -
Soft Set Theory First Results
An Inlum~md computers & mathematics PERGAMON Computers and Mathematics with Applications 37 (1999) 19-31 Soft Set Theory First Results D. MOLODTSOV Computing Center of the R~msian Academy of Sciences 40 Vavilova Street, Moscow 117967, Russia Abstract--The soft set theory offers a general mathematical tool for dealing with uncertain, fuzzy, not clearly defined objects. The main purpose of this paper is to introduce the basic notions of the theory of soft sets, to present the first results of the theory, and to discuss some problems of the future. (~) 1999 Elsevier Science Ltd. All rights reserved. Keywords--Soft set, Soft function, Soft game, Soft equilibrium, Soft integral, Internal regular- ization. 1. INTRODUCTION To solve complicated problems in economics, engineering, and environment, we cannot success- fully use classical methods because of various uncertainties typical for those problems. There are three theories: theory of probability, theory of fuzzy sets, and the interval mathematics which we can consider as mathematical tools for dealing with uncertainties. But all these theories have their own difficulties. Theory of probabilities can deal only with stochastically stable phenomena. Without going into mathematical details, we can say, e.g., that for a stochastically stable phenomenon there should exist a limit of the sample mean #n in a long series of trials. The sample mean #n is defined by 1 n IZn = -- ~ Xi, n i=l where x~ is equal to 1 if the phenomenon occurs in the trial, and x~ is equal to 0 if the phenomenon does not occur. To test the existence of the limit, we must perform a large number of trials. -
What Is Fuzzy Probability Theory?
Foundations of Physics, Vol.30,No. 10, 2000 What Is Fuzzy Probability Theory? S. Gudder1 Received March 4, 1998; revised July 6, 2000 The article begins with a discussion of sets and fuzzy sets. It is observed that iden- tifying a set with its indicator function makes it clear that a fuzzy set is a direct and natural generalization of a set. Making this identification also provides sim- plified proofs of various relationships between sets. Connectives for fuzzy sets that generalize those for sets are defined. The fundamentals of ordinary probability theory are reviewed and these ideas are used to motivate fuzzy probability theory. Observables (fuzzy random variables) and their distributions are defined. Some applications of fuzzy probability theory to quantum mechanics and computer science are briefly considered. 1. INTRODUCTION What do we mean by fuzzy probability theory? Isn't probability theory already fuzzy? That is, probability theory does not give precise answers but only probabilities. The imprecision in probability theory comes from our incomplete knowledge of the system but the random variables (measure- ments) still have precise values. For example, when we flip a coin we have only a partial knowledge about the physical structure of the coin and the initial conditions of the flip. If our knowledge about the coin were com- plete, we could predict exactly whether the coin lands heads or tails. However, we still assume that after the coin lands, we can tell precisely whether it is heads or tails. In fuzzy probability theory, we also have an imprecision in our measurements, and random variables must be replaced by fuzzy random variables and events by fuzzy events. -
Subderivative-Subdifferential Duality Formula
Subderivative-subdifferential duality formula Marc Lassonde Universit´edes Antilles, BP 150, 97159 Pointe `aPitre, France; and LIMOS, Universit´eBlaise Pascal, 63000 Clermont-Ferrand, France E-mail: [email protected] Abstract. We provide a formula linking the radial subderivative to other subderivatives and subdifferentials for arbitrary extended real-valued lower semicontinuous functions. Keywords: lower semicontinuity, radial subderivative, Dini subderivative, subdifferential. 2010 Mathematics Subject Classification: 49J52, 49K27, 26D10, 26B25. 1 Introduction Tyrrell Rockafellar and Roger Wets [13, p. 298] discussing the duality between subderivatives and subdifferentials write In the presence of regularity, the subgradients and subderivatives of a function f are completely dual to each other. [. ] For functions f that aren’t subdifferentially regular, subderivatives and subgradients can have distinct and independent roles, and some of the duality must be relinquished. Jean-Paul Penot [12, p. 263], in the introduction to the chapter dealing with elementary and viscosity subdifferentials, writes In the present framework, in contrast to the convex objects, the passages from directional derivatives (and tangent cones) to subdifferentials (and normal cones, respectively) are one-way routes, because the first notions are nonconvex, while a dual object exhibits convexity properties. In the chapter concerning Clarke subdifferentials [12, p. 357], he notes In fact, in this theory, a complete primal-dual picture is available: besides a normal cone concept, one has a notion of tangent cone to a set, and besides a subdifferential for a function one has a notion of directional derivative. Moreover, inherent convexity properties ensure a full duality between these notions. [. ]. These facts represent great arXiv:1611.04045v2 [math.OC] 5 Mar 2017 theoretical and practical advantages. -
Be Measurable Spaces. a Func- 1 1 Tion F : E G Is Measurable If F − (A) E Whenever a G
2. Measurable functions and random variables 2.1. Measurable functions. Let (E; E) and (G; G) be measurable spaces. A func- 1 1 tion f : E G is measurable if f − (A) E whenever A G. Here f − (A) denotes the inverse!image of A by f 2 2 1 f − (A) = x E : f(x) A : f 2 2 g Usually G = R or G = [ ; ], in which case G is always taken to be the Borel σ-algebra. If E is a topological−∞ 1space and E = B(E), then a measurable function on E is called a Borel function. For any function f : E G, the inverse image preserves set operations ! 1 1 1 1 f − A = f − (A ); f − (G A) = E f − (A): i i n n i ! i [ [ 1 1 Therefore, the set f − (A) : A G is a σ-algebra on E and A G : f − (A) E is f 2 g 1 f ⊆ 2 g a σ-algebra on G. In particular, if G = σ(A) and f − (A) E whenever A A, then 1 2 2 A : f − (A) E is a σ-algebra containing A and hence G, so f is measurable. In the casef G = R, 2the gBorel σ-algebra is generated by intervals of the form ( ; y]; y R, so, to show that f : E R is Borel measurable, it suffices to show −∞that x 2E : f(x) y E for all y. ! f 2 ≤ g 2 1 If E is any topological space and f : E R is continuous, then f − (U) is open in E and hence measurable, whenever U is op!en in R; the open sets U generate B, so any continuous function is measurable. -
Techniques of Variational Analysis
J. M. Borwein and Q. J. Zhu Techniques of Variational Analysis An Introduction October 8, 2004 Springer Berlin Heidelberg NewYork Hong Kong London Milan Paris Tokyo To Tova, Naomi, Rachel and Judith. To Charles and Lilly. And in fond and respectful memory of Simon Fitzpatrick (1953-2004). Preface Variational arguments are classical techniques whose use can be traced back to the early development of the calculus of variations and further. Rooted in the physical principle of least action they have wide applications in diverse ¯elds. The discovery of modern variational principles and nonsmooth analysis further expand the range of applications of these techniques. The motivation to write this book came from a desire to share our pleasure in applying such variational techniques and promoting these powerful tools. Potential readers of this book will be researchers and graduate students who might bene¯t from using variational methods. The only broad prerequisite we anticipate is a working knowledge of un- dergraduate analysis and of the basic principles of functional analysis (e.g., those encountered in a typical introductory functional analysis course). We hope to attract researchers from diverse areas { who may fruitfully use varia- tional techniques { by providing them with a relatively systematical account of the principles of variational analysis. We also hope to give further insight to graduate students whose research already concentrates on variational analysis. Keeping these two di®erent reader groups in mind we arrange the material into relatively independent blocks. We discuss various forms of variational princi- ples early in Chapter 2. We then discuss applications of variational techniques in di®erent areas in Chapters 3{7. -
Expectation and Functions of Random Variables
POL 571: Expectation and Functions of Random Variables Kosuke Imai Department of Politics, Princeton University March 10, 2006 1 Expectation and Independence To gain further insights about the behavior of random variables, we first consider their expectation, which is also called mean value or expected value. The definition of expectation follows our intuition. Definition 1 Let X be a random variable and g be any function. 1. If X is discrete, then the expectation of g(X) is defined as, then X E[g(X)] = g(x)f(x), x∈X where f is the probability mass function of X and X is the support of X. 2. If X is continuous, then the expectation of g(X) is defined as, Z ∞ E[g(X)] = g(x)f(x) dx, −∞ where f is the probability density function of X. If E(X) = −∞ or E(X) = ∞ (i.e., E(|X|) = ∞), then we say the expectation E(X) does not exist. One sometimes write EX to emphasize that the expectation is taken with respect to a particular random variable X. For a continuous random variable, the expectation is sometimes written as, Z x E[g(X)] = g(x) d F (x). −∞ where F (x) is the distribution function of X. The expectation operator has inherits its properties from those of summation and integral. In particular, the following theorem shows that expectation preserves the inequality and is a linear operator. Theorem 1 (Expectation) Let X and Y be random variables with finite expectations. 1. If g(x) ≥ h(x) for all x ∈ R, then E[g(X)] ≥ E[h(X)]. -
More on Discrete Random Variables and Their Expectations
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2018 Lecture 6 MORE ON DISCRETE RANDOM VARIABLES AND THEIR EXPECTATIONS Contents 1. Comments on expected values 2. Expected values of some common random variables 3. Covariance and correlation 4. Indicator variables and the inclusion-exclusion formula 5. Conditional expectations 1COMMENTSON EXPECTED VALUES (a) Recall that E is well defined unless both sums and [X] x:x<0 xpX (x) E x:x>0 xpX (x) are infinite. Furthermore, [X] is well-defined and finite if and only if both sums are finite. This is the same as requiring! that ! E[|X|]= |x|pX (x) < ∞. x " Random variables that satisfy this condition are called integrable. (b) Noter that fo any random variable X, E[X2] is always well-defined (whether 2 finite or infinite), because all the terms in the sum x x pX (x) are nonneg- ative. If we have E[X2] < ∞,we say that X is square integrable. ! (c) Using the inequality |x| ≤ 1+x 2 ,wehave E [|X|] ≤ 1+E[X2],which shows that a square integrable random variable is always integrable. Simi- larly, for every positive integer r,ifE [|X|r] is finite then it is also finite for every l<r(fill details). 1 Exercise 1. Recall that the r-the central moment of a random variable X is E[(X − E[X])r].Showthat if the r -th central moment of an almost surely non-negative random variable X is finite, then its l-th central moment is also finite for every l<r. (d) Because of the formula var(X)=E[X2] − (E[X])2,wesee that: (i) if X is square integrable, the variance is finite; (ii) if X is integrable, but not square integrable, the variance is infinite; (iii) if X is not integrable, the variance is undefined. -
Proximal Analysis and Boundaries of Closed Sets in Banach Space Part Ii: Applications
Can. J. Math., Vol. XXXIX, No. 2, 1987, pp. 428-472 PROXIMAL ANALYSIS AND BOUNDARIES OF CLOSED SETS IN BANACH SPACE PART II: APPLICATIONS J. M. BORWEIN AND H. M. STROJWAS Introduction. This paper is a direct continuation of the article "Proximal analysis and boundaries of closed sets in Banach space, Part I: Theory", by the same authors. It is devoted to a detailed analysis of applications of the theory presented in the first part and of its limitations. 5. Applications in geometry of normed spaces. Theorem 2.1 has important consequences for geometry of Banach spaces. We start the presentation with a discussion of density and existence of improper points (Definition 1.3) for closed sets in Banach spaces. Our considerations will be based on the "lim inf ' inclusions proven in the first part of our paper. Ti IEOREM 5.1. If C is a closed subset of a Banach space E, then the K-proper points of C are dense in the boundary of C. Proof If x is in the boundary of C, for each r > 0 we may find y £ C with \\y — 3c|| < r. Theorem 2.1 now shows that Kc(xr) ^ E for some xr e C with II* - *,ll ^ 2r. COROLLARY 5.1. ( [2] ) If C is a closed convex subset of a Banach space E, then the support points of C are dense in the boundary of C. Proof. Since for any convex set C and x G C we have Tc(x) = Kc(x) = Pc(x) = P(C - x) = WTc(x) = WKc(x) = WPc(x\ the /^-proper points of C at x, where Rc(x) is any one of the above cones, are exactly the support points. -
POST-OLYMPIAD PROBLEMS (1) Evaluate ∫ Cos2k(X)Dx Using Combinatorics. (2) (Putnam) Suppose That F : R → R Is Differentiable
POST-OLYMPIAD PROBLEMS MARK SELLKE R 2π 2k (1) Evaluate 0 cos (x)dx using combinatorics. (2) (Putnam) Suppose that f : R ! R is differentiable, and that for all q 2 Q we have f 0(q) = f(q). Need f(x) = cex for some c? 1 1 (3) Show that the random sum ±1 ± 2 ± 3 ::: defines a conditionally convergent series with probability 1. 2 (4) (Jacob Tsimerman) Does there exist a smooth function f : R ! R with a unique critical point at 0, such that 0 is a local minimum but not a global minimum? (5) Prove that if f 2 C1([0; 1]) and for each x 2 [0; 1] there is n = n(x) with f (n) = 0, then f is a polynomial. 2 2 (6) (Stanford Math Qual 2018) Prove that the operator χ[a0;b0]Fχ[a1;b1] from L ! L is always compact. Here if S is a set, χS is multiplication by the indicator function 1S. And F is the Fourier transform. (7) Let n ≥ 4 be a positive integer. Show there are no non-trivial solutions in entire functions to f(z)n + g(z)n = h(z)n. (8) Let x 2 Sn be a random point on the unit n-sphere for large n. Give first-order asymptotics for the largest coordinate of x. (9) Show that almost sure convergence is not equivalent to convergence in any topology on random variables. P1 xn (10) (Noam Elkies on MO) Show that n=0 (n!)α is positive for any α 2 (0; 1) and any real x. -
10.0 Lesson Plan
10.0 Lesson Plan 1 Answer Questions • Robust Estimators • Maximum Likelihood Estimators • 10.1 Robust Estimators Previously, we claimed to like estimators that are unbiased, have minimum variance, and/or have minimum mean squared error. Typically, one cannot achieve all of these properties with the same estimator. 2 An estimator may have good properties for one distribution, but not for n another. We saw that n−1 Z, for Z the sample maximum, was excellent in estimating θ for a Unif(0,θ) distribution. But it would not be excellent for estimating θ when, say, the density function looks like a triangle supported on [0,θ]. A robust estimator is one that works well across many families of distributions. In particular, it works well when there may be outliers in the data. The 10% trimmed mean is a robust estimator of the population mean. It discards the 5% largest and 5% smallest observations, and averages the rest. (Obviously, one could trim by some fraction other than 10%, but this is a commonly-used value.) Surveyors distinguish errors from blunders. Errors are measurement jitter 3 attributable to chance effects, and are approximately Gaussian. Blunders occur when the guy with the theodolite is standing on the wrong hill. A trimmed mean throws out the blunders and averages the good data. If all the data are good, one has lost some sample size. But in exchange, you are protected from the corrosive effect of outliers. 10.2 Strategies for Finding Estimators Some economists focus on the method of moments. This is a terrible procedure—its only virtue is that it is easy. -
Overview of Measure Theory
Overview of Measure Theory January 14, 2013 In this section, we will give a brief overview of measure theory, which leads to a general notion of an integral called the Lebesgue integral. Integrals, as we saw before, are important in probability theory since the notion of expectation or average value is an integral. The ideas presented in this theory are fairly general, but their utility will not be immediately visible. However, a general note is that we are trying to quantify how \small" or how \large" a set is. Recall that if a bounded function has only finitely many discontinuities, it is still Riemann-integrable. The Dirichlet function was an example of a function with uncountably many discontinuities, and it failed to be Riemann-integrable. Is there a notion of \smallness" such that if a function is bounded except for a small set, then we can compute its integral? For example, we could say a set is \small" on the real line if it has at most countably infinitely many elements. Unfortunately, this is not enough to deal with the integral of the Dirichlet function. So we need a notion adequate to deal with the integral of functions such as the Dirichlet function. We will deal with such a notion of integral in this section. It allows us to prove a fairly general theorem called the \Dominated Convergence Theorem", which does not hold for the Riemann integral, and is useful for some of the results in our course. The general outline is the following - first, we deal with a notion of the class of measurable sets, which will restrict the sets whose size we can speak of.