subgradient trajectories : the convex case
|
|
- Bernadette McLaughlin
- 6 years ago
- Views:
Transcription
1 trajectories : Université de Tours ley Joint work with : Jérôme Bolte (Paris vi) Aris Daniilidis (U. Autonoma Barcelona & Tours) and Laurent Mazet (Paris xii)
2 inequality inequality [ 1963] f : R N R is analytic. Let a be a critical point of f. Then there exists a neighborhood U of a, C > 0 and θ (0, 1) such that f (x) f (x) f (a) θ for all x U. Finite length of the gradient trajectories, Every critical point is limit of a gradient trajectory, etc.
3 Basic assumptions To simplify : H is a real Hilbert space f : H [0, + ) is smooth (f 0) For all r > 0, C r := {f r} (A0) (0 is a critical point and a global minimum) 0 C 0 (A1) (0 is an isolated critical value) There exits r 0 > 0 such that : x C r0 and f (x) > 0 f (x) 0 (A2) (Sublevel compactness) There exits r 0 > such that : C r0 = {f r 0 } is compact.
4 Generalization : K L-inequality We say that f satisfies inequality [Kurdyka 1998] if : There exists ϕ KL(0, r 0 ) such that : where : (ϕ f )(x) 1 for all x C r0 \ C 0. KL(0, r 0 ) = { ϕ : [0, r 0 ] R + continuous, ϕ(0) = 0, ϕ C 1 (0, r 0 ), ϕ > 0 }. Lojasiewicz inequality is a particular with ϕ(r) = 1 C(1 θ) r 1 θ.
5 The convex From now on, we assume that f is convex Issues : 1 Characterizations of the K L-inequality in 2 Does a convex function satisfy the K L-inequality?
6 Piecewise gradient curves Gradient dynamical system : { Ẋx (t) = f (X x (t)), t 0 X x (0) = x A piecewise gradient curve γ is a countable family of gradient curves X xi ([0, t i )) with f (X xi (0)) = f (x i ) = r i, f (X xi (t i )) = r i+1 r i C r0 x 0 X x0 (t) i + 0 C r2 C r1 C r3 x 1 x 2 C 0 0
7 Classical properties of the convex gradient curves Lemma. For all x 0 C r0 \ C 0, 1 t f (X x0 (t)) is convex, L 1 (0, + ) and decreasing with limit 0. 2 Each trajectory goes closer to all minima at the same time, i.e., for each a C 0, 3 For all T > 0, d dt X x 0 (t) a 2 2f (X x0 (t)) < 0. T 0 Ẋ x0 (t) dt 1 2 x 0 log T.
8 Characterizations of the K L-inequality (f convex) Theorem. The following statements are equivalent : 1 f satisfies the K L-inequality in C r0 : (ϕ f )(x) 1 with ϕ KL(0, r 0 ). 2 f satisfies the K L-inequality globally in H with ϕ KL(0, + ) which is concave. 1 3 r (0, r 0 ] is integrable. f (x) inf f (x)=r 4 For all piecewise gradient curves γ in C r0 we have length(γ) = ti i=0 0 Ẋ xi (t) dt <.
9 Length of the convex gradient curves [Brézis 1973] Given x 0 C r0, do we have length(x x0 ) = 0 Ẋ x0 (t) dt <? Theorem. [Brézis 1973] Yes if int(argmin(f )). finite length finite length Xx0 (t) Ẋx0 (t) C0 C0 unknown length Theorem. [Baillon 1978] No in general (counter-example in infinite dimension)
10 A sufficient condition for a convex function to satisfy K L-inequality Theorem. Assume that there exists m : [0, + ) [0, + ) continuous increasing with m(0) = 0 such that f m(dist(, C 0 )) on C r0 and r0 0 m 1 (r) dr < + (growth condition). (1) r Then K L-inequality holds for f. Proof : f (x) f (x), x p C0 (x) f (x) dist(x, C 0 ) f (x) m 1 (f (x)). non analytic examples : m(r) = exp( 1/r α ), α (0, 1) satisfies (1).
11 A smooth convex counterexample to K L-inequality Theorem. There exists a C 2 convex function f : R 2 R + with {f = 0} = D(0, 1) for which K L-inequality fails. Note that the gradient trajectories have uniform finite length.
12 An auxiliary problem A farmer rakes its (convex) field in several steps in the following way : l0 l1 l2 If he is unlucky, is it possible that he walks an infinite path? (i.e. l i = + ) i 0
13 An auxiliary problem A farmer rakes its (convex) field in several steps in the following way : l0 l1 l2 If he is unlucky, is it possible that he walks an infinite path? (i.e. l i = + ) i 0 Answer : Yes!
14 Hausdorff distance between nested convex sets Lemma. There exists a decreasing sequence of compact convex subsets {T k } k in R 2 such that : (i) T 0 is the disk D := D(0, 2) ; (ii) T k+1 int T k for every k N ; (iii) k N T k is the unit disk D(0, 1) ; (iv) + k=0 dist Hausdorff (T k, T k+1 ) = +.
15 Picture of the sequence of convex sets 1 l k := dist Hausdorff (T k, T k+1 ) R i R i+1 and N i Ri R i+1 It suffices to take R i R i+1 = 1 in order that i 2 i R i R i+1 < and k l k i N i(r i R i+1 ) i Ri R i+1 = +.
16 End of the construction Construction of a convex function with prescribed sublevel sets T k : [Torralba 1996]. Smoothing of the function.
Spring School on Variational Analysis Paseky nad Jizerou, Czech Republic (April 20 24, 2009)
Spring School on Variational Analysis Paseky nad Jizerou, Czech Republic (April 20 24, 2009) GRADIENT DYNAMICAL SYSTEMS, TAME OPTIMIZATION AND APPLICATIONS Aris DANIILIDIS Departament de Matemàtiques Universitat
More informationCharacterizations of Lojasiewicz inequalities: subgradient flows, talweg, convexity.
Characterizations of Lojasiewicz inequalities: subgradient flows, talweg, convexity. Jérôme BOLTE, Aris DANIILIDIS, Olivier LEY, Laurent MAZET. Abstract The classical Lojasiewicz inequality and its extensions
More informationFrom error bounds to the complexity of first-order descent methods for convex functions
From error bounds to the complexity of first-order descent methods for convex functions Nguyen Trong Phong-TSE Joint work with Jérôme Bolte, Juan Peypouquet, Bruce Suter. Toulouse, 23-25, March, 2016 Journées
More informationASYMPTOTIC BEHAVIOUR OF SELF-CONTRACTED PLANAR CURVES AND GRADIENT ORBITS OF CONVEX FUNCTIONS
ASYMPTOTIC BEHAVIOUR OF SELF-CONTRACTED PLANAR CURVES AND GRADIENT ORBITS OF CONVEX FUNCTIONS ARIS DANIILIDIS, OLIVIER LEY, AND STÉPHANE SABOURAU Abstract. We hereby introduce and study the notion of self-contracted
More informationSequential convex programming,: value function and convergence
Sequential convex programming,: value function and convergence Edouard Pauwels joint work with Jérôme Bolte Journées MODE Toulouse March 23 2016 1 / 16 Introduction Local search methods for finite dimensional
More informationOn damped second-order gradient systems
On damped second-order gradient systems Pascal Bégout, Jérôme Bolte and Mohamed Ali Jendoubi Abstract Using small deformations of the total energy, as introduced in [31], we establish that damped second
More informationSolutions to Tutorial 8 (Week 9)
The University of Sydney School of Mathematics and Statistics Solutions to Tutorial 8 (Week 9) MATH3961: Metric Spaces (Advanced) Semester 1, 2018 Web Page: http://www.maths.usyd.edu.au/u/ug/sm/math3961/
More informationA semi-algebraic look at first-order methods
splitting A semi-algebraic look at first-order Université de Toulouse / TSE Nesterov s 60th birthday, Les Houches, 2016 in large-scale first-order optimization splitting Start with a reasonable FOM (some
More informationI P IANO : I NERTIAL P ROXIMAL A LGORITHM FOR N ON -C ONVEX O PTIMIZATION
I P IANO : I NERTIAL P ROXIMAL A LGORITHM FOR N ON -C ONVEX O PTIMIZATION Peter Ochs University of Freiburg Germany 17.01.2017 joint work with: Thomas Brox and Thomas Pock c 2017 Peter Ochs ipiano c 1
More informationGeneric identifiability and second-order sufficiency in tame convex optimization
Generic identifiability and second-order sufficiency in tame convex optimization J. Bolte, A. Daniilidis, and A. S. Lewis Date: 19th January 2009 Abstract We consider linear optimization over a fixed compact
More informationSolutions for Math 217 Assignment #3
Solutions for Math 217 Assignment #3 (1) Which of the following sets in R n are open? Which are closed? Which are neither open nor closed? (a) {(x, y) R 2 : x 2 y 2 = 1}. (b) {(x, y, z) R 3 : 0 < x + y
More informationCLARKE CRITICAL VALUES OF SUBANALYTIC LIPSCHITZ CONTINUOUS FUNCTIONS
CLARKE CRITICAL VALUES OF SUBANALYTIC LIPSCHITZ CONTINUOUS FUNCTIONS Abstract. We prove that any subanalytic locally Lipschitz function has the Sard property. Such functions are typically nonsmooth and
More informationMañé s Conjecture from the control viewpoint
Mañé s Conjecture from the control viewpoint Université de Nice - Sophia Antipolis Setting Let M be a smooth compact manifold of dimension n 2 be fixed. Let H : T M R be a Hamiltonian of class C k, with
More informationNonlinear Systems and Control Lecture # 12 Converse Lyapunov Functions & Time Varying Systems. p. 1/1
Nonlinear Systems and Control Lecture # 12 Converse Lyapunov Functions & Time Varying Systems p. 1/1 p. 2/1 Converse Lyapunov Theorem Exponential Stability Let x = 0 be an exponentially stable equilibrium
More informationNeighboring feasible trajectories in infinite dimension
Neighboring feasible trajectories in infinite dimension Marco Mazzola Université Pierre et Marie Curie (Paris 6) H. Frankowska and E. M. Marchini Control of State Constrained Dynamical Systems Padova,
More informationSteepest descent method on a Riemannian manifold: the convex case
Steepest descent method on a Riemannian manifold: the convex case Julien Munier Abstract. In this paper we are interested in the asymptotic behavior of the trajectories of the famous steepest descent evolution
More informationLECTURE 15: COMPLETENESS AND CONVEXITY
LECTURE 15: COMPLETENESS AND CONVEXITY 1. The Hopf-Rinow Theorem Recall that a Riemannian manifold (M, g) is called geodesically complete if the maximal defining interval of any geodesic is R. On the other
More informationLipschitz continuity properties
properties (joint work with G. Comte and F. Loeser) K.U.Leuven, Belgium MODNET Barcelona Conference 3-7 November 2008 1/26 1 Introduction 2 3 2/26 Introduction Definition A function f : X Y is called Lipschitz
More informationConvergence rates for an inertial algorithm of gradient type associated to a smooth nonconvex minimization
Convergence rates for an inertial algorithm of gradient type associated to a smooth nonconvex minimization Szilárd Csaba László November, 08 Abstract. We investigate an inertial algorithm of gradient type
More informationIntegral Jensen inequality
Integral Jensen inequality Let us consider a convex set R d, and a convex function f : (, + ]. For any x,..., x n and λ,..., λ n with n λ i =, we have () f( n λ ix i ) n λ if(x i ). For a R d, let δ a
More informationDouglas-Rachford splitting for nonconvex feasibility problems
Douglas-Rachford splitting for nonconvex feasibility problems Guoyin Li Ting Kei Pong Jan 3, 015 Abstract We adapt the Douglas-Rachford DR) splitting method to solve nonconvex feasibility problems by studying
More informationActive sets, steepest descent, and smooth approximation of functions
Active sets, steepest descent, and smooth approximation of functions Dmitriy Drusvyatskiy School of ORIE, Cornell University Joint work with Alex D. Ioffe (Technion), Martin Larsson (EPFL), and Adrian
More informationDefinitions and Properties of R N
Definitions and Properties of R N R N as a set As a set R n is simply the set of all ordered n-tuples (x 1,, x N ), called vectors. We usually denote the vector (x 1,, x N ), (y 1,, y N ), by x, y, or
More informationTame variational analysis
Tame variational analysis Dmitriy Drusvyatskiy Mathematics, University of Washington Joint work with Daniilidis (Chile), Ioffe (Technion), and Lewis (Cornell) May 19, 2015 Theme: Semi-algebraic geometry
More informationProximal Alternating Linearized Minimization for Nonconvex and Nonsmooth Problems
Proximal Alternating Linearized Minimization for Nonconvex and Nonsmooth Problems Jérôme Bolte Shoham Sabach Marc Teboulle Abstract We introduce a proximal alternating linearized minimization PALM) algorithm
More informationA sufficient condition for observability of waves by measurable subsets
A sufficient condition for observability of waves by measurable subsets Emmanuel Humbert Yannick Privat Emmanuel Trélat Abstract We consider the wave equation on a closed Riemannian manifold (M, g). Given
More informationA gradient type algorithm with backward inertial steps for a nonconvex minimization
A gradient type algorithm with backward inertial steps for a nonconvex minimization Cristian Daniel Alecsa Szilárd Csaba László Adrian Viorel November 22, 208 Abstract. We investigate an algorithm of gradient
More informationRecent Trends in Differential Inclusions
Recent Trends in Alberto Bressan Department of Mathematics, Penn State University (Aveiro, June 2016) (Aveiro, June 2016) 1 / Two main topics ẋ F (x) differential inclusions with upper semicontinuous,
More informationAnalysis of the convergence rate for the cyclic projection algorithm applied to basic semi-algebraic convex sets
Analysis of the convergence rate for the cyclic projection algorithm applied to basic semi-algebraic convex sets Jonathan M. Borwein, Guoyin Li, and Liangjin Yao Second revised version: January 04 Abstract
More informationarxiv: v2 [math.oc] 21 Nov 2017
Unifying abstract inexact convergence theorems and block coordinate variable metric ipiano arxiv:1602.07283v2 [math.oc] 21 Nov 2017 Peter Ochs Mathematical Optimization Group Saarland University Germany
More informationHausdorff dimension of weighted singular vectors in R 2
Hausdorff dimension of weighted singular vectors in R 2 Lingmin LIAO (joint with Ronggang Shi, Omri N. Solan, and Nattalie Tamam) Université Paris-Est NCTS Workshop on Dynamical Systems August 15th 2016
More information1 Lyapunov theory of stability
M.Kawski, APM 581 Diff Equns Intro to Lyapunov theory. November 15, 29 1 1 Lyapunov theory of stability Introduction. Lyapunov s second (or direct) method provides tools for studying (asymptotic) stability
More informationA user s guide to Lojasiewicz/KL inequalities
Other A user s guide to Lojasiewicz/KL inequalities Toulouse School of Economics, Université Toulouse I SLRA, Grenoble, 2015 Motivations behind KL f : R n R smooth ẋ(t) = f (x(t)) or x k+1 = x k λ k f
More informationPROBLEMS. (b) (Polarization Identity) Show that in any inner product space
1 Professor Carl Cowen Math 54600 Fall 09 PROBLEMS 1. (Geometry in Inner Product Spaces) (a) (Parallelogram Law) Show that in any inner product space x + y 2 + x y 2 = 2( x 2 + y 2 ). (b) (Polarization
More informationREVERSIBILITY AND OSCILLATIONS IN ZERO-SUM DISCOUNTED STOCHASTIC GAMES
REVERSIBILITY AND OSCILLATIONS IN ZERO-SUM DISCOUNTED STOCHASTIC GAMES Sylvain Sorin, Guillaume Vigeral To cite this version: Sylvain Sorin, Guillaume Vigeral. REVERSIBILITY AND OSCILLATIONS IN ZERO-SUM
More informationVariational Analysis and Tame Optimization
Variational Analysis and Tame Optimization Aris Daniilidis http://mat.uab.cat/~arisd Universitat Autònoma de Barcelona April 15 17, 2010 PLAN OF THE TALK Nonsmooth analysis Genericity of pathological situations
More information(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define
Homework, Real Analysis I, Fall, 2010. (1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define ρ(f, g) = 1 0 f(x) g(x) dx. Show that
More informationHedy Attouch, Jérôme Bolte, Benar Svaiter. To cite this version: HAL Id: hal
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods Hedy Attouch, Jérôme Bolte, Benar Svaiter To cite
More informationAnalysis of the convergence rate for the cyclic projection algorithm applied to semi-algebraic convex sets
Analysis of the convergence rate for the cyclic projection algorithm applied to semi-algebraic convex sets Liangjin Yao University of Newcastle June 3rd, 2013 The University of Newcastle liangjin.yao@newcastle.edu.au
More informationFunctional Analysis HW #3
Functional Analysis HW #3 Sangchul Lee October 26, 2015 1 Solutions Exercise 2.1. Let D = { f C([0, 1]) : f C([0, 1])} and define f d = f + f. Show that D is a Banach algebra and that the Gelfand transform
More informationPARTIAL REGULARITY OF BRENIER SOLUTIONS OF THE MONGE-AMPÈRE EQUATION
PARTIAL REGULARITY OF BRENIER SOLUTIONS OF THE MONGE-AMPÈRE EQUATION ALESSIO FIGALLI AND YOUNG-HEON KIM Abstract. Given Ω, Λ R n two bounded open sets, and f and g two probability densities concentrated
More informationAn introduction to Mathematical Theory of Control
An introduction to Mathematical Theory of Control Vasile Staicu University of Aveiro UNICA, May 2018 Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May 2018
More informationRelative Isoperimetric Inequality Outside Convex Bodies
Relative Isoperimetric Inequality Outside Convex Bodies Mohammad Ghomi (www.math.gatech.edu/ ghomi) Georgia Institute of Technology Atlanta, USA May 25, 2010, Tunis From Carthage to the World Joint work
More informationProblem set 1, Real Analysis I, Spring, 2015.
Problem set 1, Real Analysis I, Spring, 015. (1) Let f n : D R be a sequence of functions with domain D R n. Recall that f n f uniformly if and only if for all ɛ > 0, there is an N = N(ɛ) so that if n
More informationMorse-Sard theorem for Clarke critical values
Morse-Sard theorem for Clarke critical values Luc Barbet, Marc Dambrine, Aris Daniilidis Abstract The Morse-Sard theorem states that the set of critical values of a C k smooth function defined on a Euclidean
More informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 7: Quasiconvex Functions I 7.1 Level sets of functions For an extended real-valued
More informationA LOWER BOUND ON THE SUBRIEMANNIAN DISTANCE FOR HÖLDER DISTRIBUTIONS
A LOWER BOUND ON THE SUBRIEMANNIAN DISTANCE FOR HÖLDER DISTRIBUTIONS SLOBODAN N. SIMIĆ Abstract. Whereas subriemannian geometry usually deals with smooth horizontal distributions, partially hyperbolic
More informationSelf-equilibrated Functions in Dual Vector Spaces: a Boundedness Criterion
Self-equilibrated Functions in Dual Vector Spaces: a Boundedness Criterion Michel Théra LACO, UMR-CNRS 6090, Université de Limoges michel.thera@unilim.fr reporting joint work with E. Ernst and M. Volle
More informationOn the iterate convergence of descent methods for convex optimization
On the iterate convergence of descent methods for convex optimization Clovis C. Gonzaga March 1, 2014 Abstract We study the iterate convergence of strong descent algorithms applied to convex functions.
More informationSOME REMARKS ON SUBDIFFERENTIABILITY OF CONVEX FUNCTIONS
Applied Mathematics E-Notes, 5(2005), 150-156 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ SOME REMARKS ON SUBDIFFERENTIABILITY OF CONVEX FUNCTIONS Mohamed Laghdir
More informationGeneric Aubry sets on surfaces
Université de Nice - Sophia Antipolis & Institut Universitaire de France Nanjing University (June 10th, 2013) Setting Let M be a smooth compact manifold of dimension n 2 be fixed. Let H : T M R be a Hamiltonian
More informationON A CERTAIN GENERALIZATION OF THE KRASNOSEL SKII THEOREM
Journal of Applied Analysis Vol. 9, No. 1 23, pp. 139 147 ON A CERTAIN GENERALIZATION OF THE KRASNOSEL SKII THEOREM M. GALEWSKI Received July 3, 21 and, in revised form, March 26, 22 Abstract. We provide
More informationScaling limit of random planar maps Lecture 2.
Scaling limit of random planar maps Lecture 2. Olivier Bernardi, CNRS, Université Paris-Sud Workshop on randomness and enumeration Temuco, Olivier Bernardi p.1/25 Goal We consider quadrangulations as metric
More informationOverview of normed linear spaces
20 Chapter 2 Overview of normed linear spaces Starting from this chapter, we begin examining linear spaces with at least one extra structure (topology or geometry). We assume linearity; this is a natural
More informationHistory (Minimal Dynamics Theorem, Meeks-Perez-Ros 2005, CMC Dynamics Theorem, Meeks-Tinaglia 2008) Giuseppe Tinaglia
History (Minimal Dynamics Theorem, Meeks-Perez-Ros 2005, CMC Dynamics Theorem, Meeks-Tinaglia 2008) Briefly stated, these Dynamics Theorems deal with describing all of the periodic or repeated geometric
More informationSteepest descent method on a Riemannian manifold: the convex case
Steepest descent method on a Riemannian manifold: the convex case Julien Munier To cite this version: Julien Munier. Steepest descent method on a Riemannian manifold: the convex case. 2006.
More informationFunctional Analysis HW #1
Functional Analysis HW #1 Sangchul Lee October 9, 2015 1 Solutions Solution of #1.1. Suppose that X
More information7 About Egorov s and Lusin s theorems
Tel Aviv University, 2013 Measure and category 62 7 About Egorov s and Lusin s theorems 7a About Severini-Egorov theorem.......... 62 7b About Lusin s theorem............... 64 7c About measurable functions............
More informationAnother consequence of the Cauchy Schwarz inequality is the continuity of the inner product.
. Inner product spaces 1 Theorem.1 (Cauchy Schwarz inequality). If X is an inner product space then x,y x y. (.) Proof. First note that 0 u v v u = u v u v Re u,v. (.3) Therefore, Re u,v u v (.) for all
More informationSubdifferential representation of convex functions: refinements and applications
Subdifferential representation of convex functions: refinements and applications Joël Benoist & Aris Daniilidis Abstract Every lower semicontinuous convex function can be represented through its subdifferential
More informationThe Folk Theorem for Finitely Repeated Games with Mixed Strategies
The Folk Theorem for Finitely Repeated Games with Mixed Strategies Olivier Gossner February 1994 Revised Version Abstract This paper proves a Folk Theorem for finitely repeated games with mixed strategies.
More informationAn inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions Radu Ioan Boţ Ernö Robert Csetnek Szilárd Csaba László October, 1 Abstract. We propose a forward-backward
More informationarxiv: v1 [math.oc] 11 Jan 2008
Alternating minimization and projection methods for nonconvex problems 1 Hedy ATTOUCH 2, Jérôme BOLTE 3, Patrick REDONT 2, Antoine SOUBEYRAN 4. arxiv:0801.1780v1 [math.oc] 11 Jan 2008 Abstract We study
More informationHomework Assignment #5 Due Wednesday, March 3rd.
Homework Assignment #5 Due Wednesday, March 3rd. 1. In this problem, X will be a separable Banach space. Let B be the closed unit ball in X. We want to work out a solution to E 2.5.3 in the text. Work
More informationDirichlet uniformly well-approximated numbers
Dirichlet uniformly well-approximated numbers Lingmin LIAO (joint work with Dong Han Kim) Université Paris-Est Créteil (University Paris 12) Hyperbolicity and Dimension CIRM, Luminy December 3rd 2013 Lingmin
More informationMTG 5316/4302 FALL 2018 REVIEW FINAL
MTG 5316/4302 FALL 2018 REVIEW FINAL JAMES KEESLING Problem 1. Define open set in a metric space X. Define what it means for a set A X to be connected in a metric space X. Problem 2. Show that if a set
More informationExistence and Approximation of Fixed Points of. Bregman Nonexpansive Operators. Banach Spaces
Existence and Approximation of Fixed Points of in Reflexive Banach Spaces Department of Mathematics The Technion Israel Institute of Technology Haifa 22.07.2010 Joint work with Prof. Simeon Reich General
More information3. Convex functions. basic properties and examples. operations that preserve convexity. the conjugate function. quasiconvex functions
3. Convex functions Convex Optimization Boyd & Vandenberghe basic properties and examples operations that preserve convexity the conjugate function quasiconvex functions log-concave and log-convex functions
More informationSpring 2014 Advanced Probability Overview. Lecture Notes Set 1: Course Overview, σ-fields, and Measures
36-752 Spring 2014 Advanced Probability Overview Lecture Notes Set 1: Course Overview, σ-fields, and Measures Instructor: Jing Lei Associated reading: Sec 1.1-1.4 of Ash and Doléans-Dade; Sec 1.1 and A.1
More informationB 1 = {B(x, r) x = (x 1, x 2 ) H, 0 < r < x 2 }. (a) Show that B = B 1 B 2 is a basis for a topology on X.
Math 6342/7350: Topology and Geometry Sample Preliminary Exam Questions 1. For each of the following topological spaces X i, determine whether X i and X i X i are homeomorphic. (a) X 1 = [0, 1] (b) X 2
More informationExam February h
Master 2 Mathématiques et Applications PUF Ho Chi Minh Ville 2009/10 Viscosity solutions, HJ Equations and Control O.Ley (INSA de Rennes) Exam February 2010 3h Written-by-hands documents are allowed. Printed
More information1. Foundations of Numerics from Advanced Mathematics. Mathematical Essentials and Notation
1. Foundations of Numerics from Advanced Mathematics Mathematical Essentials and Notation Mathematical Essentials and Notation, October 22, 2012 1 The main purpose of this first chapter (about 4 lectures)
More informationHow circular are generalized circles
How circular are generalized circles Mario Ponce A plane circle is defined as the locus of points that have constant distance (radius) from a distinguished point (center). In this short note we treat with
More informationEstimates for the resolvent and spectral gaps for non self-adjoint operators. University Bordeaux
for the resolvent and spectral gaps for non self-adjoint operators 1 / 29 Estimates for the resolvent and spectral gaps for non self-adjoint operators Vesselin Petkov University Bordeaux Mathematics Days
More informationDirichlet uniformly well-approximated numbers
Dirichlet uniformly well-approximated numbers Lingmin LIAO (joint work with Dong Han Kim) Université Paris-Est Créteil (University Paris 12) Approximation and numeration Université Paris Diderot-Paris
More informationFirst Order Methods beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
First Order Methods beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems Jérôme Bolte Shoham Sabach Marc Teboulle Yakov Vaisbourd June 20, 2017 Abstract We
More information2. Dual space is essential for the concept of gradient which, in turn, leads to the variational analysis of Lagrange multipliers.
Chapter 3 Duality in Banach Space Modern optimization theory largely centers around the interplay of a normed vector space and its corresponding dual. The notion of duality is important for the following
More informationg 2 (x) (1/3)M 1 = (1/3)(2/3)M.
COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is
More informationOptimization and Optimal Control in Banach Spaces
Optimization and Optimal Control in Banach Spaces Bernhard Schmitzer October 19, 2017 1 Convex non-smooth optimization with proximal operators Remark 1.1 (Motivation). Convex optimization: easier to solve,
More informationOpen Problems about Curves, Sets, and Measures
Open Problems about Curves, Sets, and Measures Matthew Badger University of Connecticut Department of Mathematics 8th Ohio River Analysis Meeting University of Kentucky in Lexington March 24 25, 2018 Research
More informationComplex Analysis Problems
Complex Analysis Problems transcribed from the originals by William J. DeMeo October 2, 2008 Contents 99 November 2 2 2 200 November 26 4 3 2006 November 3 6 4 2007 April 6 7 5 2007 November 6 8 99 NOVEMBER
More informationSome Contributions to Convex Infinite-Dimensional Optimization Duality
Some Contributions to Convex Infinite-Dimensional Optimization Duality Marco A. López Alicante University King s College London Strand Campus June 2014 Introduction Consider the convex infinite programming
More informationThere is a more global concept that is related to this circle of ideas that we discuss somewhat informally. Namely, a region R R n with a (smooth)
82 Introduction Liapunov Functions Besides the Liapunov spectral theorem, there is another basic method of proving stability that is a generalization of the energy method we have seen in the introductory
More informationCOUNTABLE PRODUCTS ELENA GUREVICH
COUNTABLE PRODUCTS ELENA GUREVICH Abstract. In this paper, we extend our study to countably infinite products of topological spaces.. The Cantor Set Let us constract a very curios (but usefull) set known
More informationExtremal Solutions of Differential Inclusions via Baire Category: a Dual Approach
Extremal Solutions of Differential Inclusions via Baire Category: a Dual Approach Alberto Bressan Department of Mathematics, Penn State University University Park, Pa 1682, USA e-mail: bressan@mathpsuedu
More informationStrongly convex functions, Moreau envelopes and the generic nature of convex functions with strong minimizers
University of Wollongong Research Online Faculty of Engineering and Information Sciences - Papers: Part B Faculty of Engineering and Information Sciences 206 Strongly convex functions, Moreau envelopes
More informationReproducing Kernel Hilbert Spaces Class 03, 15 February 2006 Andrea Caponnetto
Reproducing Kernel Hilbert Spaces 9.520 Class 03, 15 February 2006 Andrea Caponnetto About this class Goal To introduce a particularly useful family of hypothesis spaces called Reproducing Kernel Hilbert
More informationECARES Université Libre de Bruxelles MATH CAMP Basic Topology
ECARES Université Libre de Bruxelles MATH CAMP 03 Basic Topology Marjorie Gassner Contents: - Subsets, Cartesian products, de Morgan laws - Ordered sets, bounds, supremum, infimum - Functions, image, preimage,
More informationLecture 7: The wave equation: higher dimensional case
Lecture 7: The wave equation: higher dimensional case Some auxiliary facts The co area formula. Let be a bounded domain and be a function of class. Denote by : the level set of. Let be any integrable function.
More informationLECTURE 3: SMOOTH FUNCTIONS
LECTURE 3: SMOOTH FUNCTIONS Let M be a smooth manifold. 1. Smooth Functions Definition 1.1. We say a function f : M R is smooth if for any chart {ϕ α, U α, V α } in A that defines the smooth structure
More informationReceived: 15 December 2010 / Accepted: 30 July 2011 / Published online: 20 August 2011 Springer and Mathematical Optimization Society 2011
Math. Program., Ser. A (2013) 137:91 129 DOI 10.1007/s10107-011-0484-9 FULL LENGTH PAPER Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward backward splitting,
More informationSome Properties of the Augmented Lagrangian in Cone Constrained Optimization
MATHEMATICS OF OPERATIONS RESEARCH Vol. 29, No. 3, August 2004, pp. 479 491 issn 0364-765X eissn 1526-5471 04 2903 0479 informs doi 10.1287/moor.1040.0103 2004 INFORMS Some Properties of the Augmented
More informationA local time scaling exponent for compact metric spaces
A local time scaling exponent for compact metric spaces John Dever School of Mathematics Georgia Institute of Technology Fractals 6 @ Cornell, June 15, 2017 Dever (GaTech) Exit time exponent Fractals 6
More informationBlock Coordinate Descent for Regularized Multi-convex Optimization
Block Coordinate Descent for Regularized Multi-convex Optimization Yangyang Xu and Wotao Yin CAAM Department, Rice University February 15, 2013 Multi-convex optimization Model definition Applications Outline
More informationDerivatives. Differentiability problems in Banach spaces. Existence of derivatives. Sharpness of Lebesgue s result
Differentiability problems in Banach spaces David Preiss 1 Expanded notes of a talk based on a nearly finished research monograph Fréchet differentiability of Lipschitz functions and porous sets in Banach
More informationVariational and Topological methods : Theory, Applications, Numerical Simulations, and Open Problems 6-9 June 2012, Northern Arizona University
Variational and Topological methods : Theory, Applications, Numerical Simulations, and Open Problems 6-9 June 22, Northern Arizona University Some methods using monotonicity for solving quasilinear parabolic
More informationMATH 722, COMPLEX ANALYSIS, SPRING 2009 PART 5
MATH 722, COMPLEX ANALYSIS, SPRING 2009 PART 5.. The Arzela-Ascoli Theorem.. The Riemann mapping theorem Let X be a metric space, and let F be a family of continuous complex-valued functions on X. We have
More informationAnalytic Continuation of Analytic (Fractal) Functions
Analytic Continuation of Analytic (Fractal) Functions Michael F. Barnsley Andrew Vince (UFL) Australian National University 10 December 2012 Analytic continuations of fractals generalises analytic continuation
More informationDeforming conformal metrics with negative Bakry-Émery Ricci Tensor on manifolds with boundary
Deforming conformal metrics with negative Bakry-Émery Ricci Tensor on manifolds with boundary Weimin Sheng (Joint with Li-Xia Yuan) Zhejiang University IMS, NUS, 8-12 Dec 2014 1 / 50 Outline 1 Prescribing
More informationExit times of diffusions with incompressible drifts
Exit times of diffusions with incompressible drifts Andrej Zlatoš University of Chicago Joint work with: Gautam Iyer (Carnegie Mellon University) Alexei Novikov (Pennylvania State University) Lenya Ryzhik
More information