general perturbations
|
|
- Amice Washington
- 5 years ago
- Views:
Transcription
1 under general perturbations (B., Kassay, Pini, Conditioning for optimization problems under general perturbations, NA, 2012) Dipartimento di Matematica, Università degli Studi di Genova February 28, 2012
2 Content 1 Introduction to conditioning The case of linear equation in finite dimensional space The case of generalized equation Condition number for scalar optimization problem 2 3 Sensitivity result Distance theorem Strongly convex programming
3 The case of linear equation in finite dimensional space The case of generalized equation Condition number for scalar optimization problem The goal of the analysis in a parametric (optimization) problem is to study how a change in the data affects the solution of the given problem. Qualitative approach: continuity properties of the solution map (stability analysis); Quantitative approach: Lipschitzian properties of the solution map (sensitivity analysis and condition number theory). Given a parametric (optimization) problem, a condition number essentially gives the following information: upper bound of the ratio of the size of the solution error to the size of the data error (Lipschitz modulus); how the initial problem can be perturbed in order to preserve its good properties.
4 The case of linear equation in finite dimensional space The case of generalized equation Condition number for scalar optimization problem Let A L(R n, R n ) and consider the equation Ax = p. If A in nonsingular, then the unique solution is x = A 1 p and A 1 (p) A 1 (p ) p p A 1 Theorem (Eckart-Young) Let A L(R n, R n ), nonsingular. Then min { B : A + B singular } = 1 B L(R n,r n ) A 1
5 The case of linear equation in finite dimensional space The case of generalized equation Condition number for scalar optimization problem Let X and P be Banach spaces and F : X P. The set of solution of the generalized equation p F (x) is given by S F (p) = {x X : x = F 1 (p)} and it is nonempty for p F (X ). i) How does S F (p) behave with respect to perturbations in p? (Lipschitzian property) ii) How does S F (p) behave with respect to perturbations of F? (Distance-type theorem)
6 The case of linear equation in finite dimensional space The case of generalized equation Condition number for scalar optimization problem (A.L.Dontchev, A.S. Lewis and R.T. Rockafellar, The radius of metric regularity, Trans. AMS, 2002) Fix a point (x, p) gph(f ). Definition (Metric regularity) The map F is said to be metrically regular around (x, p) when there exists k > 0 such that d(x, F 1 (p)) kd(p, F (x)) (1.1) for all (x, p) close to (x, p). The infimum of k such that (1.1) holds, is the regularity modulus of F around (x, p) and it is denoted by reg(f ; x p). For a single-valued linear map A in a finite dimensional space, the regularity modulus is the same for all (x, p) gph(a) and it is given by reg(a) = A 1
7 The case of linear equation in finite dimensional space The case of generalized equation Condition number for scalar optimization problem B X (x, r) denotes the open ball in X centered at x with radius r and B X (x, r) its closure. Definition (Aubin property) We say that F has the Aubin property around (x, p) when there exists k > 0 and a neighbourhood V of p such that F (x ) V F (x) + k x x B P (0, 1) (1.2) for all x, x close to x. The infimum of k such that (1.2) holds, is the Lipschitz moduls of F around (x, p) and it is denoted by lip(f ; x p).
8 The case of linear equation in finite dimensional space The case of generalized equation Condition number for scalar optimization problem Remark If F is single-valued around x, the Aubin property is the ordinary Lipschitz continuity of map around x: lip(f ; x) = lip(f ; x F (x)) = F (x) F (x ) lim sup x,x x,x x x x Remark Notice that reg(f ; x p) = lip(f 1 ; p x)
9 The case of linear equation in finite dimensional space The case of generalized equation Condition number for scalar optimization problem Given a map F such that reg(f ; x p) < +, how far can we perturbe it, with a map G in a suitable class, before loosing metrical regularity of F + G around a suitable point of its graph? Theorem (Estimates for Lipschitz perturbations) Consider a map F : X P and (x, p) gph(f ) at which gph(f ) is locally closed. Let k and µ be non negative constants such that reg(f ; x p) k, kµ < 1. Then for any function g : X P such that lip(g; x) < µ, we have reg(g + F ; x p + g(x) < k 1 kµ
10 The case of linear equation in finite dimensional space The case of generalized equation Condition number for scalar optimization problem Corollary (Distance-type result) Consider a map F : X P and (x, p) gph(f ) at which gph(f ) is locally closed. Let g : X P a Lipschitz map around x, then inf g {lip(g; x) : F + g is not metrically regular around (x, p + g(x)} 1 reg(f ; x p).
11 The case of linear equation in finite dimensional space The case of generalized equation Condition number for scalar optimization problem (T. Zolezzi, Condition number theorem in optimization, SIAM J. Optim., 2003) E is a real Banach space and E is its dual, denotes the duality pairing B(x, r) (B (p, r)) is the closed ball in E (E ) with center x (p) and radius r C 1,1 denotes the class of Fréchet differentiable functions such that the Fréchet derivative Df is a Lipschitz function. Given f C 1,1 (B(0, L)), and p E, consider the problem and the solution map min f p = min (f p, ) (O p ) B(0,L) B(0,L) m : B (0, r) E E, m(p) = argmin(b(0, L), f p )
12 The case of linear equation in finite dimensional space The case of generalized equation Condition number for scalar optimization problem The condition number cond(f ) is defined, under the assumption that the map m is single valued close to 0, as follows: cond(f ) = m(p) m(q) lim sup p,q 0, p q p q If m(0) = 0, i.e. argmin(b(0, L), f ) = {0}, then cond(f ) = lip(m; 0) = reg(m 1 ; 0 0). Furthermore, if m(p) B(0, L) for sufficiently small p, then Df (m(p)) = p and cond(f ) = lip(df 1 ; 0 0)
13 The case of linear equation in finite dimensional space The case of generalized equation Condition number for scalar optimization problem Class T 1 : functions f C 1,1 (B(0, L)) such that argmin(b(0, L), f ) = {0} argmin(b(0, L), f p ) for small p p argmin(b(0, L), f p ) upper hemicontinuous at p = 0. Class W 1 : functions f : B(0, L) R such that argmin(b(0, L), f p ) singleton for small p cond(f ) < +. Define I 1 = {g T 1 : g / W 1 } (ill conditioned problems).
14 The case of linear equation in finite dimensional space The case of generalized equation Condition number for scalar optimization problem The class C 1,1 (B(0, L)) is endowed with the pseudodistance { } Df1 (u) Df 2 (u) Df 1 (v) + Df 2 (v) d(f 1, f 2 ) = u v sup u,v Bm(0,L) Theorem (Distance-type theorem) Let f T 1 W 1 be such that Df one to one near 0. Let g T 1 1 be such that d(f, g) < cond(f ). Then g W 1. Corollary Let f T 1 W 1 be such that Df one to one near 0. Then dist(f, I 1 ) 1 cond(f ).
15 Definition (Condition number) Given f C 1,1 (B(0, L)) such that Df (0) = 0 Df is one to one near 0 we define the condition number as the positive extended real number: u v ĉ(f ) = lim sup u,v 0, u v Df (u) Df (v). Notice that ĉ(f ) 1 L Df > 0 where L Df is the Lipschitz constant of Df on B(0, L).
16 Assuming that Df is open at 0, i.e. 0 intdf (B(0, s)) s small enough ĉ(f ) is just the lipschitz modulus lip((df ) 1 ; 0) of (Df ) 1 at 0: ĉ(f ) = lim sup p,q 0, p q (Df ) 1 (p) (Df ) 1 (q). p q Notice that ĉ(f ) < + if and only if (Df ) 1 is Lipschitz near 0.
17 Sensitivity result Distance theorem Strongly convex programming Perturbed optimization problems Given a function f C 1,1 (B(0, L)) and a perturbation function g : E B(0, L) R, we consider for each p E the class of perturbed optimization problems: min F g (p, u) = min f (u) g(p, u) u B(0,L) u B(0,L) (OP(F g, p)) satisfying the assumptions i) g(0, ) = 0; ii) g(p, ) C 1,1 (B(0, L)), for each p E ; iii) sup u B(0,L) Dg(p, u) 0 if p 0, where Dg is the Fréchet derivative of g w.r.t. the second argument.
18 Sensitivity result Distance theorem Strongly convex programming The class T g Fix a perturbation function g. The class T g contains all the functions f C 1,1 (B(0, L)) such that: Argmin (B(0, L), f ) = {0}; Argmin (B(0, L), F g (p, )) is nonempty for small p; the map p Argmin(B(0, L), F g (p, )) is upper hemicontinuous at p = 0.
19 Sensitivity result Distance theorem Strongly convex programming The class W g The class W g contains all functions f T g such that: Df is one to one in a neighbourhood of 0; Df satisfies the openness property; ĉ(f ) < + ; there exists 0 < s < L such that Argmin(B(0, L), F g (p, )) B(0, s) is a singleton, for every sufficiently small p. The functions in W g give rise to what will be called a well conditioned optimization problem.
20 Sensitivity result Distance theorem Strongly convex programming Denote by m(p) the Argmin(B(0, L), F g (p, )) B(0, s) for p small. For a function f W g, the map p m(p) is single valued if we restrict our attention to a neighbourhood of 0 in E, and continuous at p = 0, with m(0) = {0}. The case where the map is locally constant, i.e. m(p) = {0} for all p in a neighborhood of 0, is not interesting; we can get rid of it by assuming that Dg(p, 0) 0 if p 0.
21 Sensitivity result Distance theorem Strongly convex programming Theorem 1 (Sensitivity) Suppose that the Fréchet derivative Dg : E B(0, L) E of the perturbation function g is Lipschitz, i.e. there exists L > 0 such that Dg(p, u) Dg(q, v) L( p q + u v ). Take f W g such that ĉ(f ) < 1/L. If Dg(p, 0) 0 when p 0, then, for every 0 < ɛ < (1 Lĉ(f ))/L, there exists a neighborhood of 0 E such that the map p m(p) is Lipschitz with constant L m (ĉ(f ) + ɛ)l 1 ĉ(f )L Lɛ.
22 Sensitivity result Distance theorem Strongly convex programming Theorem 2 (Distance-type theorem) Let f W g, and suppose that there exists γ > 1 such that, for p small enough, L Dg(p, ) ĉ(f ) < 1 γ. (3.1) Denote by h any function in the class T g such that Then h W g. d(f, h) < γ 1 γ 1 ĉ(f ). Notice that condition (3.1) holds for some γ > 1 if the Fréchet derivative Dg : E B(0, L) E of the perturbation function is Lipschitz and ĉ(f ) < 1/L.
23 Sensitivity result Distance theorem Strongly convex programming Corollary Let f W g, and suppose that there exists γ > 1 such that for p small enough, If h T g \ W g then L Dg(p, ) ĉ(f ) < 1 γ. d(f, h) γ 1 γ 1 ĉ(f ).
24 Sensitivity result Distance theorem Strongly convex programming Strongly convex functions E is a reflexive Banach space. Definition Let f : C E R be a function on the convex set C. We say that f is strongly convex with convexity modulus α > 0 if f ((1 t)u + tv) (1 t)f (u) + tf (v) α(1 t)t u v 2, u, v C, t [0, 1]. If f is Fréchet differentiable, strong convexity is equivalent to the strong monotonicity of Df on C, i.e. < Df (u) Df (v), u v > 2α u v 2, u, v C.
25 Sensitivity result Distance theorem Strongly convex programming Notice that strong monotonicity of Df trivially implies that f is one to one near 0; moreover ĉ(f ) u v 2 lim sup u,v 0, u v Df (u) Df (v), u v 1 2α. Proposition 1 Let f be a function in C 1,1 (B(0, L)) such that Df (0) = 0 holds. Suppose that f is strongly convex with convexity modulus equal to α > 0. Then Df in open at 0.
26 Sensitivity result Distance theorem Strongly convex programming Problem stable under perturbation Let us now consider a perturbation function g : E B(0, L) R satisfying the following conditions: i) g(0, ) = 0; ii) g(p, ) C 1,1 (B(0, L)), and it is a concave function for all small p E ; iii) the mapping (p, u) Dg(p, u) is continuous at (0, 0). These assumptions entail that the parametric optimization problem is stable under perturbation (see Kassay, G. and J. Kolumban, 2000).
27 Sensitivity result Distance theorem Strongly convex programming Proposition 2 Let f be a function in C 1,1 (B(0, L)) such that Df (0) = 0 holds, and assume that f is strongly convex. Consider a perturbation function g : E B(0, L) R satisfying i) iii). Then the function f belongs to W g.
28 Sensitivity result Distance theorem Strongly convex programming Main references 1. M. Bianchi, G. Kassay and R. Pini, Conditioning for optimization problems under general perturbations, NA, Vol. 75, pp , A.L.Dontchev, A.S. Lewis and R.T. Rockafellar, The radius of metric regularity, Trans. AMS, A.L.Dontchev and R.T. Rockafellar, Implicit Functions and Solution Mappings, Springer, G. Kassay and J. Kolumban, Multivalued parametric variational inequalities with α-pseudomonotone maps, J. Optim. Theory and Appl., Vol. 107, pp.35-50, T. Zolezzi, Condition number theorems in optimization, SIAM J. OPTIM, Vol. 14, pp , 2003.
Radius Theorems for Monotone Mappings
Radius Theorems for Monotone Mappings A. L. Dontchev, A. Eberhard and R. T. Rockafellar Abstract. For a Hilbert space X and a mapping F : X X (potentially set-valued) that is maximal monotone locally around
More informationfor all u C, where F : X X, X is a Banach space with its dual X and C X
ROMAI J., 6, 1(2010), 41 45 PROXIMAL POINT METHODS FOR VARIATIONAL INEQUALITIES INVOLVING REGULAR MAPPINGS Corina L. Chiriac Department of Mathematics, Bioterra University, Bucharest, Romania corinalchiriac@yahoo.com
More informationConditioning of linear-quadratic two-stage stochastic programming problems
Conditioning of linear-quadratic two-stage stochastic programming problems W. Römisch Humboldt-University Berlin Institute of Mathematics http://www.math.hu-berlin.de/~romisch (K. Emich, R. Henrion) (WIAS
More informationThe Implicit Function and Inverse Function Theorems
The Implicit Function and Inverse Function Theorems Selina Klien 12. November 2015 Selina Klien Implicit Functions and Solution Mappings 12. November 2015 1 / 45 Outline 1 Introduction Important s 2 Implicit
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 informationAubin Criterion for Metric Regularity
Journal of Convex Analysis Volume 13 (2006), No. 2, 281 297 Aubin Criterion for Metric Regularity A. L. Dontchev Mathematical Reviews, Ann Arbor, MI 48107, USA ald@ams.org M. Quincampoix Laboratoire de
More informationOn the Midpoint Method for Solving Generalized Equations
Punjab University Journal of Mathematics (ISSN 1016-56) Vol. 40 (008) pp. 63-70 On the Midpoint Method for Solving Generalized Equations Ioannis K. Argyros Cameron University Department of Mathematics
More informationON A CLASS OF NONSMOOTH COMPOSITE FUNCTIONS
MATHEMATICS OF OPERATIONS RESEARCH Vol. 28, No. 4, November 2003, pp. 677 692 Printed in U.S.A. ON A CLASS OF NONSMOOTH COMPOSITE FUNCTIONS ALEXANDER SHAPIRO We discuss in this paper a class of nonsmooth
More informationMidterm 1. Every element of the set of functions is continuous
Econ 200 Mathematics for Economists Midterm Question.- Consider the set of functions F C(0, ) dened by { } F = f C(0, ) f(x) = ax b, a A R and b B R That is, F is a subset of the set of continuous functions
More informationBORIS MORDUKHOVICH Wayne State University Detroit, MI 48202, USA. Talk given at the SPCOM Adelaide, Australia, February 2015
CODERIVATIVE CHARACTERIZATIONS OF MAXIMAL MONOTONICITY BORIS MORDUKHOVICH Wayne State University Detroit, MI 48202, USA Talk given at the SPCOM 2015 Adelaide, Australia, February 2015 Based on joint papers
More informationFunctional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...
Functional Analysis Franck Sueur 2018-2019 Contents 1 Metric spaces 1 1.1 Definitions........................................ 1 1.2 Completeness...................................... 3 1.3 Compactness......................................
More informationYuqing Chen, Yeol Je Cho, and Li Yang
Bull. Korean Math. Soc. 39 (2002), No. 4, pp. 535 541 NOTE ON THE RESULTS WITH LOWER SEMI-CONTINUITY Yuqing Chen, Yeol Je Cho, and Li Yang Abstract. In this paper, we introduce the concept of lower semicontinuous
More informationLecture 5: The Bellman Equation
Lecture 5: The Bellman Equation Florian Scheuer 1 Plan Prove properties of the Bellman equation (In particular, existence and uniqueness of solution) Use this to prove properties of the solution Think
More informationMetric regularity and systems of generalized equations
Metric regularity and systems of generalized equations Andrei V. Dmitruk a, Alexander Y. Kruger b, a Central Economics & Mathematics Institute, RAS, Nakhimovskii prospekt 47, Moscow 117418, Russia b School
More informationExistence results for quasi-equilibrium problems
Existence results for quasi-equilibrium problems D. Aussel J. Cotrina A. Iusem January 03, 2014 Abstract Recently in Castellani-Guili (J. Optim. Th. Appl., 147 (2010), 157-168), it has been showed that
More informationLecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University
Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University February 7, 2007 2 Contents 1 Metric Spaces 1 1.1 Basic definitions...........................
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationContents: 1. Minimization. 2. The theorem of Lions-Stampacchia for variational inequalities. 3. Γ -Convergence. 4. Duality mapping.
Minimization Contents: 1. Minimization. 2. The theorem of Lions-Stampacchia for variational inequalities. 3. Γ -Convergence. 4. Duality mapping. 1 Minimization A Topological Result. Let S be a topological
More informationA FIXED POINT THEOREM FOR GENERALIZED NONEXPANSIVE MULTIVALUED MAPPINGS
Fixed Point Theory, (0), No., 4-46 http://www.math.ubbcluj.ro/ nodeacj/sfptcj.html A FIXED POINT THEOREM FOR GENERALIZED NONEXPANSIVE MULTIVALUED MAPPINGS A. ABKAR AND M. ESLAMIAN Department of Mathematics,
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationON GAP FUNCTIONS OF VARIATIONAL INEQUALITY IN A BANACH SPACE. Sangho Kum and Gue Myung Lee. 1. Introduction
J. Korean Math. Soc. 38 (2001), No. 3, pp. 683 695 ON GAP FUNCTIONS OF VARIATIONAL INEQUALITY IN A BANACH SPACE Sangho Kum and Gue Myung Lee Abstract. In this paper we are concerned with theoretical properties
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 informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics MONOTONE TRAJECTORIES OF DYNAMICAL SYSTEMS AND CLARKE S GENERALIZED JACOBIAN GIOVANNI P. CRESPI AND MATTEO ROCCA Université de la Vallée d Aoste
More informationUpper sign-continuity for equilibrium problems
Upper sign-continuity for equilibrium problems D. Aussel J. Cotrina A. Iusem January, 2013 Abstract We present the new concept of upper sign-continuity for bifunctions and establish a new existence result
More informationB. Appendix B. Topological vector spaces
B.1 B. Appendix B. Topological vector spaces B.1. Fréchet spaces. In this appendix we go through the definition of Fréchet spaces and their inductive limits, such as they are used for definitions of function
More informationOn an iterative algorithm for variational inequalities in. Banach space
MATHEMATICAL COMMUNICATIONS 95 Math. Commun. 16(2011), 95 104. On an iterative algorithm for variational inequalities in Banach spaces Yonghong Yao 1, Muhammad Aslam Noor 2,, Khalida Inayat Noor 3 and
More informationOn pseudomonotone variational inequalities
An. Şt. Univ. Ovidius Constanţa Vol. 14(1), 2006, 83 90 On pseudomonotone variational inequalities Silvia Fulina Abstract Abstract. There are mainly two definitions of pseudomonotone mappings. First, introduced
More informationThe weak topology of locally convex spaces and the weak-* topology of their duals
The weak topology of locally convex spaces and the weak-* topology of their duals Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto April 3, 2014 1 Introduction These notes
More informationDiscussion Paper Series
Discussion Paper Series 2004 27 Department of Economics Royal Holloway College University of London Egham TW20 0EX 2004 Andrés Carvajal. Short sections of text, not to exceed two paragraphs, may be quoted
More informationOn constraint qualifications with generalized convexity and optimality conditions
On constraint qualifications with generalized convexity and optimality conditions Manh-Hung Nguyen, Do Van Luu To cite this version: Manh-Hung Nguyen, Do Van Luu. On constraint qualifications with generalized
More informationON A HYBRID PROXIMAL POINT ALGORITHM IN BANACH SPACES
U.P.B. Sci. Bull., Series A, Vol. 80, Iss. 3, 2018 ISSN 1223-7027 ON A HYBRID PROXIMAL POINT ALGORITHM IN BANACH SPACES Vahid Dadashi 1 In this paper, we introduce a hybrid projection algorithm for a countable
More informationZERO DUALITY GAP FOR CONVEX PROGRAMS: A GENERAL RESULT
ZERO DUALITY GAP FOR CONVEX PROGRAMS: A GENERAL RESULT EMIL ERNST AND MICHEL VOLLE Abstract. This article addresses a general criterion providing a zero duality gap for convex programs in the setting of
More informationCONVERGENCE OF APPROXIMATING FIXED POINTS FOR MULTIVALUED NONSELF-MAPPINGS IN BANACH SPACES. Jong Soo Jung. 1. Introduction
Korean J. Math. 16 (2008), No. 2, pp. 215 231 CONVERGENCE OF APPROXIMATING FIXED POINTS FOR MULTIVALUED NONSELF-MAPPINGS IN BANACH SPACES Jong Soo Jung Abstract. Let E be a uniformly convex Banach space
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 informationGeneralized Monotonicities and Its Applications to the System of General Variational Inequalities
Generalized Monotonicities and Its Applications to the System of General Variational Inequalities Khushbu 1, Zubair Khan 2 Research Scholar, Department of Mathematics, Integral University, Lucknow, Uttar
More informationApplied Mathematics Letters
Applied Mathematics Letters 25 (2012) 974 979 Contents lists available at SciVerse ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml On dual vector equilibrium problems
More informationIntroduction to Optimization Techniques. Nonlinear Optimization in Function Spaces
Introduction to Optimization Techniques Nonlinear Optimization in Function Spaces X : T : Gateaux and Fréchet Differentials Gateaux and Fréchet Differentials a vector space, Y : a normed space transformation
More informationA double projection method for solving variational inequalities without monotonicity
A double projection method for solving variational inequalities without monotonicity Minglu Ye Yiran He Accepted by Computational Optimization and Applications, DOI: 10.1007/s10589-014-9659-7,Apr 05, 2014
More informationSolution existence of variational inequalities with pseudomonotone operators in the sense of Brézis
Solution existence of variational inequalities with pseudomonotone operators in the sense of Brézis B. T. Kien, M.-M. Wong, N. C. Wong and J. C. Yao Communicated by F. Giannessi This research was partially
More informationLipschitz p-convex and q-concave maps
Lipschitz p-convex and q-concave maps J. Alejandro Chávez-Domínguez Instituto de Ciencias Matemáticas, CSIC-UAM-UCM-UC3M, Madrid and Department of Mathematics, University of Texas at Austin Conference
More informationA Brøndsted-Rockafellar Theorem for Diagonal Subdifferential Operators
A Brøndsted-Rockafellar Theorem for Diagonal Subdifferential Operators Radu Ioan Boţ Ernö Robert Csetnek April 23, 2012 Dedicated to Jon Borwein on the occasion of his 60th birthday Abstract. In this note
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 informationNon-linear factorization of linear operators
Submitted exclusively to the London Mathematical Society doi:10.1112/0000/000000 Non-linear factorization of linear operators W. B. Johnson, B. Maurey and G. Schechtman Abstract We show, in particular,
More informationWEAK CONVERGENCE OF RESOLVENTS OF MAXIMAL MONOTONE OPERATORS AND MOSCO CONVERGENCE
Fixed Point Theory, Volume 6, No. 1, 2005, 59-69 http://www.math.ubbcluj.ro/ nodeacj/sfptcj.htm WEAK CONVERGENCE OF RESOLVENTS OF MAXIMAL MONOTONE OPERATORS AND MOSCO CONVERGENCE YASUNORI KIMURA Department
More informationWeak and strong convergence theorems of modified SP-iterations for generalized asymptotically quasi-nonexpansive mappings
Mathematica Moravica Vol. 20:1 (2016), 125 144 Weak and strong convergence theorems of modified SP-iterations for generalized asymptotically quasi-nonexpansive mappings G.S. Saluja Abstract. The aim of
More informationLecture 9 Metric spaces. The contraction fixed point theorem. The implicit function theorem. The existence of solutions to differenti. equations.
Lecture 9 Metric spaces. The contraction fixed point theorem. The implicit function theorem. The existence of solutions to differential equations. 1 Metric spaces 2 Completeness and completion. 3 The contraction
More informationConvex Optimization Conjugate, Subdifferential, Proximation
1 Lecture Notes, HCI, 3.11.211 Chapter 6 Convex Optimization Conjugate, Subdifferential, Proximation Bastian Goldlücke Computer Vision Group Technical University of Munich 2 Bastian Goldlücke Overview
More information************************************* Applied Analysis I - (Advanced PDE I) (Math 940, Fall 2014) Baisheng Yan
************************************* Applied Analysis I - (Advanced PDE I) (Math 94, Fall 214) by Baisheng Yan Department of Mathematics Michigan State University yan@math.msu.edu Contents Chapter 1.
More informationA convergence result for an Outer Approximation Scheme
A convergence result for an Outer Approximation Scheme R. S. Burachik Engenharia de Sistemas e Computação, COPPE-UFRJ, CP 68511, Rio de Janeiro, RJ, CEP 21941-972, Brazil regi@cos.ufrj.br J. O. Lopes Departamento
More informationNotes on Distributions
Notes on Distributions Functional Analysis 1 Locally Convex Spaces Definition 1. A vector space (over R or C) is said to be a topological vector space (TVS) if it is a Hausdorff topological space and the
More informationClosedness of the solution mapping to parametric vector equilibrium problems
Acta Univ. Sapientiae, Mathematica, 1, 2 2009 193 200 Closedness of the solution mapping to parametric vector equilibrium problems Júlia Salamon Sapientia University, Department of Mathematics and Computer
More informationDuality (Continued) min f ( x), X R R. Recall, the general primal problem is. The Lagrangian is a function. defined by
Duality (Continued) Recall, the general primal problem is min f ( x), xx g( x) 0 n m where X R, f : X R, g : XR ( X). he Lagrangian is a function L: XR R m defined by L( xλ, ) f ( x) λ g( x) Duality (Continued)
More informationReal Analysis, 2nd Edition, G.B.Folland Elements of Functional Analysis
Real Analysis, 2nd Edition, G.B.Folland Chapter 5 Elements of Functional Analysis Yung-Hsiang Huang 5.1 Normed Vector Spaces 1. Note for any x, y X and a, b K, x+y x + y and by ax b y x + b a x. 2. It
More informationA SET OF LECTURE NOTES ON CONVEX OPTIMIZATION WITH SOME APPLICATIONS TO PROBABILITY THEORY INCOMPLETE DRAFT. MAY 06
A SET OF LECTURE NOTES ON CONVEX OPTIMIZATION WITH SOME APPLICATIONS TO PROBABILITY THEORY INCOMPLETE DRAFT. MAY 06 CHRISTIAN LÉONARD Contents Preliminaries 1 1. Convexity without topology 1 2. Convexity
More informationPreprint Stephan Dempe and Patrick Mehlitz Lipschitz continuity of the optimal value function in parametric optimization ISSN
Fakultät für Mathematik und Informatik Preprint 2013-04 Stephan Dempe and Patrick Mehlitz Lipschitz continuity of the optimal value function in parametric optimization ISSN 1433-9307 Stephan Dempe and
More informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics EPI-DIFFERENTIABILITY AND OPTIMALITY CONDITIONS FOR AN EXTREMAL PROBLEM UNDER INCLUSION CONSTRAINTS T. AMAHROQ, N. GADHI AND PR H. RIAHI Université
More informationOn robustness of the regularity property of maps
Control and Cybernetics vol. 32 (2003) No. 3 On robustness of the regularity property of maps by Alexander D. Ioffe Department of Mathematics, Technion, Haifa 32000, Israel Abstract: The problem considered
More information(convex combination!). Use convexity of f and multiply by the common denominator to get. Interchanging the role of x and y, we obtain that f is ( 2M ε
1. Continuity of convex functions in normed spaces In this chapter, we consider continuity properties of real-valued convex functions defined on open convex sets in normed spaces. Recall that every infinitedimensional
More informationCharacterisation of Accumulation Points. Convergence in Metric Spaces. Characterisation of Closed Sets. Characterisation of Closed Sets
Convergence in Metric Spaces Functional Analysis Lecture 3: Convergence and Continuity in Metric Spaces Bengt Ove Turesson September 4, 2016 Suppose that (X, d) is a metric space. A sequence (x n ) X is
More informationSOME REMARKS ON THE SPACE OF DIFFERENCES OF SUBLINEAR FUNCTIONS
APPLICATIONES MATHEMATICAE 22,3 (1994), pp. 419 426 S. G. BARTELS and D. PALLASCHKE (Karlsruhe) SOME REMARKS ON THE SPACE OF DIFFERENCES OF SUBLINEAR FUNCTIONS Abstract. Two properties concerning the space
More information("-1/' .. f/ L) I LOCAL BOUNDEDNESS OF NONLINEAR, MONOTONE OPERA TORS. R. T. Rockafellar. MICHIGAN MATHEMATICAL vol. 16 (1969) pp.
I l ("-1/'.. f/ L) I LOCAL BOUNDEDNESS OF NONLINEAR, MONOTONE OPERA TORS R. T. Rockafellar from the MICHIGAN MATHEMATICAL vol. 16 (1969) pp. 397-407 JOURNAL LOCAL BOUNDEDNESS OF NONLINEAR, MONOTONE OPERATORS
More informationMaximal Monotone Inclusions and Fitzpatrick Functions
JOTA manuscript No. (will be inserted by the editor) Maximal Monotone Inclusions and Fitzpatrick Functions J. M. Borwein J. Dutta Communicated by Michel Thera. Abstract In this paper, we study maximal
More informationITERATIVE SCHEMES FOR APPROXIMATING SOLUTIONS OF ACCRETIVE OPERATORS IN BANACH SPACES SHOJI KAMIMURA AND WATARU TAKAHASHI. Received December 14, 1999
Scientiae Mathematicae Vol. 3, No. 1(2000), 107 115 107 ITERATIVE SCHEMES FOR APPROXIMATING SOLUTIONS OF ACCRETIVE OPERATORS IN BANACH SPACES SHOJI KAMIMURA AND WATARU TAKAHASHI Received December 14, 1999
More informationAW -Convergence and Well-Posedness of Non Convex Functions
Journal of Convex Analysis Volume 10 (2003), No. 2, 351 364 AW -Convergence Well-Posedness of Non Convex Functions Silvia Villa DIMA, Università di Genova, Via Dodecaneso 35, 16146 Genova, Italy villa@dima.unige.it
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More informationMA651 Topology. Lecture 10. Metric Spaces.
MA65 Topology. Lecture 0. Metric Spaces. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Linear Algebra and Analysis by Marc Zamansky
More informationAPPLICATIONS IN FIXED POINT THEORY. Matthew Ray Farmer. Thesis Prepared for the Degree of MASTER OF ARTS UNIVERSITY OF NORTH TEXAS.
APPLICATIONS IN FIXED POINT THEORY Matthew Ray Farmer Thesis Prepared for the Degree of MASTER OF ARTS UNIVERSITY OF NORTH TEXAS December 2005 APPROVED: Elizabeth M. Bator, Major Professor Paul Lewis,
More informationA SYNOPSIS OF HILBERT SPACE THEORY
A SYNOPSIS OF HILBERT SPACE THEORY Below is a summary of Hilbert space theory that you find in more detail in any book on functional analysis, like the one Akhiezer and Glazman, the one by Kreiszig or
More informationKeywords. 1. Introduction.
Journal of Applied Mathematics and Computation (JAMC), 2018, 2(11), 504-512 http://www.hillpublisher.org/journal/jamc ISSN Online:2576-0645 ISSN Print:2576-0653 Statistical Hypo-Convergence in Sequences
More informationThe Subdifferential of Convex Deviation Measures and Risk Functions
The Subdifferential of Convex Deviation Measures and Risk Functions Nicole Lorenz Gert Wanka In this paper we give subdifferential formulas of some convex deviation measures using their conjugate functions
More informationThe local equicontinuity of a maximal monotone operator
arxiv:1410.3328v2 [math.fa] 3 Nov 2014 The local equicontinuity of a maximal monotone operator M.D. Voisei Abstract The local equicontinuity of an operator T : X X with proper Fitzpatrick function ϕ T
More informationCaristi-type Fixed Point Theorem of Set-Valued Maps in Metric Spaces
International Journal of Mathematical Analysis Vol. 11, 2017, no. 6, 267-275 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijma.2017.717 Caristi-type Fixed Point Theorem of Set-Valued Maps in Metric
More informationAppendix A Functional Analysis
Appendix A Functional Analysis A.1 Metric Spaces, Banach Spaces, and Hilbert Spaces Definition A.1. Metric space. Let X be a set. A map d : X X R is called metric on X if for all x,y,z X it is i) d(x,y)
More informationLecture 11 Hyperbolicity.
Lecture 11 Hyperbolicity. 1 C 0 linearization near a hyperbolic point 2 invariant manifolds Hyperbolic linear maps. Let E be a Banach space. A linear map A : E E is called hyperbolic if we can find closed
More informationOn Total Convexity, Bregman Projections and Stability in Banach Spaces
Journal of Convex Analysis Volume 11 (2004), No. 1, 1 16 On Total Convexity, Bregman Projections and Stability in Banach Spaces Elena Resmerita Department of Mathematics, University of Haifa, 31905 Haifa,
More informationCharacterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets A. L. Dontchev Mathematical Reviews, Ann Arbor, MI 48107 and R. T. Rockafellar Dept. of Math., Univ. of Washington,
More informationA Unified Analysis of Nonconvex Optimization Duality and Penalty Methods with General Augmenting Functions
A Unified Analysis of Nonconvex Optimization Duality and Penalty Methods with General Augmenting Functions Angelia Nedić and Asuman Ozdaglar April 16, 2006 Abstract In this paper, we study a unifying framework
More informationOn Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q)
On Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q) Andreas Löhne May 2, 2005 (last update: November 22, 2005) Abstract We investigate two types of semicontinuity for set-valued
More information1 The Existence and Uniqueness Theorem for First-Order Differential Equations
1 The Existence and Uniqueness Theorem for First-Order Differential Equations Let I R be an open interval and G R n, n 1, be a domain. Definition 1.1 Let us consider a function f : I G R n. The general
More informationThe Strong Convergence of Subgradients of Convex Functions Along Directions: Perspectives and Open Problems
J Optim Theory Appl (2018) 178:660 671 https://doi.org/10.1007/s10957-018-1323-4 FORUM The Strong Convergence of Subgradients of Convex Functions Along Directions: Perspectives and Open Problems Dariusz
More information1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty.
1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty. Let E be a subset of R. We say that E is bounded above if there exists a real number U such that x U for
More informationLecture 8. Strong Duality Results. September 22, 2008
Strong Duality Results September 22, 2008 Outline Lecture 8 Slater Condition and its Variations Convex Objective with Linear Inequality Constraints Quadratic Objective over Quadratic Constraints Representation
More informationSeminorms and locally convex spaces
(April 23, 2014) Seminorms and locally convex spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/fun/notes 2012-13/07b seminorms.pdf]
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 informationNotes for Functional Analysis
Notes for Functional Analysis Wang Zuoqin (typed by Xiyu Zhai) November 6, 2015 1 Lecture 18 1.1 The convex hull Let X be any vector space, and E X a subset. Definition 1.1. The convex hull of E is the
More informationOn duality theory of conic linear problems
On duality theory of conic linear problems Alexander Shapiro School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 3332-25, USA e-mail: ashapiro@isye.gatech.edu
More informationSubdifferentiability and the Duality Gap
Subdifferentiability and the Duality Gap Neil E. Gretsky (neg@math.ucr.edu) Department of Mathematics, University of California, Riverside Joseph M. Ostroy (ostroy@econ.ucla.edu) Department of Economics,
More informationON THE ESSENTIAL BOUNDEDNESS OF SOLUTIONS TO PROBLEMS IN PIECEWISE LINEAR-QUADRATIC OPTIMAL CONTROL. R.T. Rockafellar*
ON THE ESSENTIAL BOUNDEDNESS OF SOLUTIONS TO PROBLEMS IN PIECEWISE LINEAR-QUADRATIC OPTIMAL CONTROL R.T. Rockafellar* Dedicated to J-L. Lions on his 60 th birthday Abstract. Primal and dual problems of
More informationLocal strong convexity and local Lipschitz continuity of the gradient of convex functions
Local strong convexity and local Lipschitz continuity of the gradient of convex functions R. Goebel and R.T. Rockafellar May 23, 2007 Abstract. Given a pair of convex conjugate functions f and f, we investigate
More informationHölder Metric Subregularity with Applications to Proximal Point Method
Hölder Metric Subregularity with Applications to Proximal Point Method GUOYIN LI and BORIS S. MORDUKHOVICH Revised Version: October 1, 01 Abstract This paper is mainly devoted to the study and applications
More informationREVIEW OF ESSENTIAL MATH 346 TOPICS
REVIEW OF ESSENTIAL MATH 346 TOPICS 1. AXIOMATIC STRUCTURE OF R Doğan Çömez The real number system is a complete ordered field, i.e., it is a set R which is endowed with addition and multiplication operations
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 informationMathematics for Economists
Mathematics for Economists Victor Filipe Sao Paulo School of Economics FGV Metric Spaces: Basic Definitions Victor Filipe (EESP/FGV) Mathematics for Economists Jan.-Feb. 2017 1 / 34 Definitions and Examples
More informationAn introduction to some aspects of functional analysis
An introduction to some aspects of functional analysis Stephen Semmes Rice University Abstract These informal notes deal with some very basic objects in functional analysis, including norms and seminorms
More informationVariational inequalities for set-valued vector fields on Riemannian manifolds
Variational inequalities for set-valued vector fields on Riemannian manifolds Chong LI Department of Mathematics Zhejiang University Joint with Jen-Chih YAO Chong LI (Zhejiang University) VI on RM 1 /
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 informationWeak sharp minima on Riemannian manifolds 1
1 Chong Li Department of Mathematics Zhejiang University Hangzhou, 310027, P R China cli@zju.edu.cn April. 2010 Outline 1 2 Extensions of some results for optimization problems on Banach spaces 3 4 Some
More information1. Bounded linear maps. A linear map T : E F of real Banach
DIFFERENTIABLE MAPS 1. Bounded linear maps. A linear map T : E F of real Banach spaces E, F is bounded if M > 0 so that for all v E: T v M v. If v r T v C for some positive constants r, C, then T is bounded:
More information1. Nonlinear Equations. This lecture note excerpted parts from Michael Heath and Max Gunzburger. f(x) = 0
Numerical Analysis 1 1. Nonlinear Equations This lecture note excerpted parts from Michael Heath and Max Gunzburger. Given function f, we seek value x for which where f : D R n R n is nonlinear. f(x) =
More informationBrøndsted-Rockafellar property of subdifferentials of prox-bounded functions. Marc Lassonde Université des Antilles et de la Guyane
Conference ADGO 2013 October 16, 2013 Brøndsted-Rockafellar property of subdifferentials of prox-bounded functions Marc Lassonde Université des Antilles et de la Guyane Playa Blanca, Tongoy, Chile SUBDIFFERENTIAL
More information