DOCSLIB.ORG

Applied Functional Analysis and Its Applications • Jen-Chih Yao and Shahram Rezapour Applied Functional Analysis and Its Applications

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Applied Functional Analysis and Its Applications • Jen-Chih and Shahram Yao Rezapour Applied Functional Analysis and Its Applications Edited by Jen-Chih Yao and Shahram Rezapour Printed Edition of the Special Issue Published in Mathematics www.mdpi.com/journal/mathematics Applied Functional Analysis and Its Applications Applied Functional Analysis and Its Applications Editors Jen-Chih Yao Shahram Rezapour MDPI • Basel • Beijing • Wuhan • Barcelona • Belgrade • Manchester • Tokyo • Cluj • Tianjin Editors Jen-Chih Yao Shahram Rezapour China Medical University Hospital Azerbaijan Shahid Madani China University Iran China Medical University China Medical University Taiwan Taiwan Editorial Office MDPI St. Alban-Anlage 66 4052 Basel, Switzerland This is a reprint of articles from the Special Issue published online in the open access journal Mathematics (ISSN 2227-7390) (available at: https://www.mdpi.com/journal/mathematics/special issues/Applied Functional Analysis Its Applications). For citation purposes, cite each article independently as indicated on the article page online and as indicated below: LastName, A.A.; LastName, B.B.; LastName, C.C. Article Title. Journal Name Year, Article Number, Page Range. ISBN 978-3-03936-776-4 (Hbk) ISBN 978-3-03936-777-1 (PDF) c 2020 by the authors. Articles in this book are Open Access and distributed under the Creative Commons Attribution (CC BY) license, which allows users to download, copy and build upon published articles, as long as the author and publisher are properly credited, which ensures maximum dissemination and a wider impact of our publications. The book as a whole is distributed by MDPI under the terms and conditions of the Creative Commons license CC BY-NC-ND. Contents About the Editors .............................................. vii Preface to ”Applied Functional Analysis and Its Applications” ................... ix Hsien-Chung Wu Informal Norm in Hyperspace and Its Topological Structure Reprinted from: Mathematics 2019, 7, 945, doi:10.3390/math7100945 ................. 1 Bing Tan, Shanshan Xu and Songxiao Li Modified Inertial Hybrid and Shrinking Projection Algorithms for Solving Fixed Point Problems Reprinted from: Mathematics 2020, 8, 236, doi:10.3390/math8020236 ................. 21 Jong Soo Jung Convergence Theorems for Modified Implicit Iterative Methods with Perturbation for Pseudocontractive Mappings Reprinted from: Mathematics 2020, 8, 72, doi:10.3390/math8010072 ................. 33 Jin Liang and Yunyi Mu Properties for ψ-Fractional Integrals Involving a General Function ψ and Applications Reprinted from: Mathematics 2019, 7, 517, doi:10.3390/math7060517 ................. 49 Badr Alqahtani, Hassen Aydi, Erdal Karapınar and Vladimir Rakoˇcevi´c A Solution for Volterra Fractional Integral Equations by Hybrid Contractions Reprinted from: Mathematics 2019, 7, 694, doi:10.3390/math7080694 ................. 63 Yinglin Luo, Bing Tan and Meijuan Shang A General Inertial Viscosity Type Method for Nonexpansive Mappings and Its Applications in Signal Processing Reprinted from: Mathematics 2020, 8, 288, doi:10.3390/math8020288 ................. 73 Lu-Chuan Ceng, Adrian Petru¸sel , Ching-Feng Wen and Jen-Chih Yao Inertial-Like Subgradient Extragradient Methods for Variational Inequalities and Fixed Points of Asymptotically Nonexpansive and Strictly Pseudocontractive Mappings Reprinted from: Mathematics 2019, 7, 860, doi:10.3390/math7090860 ................. 91 Lu-Chuan Ceng, Adrian Petru¸sel and Jen-Chih Yao On Mann Viscosity Subgradient Extragradient Algorithms for Fixed Point Problems of Finitely Many Strict Pseudocontractions and Variational Inequalities Reprinted from: Mathematics 2019, 7, 925, doi:10.3390/math7100925 .................111 Syed Shakaib Irfan, Mijanur Rahaman, Iqbal Ahmad, Rais Ahmadand Saddam Husain Generalized Nonsmooth Exponential-Type Vector Variational-Like Inequalities and Nonsmooth Vector Optimization Problems in Asplund Spaces Reprinted from: Mathematics 2019, 7, 345, doi:10.3390/math7040345 .................125 Liu He, Qi-Lin Wang, Ching-Feng Wen, Xiao-Yan Zhang and Xiao-Bing Li A Kind of New Higher-Order Mond-Weir Type Duality for Set-Valued Optimization Problems Reprinted from: Mathematics 2019, 7, 372, doi:10.3390/math7040372 .................137 v Elisabeth Kobis,¨ Markus A. Kobis¨ and Xiaolong Qin An Inequality Approach to Approximate Solutions of Set Optimization Problems in Real Linear Spaces Reprinted from: Mathematics 2020, 8, 143, doi:10.3390/math8010143 .................155 vi About the Editors Jen-Chih Yao (Professor) is Chair Professor of the Center for General Education at China University (Taiwan) and Director of the Research Center for Interneural Computing, China Medical University Hospital, China Medical University. He has published numerous papers in different fields (e.g., variational inequalities, complementarity problems, fixed point theorems, variational analysis, optimization, vector optimization problems, etc.). He is the editor-in-chief and a member of the editorial board of several journals. He was also the chairman of the organizing and scientific committees of several international conferences and workshops on nonlinear analysis and optimization. His name has been included on lists of highly cited researchers in 2014, 2015, 2016, 2017, 2018, and 2019. Shahram Rezapour (Professor) is a professor of mathematics at Azarbaijan Shahid Madani University (Iran). He simultaneously holds a visiting professor position at China Medical University (Taiwan). He has published numerous papers on different fields (e.g., approximation theory, fixed point theory, fractional integro-differential equations and inclusions, finite differences, numerical and approximate solutions of singular fractional differential equations, stability, and optimization). He is a member of the editorial boards of several journals. He was also the chairman of the organizing and scientific committees of several international conferences. His name has been included on lists of highly cited researchers in 2016 and 2017. vii Preface to ”Applied Functional Analysis and Its Applications” It is well known that applied functional analysis is very important in most applied research fields and its influence has grown in recent decades. Many novel works have used techniques, ideas, notions, and methods of applied functional analysis. Furthermore, applied functional analysis includes linear and nonlinear problems. The scope of this field is so wide that it cannot be expressed in a few books. This book covers a limited section of this field, namely, fixed point theory and applications, nonlinear methods and variational inequalities, and set-valued optimization problems. The most important application of fixed point theory is proving the existence of solutions for fractional integro-differential equations and, therefore, increasing our ability to model different kinds of phenomena. In most everyday matters, we seek to use optimization. The importance of optimization has attracted many researchers to this field over the past few decades and provided new ideas, concepts, and techniques. Jen-Chih Yao , Shahram Rezapour Editors ix mathematics Article Informal Norm in Hyperspace and Its Topological Structure Hsien-Chung Wu Department of Mathematics, National Kaohsiung Normal University, Kaohsiung 802, Taiwan; [email protected] Received: 4 September 2019; Accepted: 8 October 2019; Published: 11 October 2019 Abstract: The hyperspace consists of all subsets of a vector space. Owing to a lack of additive inverse elements, the hyperspace cannot form a vector space. In this paper, we shall consider a so-called informal norm to the hyperspace in which the axioms regarding the informal norm are almost the same as the axioms of the conventional norm. Under this consideration, we shall propose two different concepts of open balls. Based on the open balls, we shall also propose the different types of open sets. In this case, the topologies generated by these different concepts of open sets are investigated. Keywords: hyperspace; informal open sets; informal norms; null set; open balls 1. Introduction The topic of set-valued analysis (or multivalued analysis) has been studied for an extensive period. A detailed discussion can refer to Aubin and Frankowska [1], and Hu and Papageorgiou [2,3]. Applications in nonlinear analysis can refer to Agarwal and O’Regan [4], Burachik and Iusem [5], and Tarafdar and Chowdhury [6]. More specific applications in differential inclusion can also refer to Aubin and Cellina [7]. On the other hand, the fixed point theory for set-valued mappings can refer to Górniewicz [8], and set-valued optimization can refer to Chen et al. [9], Khan et al. [10] and Hamel et al. [11]. Also, the set optimization that is different from the set-valued optimization can refer to Wu [12] and the references therein. Let P(X) be the collection of all subsets of a vector space X. The set-valued analysis usually studies the mathematical structure in P(X) in which each element in P(X) is treated as a subset of X. In this paper, we shall treat each element of P(X) as a “point”. In other words, each subset of X is compressed as a point, and the family P(X) is treated as a universal set. In this case, the original vector space X plays no role in the settings. Therefore, we want to endow a vector structure to P(X). Although we can define the vector addition and scalar multiplication in P(X) in the usual way, owing to lacking an additive inverse element, the family P(X) cannot form a vector space.
Recommended publications
  • Conjugate Convex Functions in Topological Vector Spaces

    Conjugate Convex Functions in Topological Vector Spaces

    Matematisk-fysiske Meddelelser udgivet af Det Kongelige Danske Videnskabernes Selskab Bind 34, nr. 2 Mat. Fys. Medd . Dan. Vid. Selsk. 34, no. 2 (1964) CONJUGATE CONVEX FUNCTIONS IN TOPOLOGICAL VECTOR SPACES BY ARNE BRØNDSTE D København 1964 Kommissionær : Ejnar Munksgaard Synopsis Continuing investigations by W. L . JONES (Thesis, Columbia University , 1960), the theory of conjugate convex functions in finite-dimensional Euclidea n spaces, as developed by W. FENCHEL (Canadian J . Math . 1 (1949) and Lecture No- tes, Princeton University, 1953), is generalized to functions in locally convex to- pological vector spaces . PRINTP_ll IN DENMARK BIANCO LUNOS BOGTRYKKERI A-S Introduction The purpose of the present paper is to generalize the theory of conjugat e convex functions in finite-dimensional Euclidean spaces, as initiated b y Z . BIRNBAUM and W. ORLICz [1] and S . MANDELBROJT [8] and developed by W. FENCHEL [3], [4] (cf. also S. KARLIN [6]), to infinite-dimensional spaces . To a certain extent this has been done previously by W . L . JONES in his Thesis [5] . His principal results concerning the conjugates of real function s in topological vector spaces have been included here with some improve- ments and simplified proofs (Section 3). After the present paper had bee n written, the author ' s attention was called to papers by J . J . MOREAU [9], [10] , [11] in which, by a different approach and independently of JONES, result s equivalent to many of those contained in this paper (Sections 3 and 4) are obtained. Section 1 contains a summary, based on [7], of notions and results fro m the theory of topological vector spaces applied in the following .
  • An Asymptotical Variational Principle Associated with the Steepest Descent Method for a Convex Function

    An Asymptotical Variational Principle Associated with the Steepest Descent Method for a Convex Function

    Journal of Convex Analysis Volume 3 (1996), No.1, 63{70 An Asymptotical Variational Principle Associated with the Steepest Descent Method for a Convex Function B. Lemaire Universit´e Montpellier II, Place E. Bataillon, 34095 Montpellier Cedex 5, France. e-mail:[email protected] Received July 5, 1994 Revised manuscript received January 22, 1996 Dedicated to R. T. Rockafellar on his 60th Birthday The asymptotical limit of the trajectory defined by the continuous steepest descent method for a proper closed convex function f on a Hilbert space is characterized in the set of minimizers of f via an asymp- totical variational principle of Brezis-Ekeland type. The implicit discrete analogue (prox method) is also considered. Keywords : Asymptotical, convex minimization, differential inclusion, prox method, steepest descent, variational principle. 1991 Mathematics Subject Classification: 65K10, 49M10, 90C25. 1. Introduction Let X be a real Hilbert space endowed with inner product :; : and associated norm : , and let f be a proper closed convex function on X. h i k k The paper considers the problem of minimizing f, that is, of finding infX f and some element in the optimal set S := Argmin f, this set assumed being non empty. Letting @f denote the subdifferential operator associated with f, we focus on the contin- uous steepest descent method associated with f, i.e., the differential inclusion du @f(u); t > 0 − dt 2 with initial condition u(0) = u0: This method is known to yield convergence under broad conditions summarized in the following theorem. Let us denote by the real vector space of continuous functions from [0; + [ into X that are absolutely conAtinuous on [δ; + [ for all δ > 0.
  • Subderivative-Subdifferential Duality Formula

    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.
  • Techniques of Variational Analysis

    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.
  • ADDENDUM the Following Remarks Were Added in Proof (November 1966). Page 67. an Easy Modification of Exercise 4.8.25 Establishes

    ADDENDUM the Following Remarks Were Added in Proof (November 1966). Page 67. an Easy Modification of Exercise 4.8.25 Establishes

    ADDENDUM The following remarks were added in proof (November 1966). Page 67. An easy modification of exercise 4.8.25 establishes the follow­ ing result of Wagner [I]: Every simplicial k-"complex" with at most 2 k ~ vertices has a representation in R + 1 such that all the "simplices" are geometric (rectilinear) simplices. Page 93. J. H. Conway (private communication) has established the validity of the conjecture mentioned in the second footnote. Page 126. For d = 2, the theorem of Derry [2] given in exercise 7.3.4 was found earlier by Bilinski [I]. Page 183. M. A. Perles (private communication) recently obtained an affirmative solution to Klee's problem mentioned at the end of section 10.1. Page 204. Regarding the question whether a(~) = 3 implies b(~) ~ 4, it should be noted that if one starts from a topological cell complex ~ with a(~) = 3 it is possible that ~ is not a complex (in our sense) at all (see exercise 11.1.7). On the other hand, G. Wegner pointed out (in a private communication to the author) that the 2-complex ~ discussed in the proof of theorem 11.1 .7 indeed satisfies b(~) = 4. Page 216. Halin's [1] result (theorem 11.3.3) has recently been genera­ lized by H. A. lung to all complete d-partite graphs. (Halin's result deals with the graph of the d-octahedron, i.e. the d-partite graph in which each class of nodes contains precisely two nodes.) The existence of the numbers n(k) follows from a recent result of Mader [1] ; Mader's result shows that n(k) ~ k.2(~) .
  • Proximal Analysis and Boundaries of Closed Sets in Banach Space Part Ii: Applications

    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.
  • CLOSED MEANS CONTINUOUS IFF POLYHEDRAL: a CONVERSE of the GKR THEOREM Emil Ernst

    CLOSED MEANS CONTINUOUS IFF POLYHEDRAL: a CONVERSE of the GKR THEOREM Emil Ernst

    CLOSED MEANS CONTINUOUS IFF POLYHEDRAL: A CONVERSE OF THE GKR THEOREM Emil Ernst To cite this version: Emil Ernst. CLOSED MEANS CONTINUOUS IFF POLYHEDRAL: A CONVERSE OF THE GKR THEOREM. 2011. hal-00652630 HAL Id: hal-00652630 https://hal.archives-ouvertes.fr/hal-00652630 Preprint submitted on 16 Dec 2011 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. CLOSED MEANS CONTINUOUS IFF POLYHEDRAL: A CONVERSE OF THE GKR THEOREM EMIL ERNST Abstract. Given x0, a point of a convex subset C of an Euclidean space, the two following statements are proven to be equivalent: (i) any convex function f : C → R is upper semi-continuous at x0, and (ii) C is polyhedral at x0. In the particular setting of closed convex mappings and Fσ domains, we prove that any closed convex function f : C → R is continuous at x0 if and only if C is polyhedral at x0. This provides a converse to the celebrated Gale-Klee- Rockafellar theorem. 1. Introduction One basic fact about real-valued convex mappings on Euclidean spaces, is that they are continuous at any point of their domain’s relative interior (see for instance [13, Theorem 10.1]).
  • Machine Learning Theory Lecture 20: Mirror Descent

    Machine Learning Theory Lecture 20: Mirror Descent

    Machine Learning Theory Lecture 20: Mirror Descent Nicholas Harvey November 21, 2018 In this lecture we will present the Mirror Descent algorithm, which is a common generalization of Gradient Descent and Randomized Weighted Majority. This will require some preliminary results in convex analysis. 1 Conjugate Duality A good reference for the material in this section is [5, Part E]. n ∗ n Definition 1.1. Let f : R ! R [ f1g be a function. Define f : R ! R [ f1g by f ∗(y) = sup yTx − f(x): x2Rn This is the convex conjugate or Legendre-Fenchel transform or Fenchel dual of f. For each linear functional y, the convex conjugate f ∗(y) gives the the greatest amount by which y exceeds the function f. Alternatively, we can think of f ∗(y) as the downward shift needed for the linear function y to just touch or \support" epi f. 1.1 Examples Let us consider some simple one-dimensional examples. ∗ Example 1.2. Let f(x) = cx for some c 2 R. We claim that f = δfcg, i.e., ( 0 (if x = c) f ∗(x) = : +1 (otherwise) This is called the indicator function of fcg. Note that f is itself a linear functional that obviously supports epi f; so f ∗(c) = 0. Any other linear functional x 7! yx − r cannot support epi f for any r (we have supx(yx − cx) = 1 if y 6= c), ∗ ∗ so f (y) = 1 if y 6= c. Note here that a line (f) is getting mapped to a single point (f ). 1 ∗ Example 1.3. Let f(x) = jxj.
  • Variational Properties of Polynomial Root Functions and Spectral Max Functions

    Variational Properties of Polynomial Root Functions and Spectral Max Functions

    Julia Eaton Workshop on Numerical Linear Algebra and Optimization [email protected] University of British Columbia University of Washington Tacoma Vancouver, BC Canada Variational properties of polynomial root functions and spectral max functions Abstract 1 Spectral Functions 4 Damped oscillator abscissa (see panel 3) 9 Applications 14 n×n Eigenvalue optimization problems arise in the control of continuous We say :C !R=R [ f+1g is a spectral function if it • Smooth everywhere but -2 and 2. Recall damped oscillator problem in panel 3. The characteristic and discrete time dynamical systems. The spectral abscissa (largest • depends only on the eigenvalues of its argument • Non-Lipschitz at -2 and 2 polynomial of A(x) is: p(λ, x) = λ(λ+x)+1 = λ2+xλ+1: real part of an eigenvalue) and spectral radius (largest eigenvalue • is invariant under permutations of those eigenvalues • Non-convex and abscissa graph is shown in panel 3. in modulus) are examples of functions of eigenvalues, or spectral • @h^ (2) = [−1=2; 1) = @h(2) A spectral max function ': n×n ! is a spectral fcn. of the form Consider the parameterization H : !P2, where functions, connected to these problems. A related class of functions C R • subdifferentially regular at 2 R '(A) = maxff (λ) j det(λI −A) = 0g H(x) = (λ−λ )2+h (x)(λ−λ )+h (x); λ 2 , h ; h : ! . are polynomial root functions. In 2001, Burke and Overton showed 0 1 0 2 0 C 1 2 R R where f : C ! R. The spectral abscissa and radius are spectral max 2 2 that the abscissa mapping on polynomials is subdifferentially Variational properties of spectral functions 10 Require p(λ, x) = λ +xλ+1 = (λ−λ0) +h1(x)(λ−λ0)+h2(x) so functions.
  • Convexity: an Introduction

    Convexity: an Introduction

    Convexity: an introduction Convexity: an introduction Geir Dahl CMA, Dept. of Mathematics and Dept. of Informatics University of Oslo 1 / 74 Convexity: an introduction 1. Introduction 1. Introduction what is convexity where does it arise main concepts and results Literature: Rockafellar: Convex analysis, 1970. Webster: Convexity, 1994. Gr¨unbaum: Convex polytopes, 1967. Ziegler: Lectures on polytopes, 1994. Hiriart-Urruty and Lemar´echal: Convex analysis and minimization algorithms, 1993. Boyd and Vandenberghe: Convex optimization, 2004. 2 / 74 Convexity: an introduction 1. Introduction roughly: a convex set in IR2 (or IRn) is a set \with no holes". more accurately, a convex set C has the following property: whenever we choose two points in the set, say x; y 2 C, then all points in the line segment between x and y also lie in C. a sphere (ball), an ellipsoid, a point, a line, a line segment, a rectangle, a triangle, halfplane, the plane itself the union of two disjoint (closed) triangles is nonconvex. 3 / 74 Convexity: an introduction 1. Introduction Why are convex sets important? Optimization: mathematical foundation for optimization feasible set, optimal set, .... objective function, constraints, value function closely related to the numerical solvability of an optimization problem Statistics: statistics: both in theory and applications estimation: \estimate" the value of one or more unknown parameters in a stochastic model. To measure quality of a solution one uses a \loss function" and, quite often, this loss function is convex. statistical decision theory: the concept of risk sets is central; they are convex sets, so-called polytopes. 4 / 74 Convexity: an introduction 1.
  • Lecture Slides on Convex Analysis And

    Lecture Slides on Convex Analysis And

    LECTURE SLIDES ON CONVEX ANALYSIS AND OPTIMIZATION BASED ON 6.253 CLASS LECTURES AT THE MASS. INSTITUTE OF TECHNOLOGY CAMBRIDGE, MASS SPRING 2014 BY DIMITRI P. BERTSEKAS http://web.mit.edu/dimitrib/www/home.html Based on the books 1) “Convex Optimization Theory,” Athena Scien- tific, 2009 2) “Convex Optimization Algorithms,” Athena Sci- entific, 2014 (in press) Supplementary material (solved exercises, etc) at http://www.athenasc.com/convexduality.html LECTURE 1 AN INTRODUCTION TO THE COURSE LECTURE OUTLINE The Role of Convexity in Optimization • Duality Theory • Algorithms and Duality • Course Organization • HISTORY AND PREHISTORY Prehistory: Early 1900s - 1949. • Caratheodory, Minkowski, Steinitz, Farkas. − Properties of convex sets and functions. − Fenchel - Rockafellar era: 1949 - mid 1980s. • Duality theory. − Minimax/game theory (von Neumann). − (Sub)differentiability, optimality conditions, − sensitivity. Modern era - Paradigm shift: Mid 1980s - present. • Nonsmooth analysis (a theoretical/esoteric − direction). Algorithms (a practical/high impact direc- − tion). A change in the assumptions underlying the − field. OPTIMIZATION PROBLEMS Generic form: • minimize f(x) subject to x C ∈ Cost function f : n , constraint set C, e.g., ℜ 7→ ℜ C = X x h1(x) = 0,...,hm(x) = 0 ∩ | x g1(x) 0,...,gr(x) 0 ∩ | ≤ ≤ Continuous vs discrete problem distinction • Convex programming problems are those for which• f and C are convex They are continuous problems − They are nice, and have beautiful and intu- − itive structure However, convexity permeates
  • Arxiv:1703.03069V1 [Math.OC]

    Arxiv:1703.03069V1 [Math.OC]

    Upper semismooth functions and the subdifferential determination property March 10, 2017 Marc Lassonde Universit´edes Antilles, BP 150, 97159 Pointe `aPitre, France; and LIMOS, Universit´eBlaise Pascal, 63000 Clermont-Ferrand, France E-mail: [email protected] Dedicated to the memory of Jon Borwein. Abstract. In this paper, an upper semismooth function is defined to be a lower semicon- tinuous function whose radial subderivative satisfies a mild directional upper semicontinuity property. Examples of upper semismooth functions are the proper lower semicontinuous convex functions, the lower-C1 functions, the regular directionally Lipschitz functions, the Mifflin semismooth functions, the Thibault-Zagrodny directionally stable functions. It is shown that the radial subderivative of such functions can be recovered from any subdiffer- ential of the function. It is also shown that these functions are subdifferentially determined, in the sense that if two functions have the same subdifferential and one of the functions is upper semismooth, then the two functions are equal up to an additive constant. Keywords: upper semismooth, Dini subderivative, radial subderivative, subdifferential, sub- differential determination property, approximately convex function, regular function. 2010 Mathematics Subject Classification: 49J52, 49K27, 26D10, 26B25. 1 Introduction Jon Borwein discussing generalisations in the area of nonsmooth optimisation [1, p. 4] writes: In his thesis Francis Clarke extended Moreau-Rockafellar max formula to all locally Lip- schitz functions. Clarke replaced the right Dini directional derivative Dhf(x) by c f(y + th) f(y) Dhf(x) = lim sup − . 0<t→0,y→x t arXiv:1703.03069v1 [math.OC] 8 Mar 2017 c Somewhat miraculously the mapping p sending h Dhf(x) is always continuous and C → ∗ c sublinear in h, and so if we define ∂ f(x)= ∂p(0) = y X : y,h Dhf(x), h X , Moreau-Rockafellar max formula leads directly to: { ∈ h i≤ ∀ ∈ } Theorem (Clarke).