Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets

Abstract Motivated by the subsmoothness of a closed set introduced by Aussel et al. (2005)  [8] , we introduce and study the uniform subsmoothness of a collection of infinitely many closed subsets in a Banach space. Under the uniform subsmoothness assumption, we provide an interesting subdifferential formula on distance functions and consider uniform metric regularity for a kind of multifunctions frequently appearing in optimization and variational analysis. Different from the existing works, without the restriction of convexity, we consider several fundamental notions in optimization such as the linear regularity, CHIP, strong CHIP and property (G) for a collection of infinitely many closed sets. We establish relationships among these fundamental notions for an arbitrary collection of uniformly subsmooth closed sets. In particular, we extend duality characterizations of the linear regularity for a collection of closed convex sets to the nonconvex setting.

[1]  D. Varberg.  Convex Functions , 1973 .

[2]  Xi Yin Zheng,et al.  Strong KKT conditions and weak sharp solutions in convex-composite optimization , 2011, Math. Program..

[3]  Xi Yin Zheng,et al.  Characterizations of Error Bounds for Convex Multifunctions on Banach Spaces , 2004, Math. Oper. Res..

[4]  Xi Yin Zheng,et al.  Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces , 2003, SIAM J. Optim..

[5]  Frank Deutsch,et al.  A Dual Approach to Constrained Interpolationfrom a Convex Subset of Hilbert Space , 1997 .

[6]  B. Mordukhovich.  Variational analysis and generalized differentiation , 2006 .

[7]  Xi Yin Zheng,et al.  Linear Regularity for a Collection of Subsmooth Sets in Banach Spaces , 2008, SIAM J. Optim..

[8]  A. Kruger.  About Regularity of Collections of Sets , 2006 .

[9]  Jean-Paul Penot.  Optimality conditions in mathematical programming and composite optimization , 1994, Math. Program..

[10]  Xiaoqi Yang,et al.  Convex composite multi-objective nonsmooth programming , 1993, Math. Program..

[11]  L. Thibault,et al.  Prox-Regularity of Functions and Sets in Banach Spaces , 2004 .

[12]  Charles K. Chui,et al.  Constrained best approximation in Hilbert space, II , 1992 .

[13]  C. Zălinescu.  Convex analysis in general vector spaces , 2002 .

[14]  A. Ioffe.  Metric regularity and subdifferential calculus , 2000 .

[15]  A. Daniilidis,et al.  Subsmooth sets: Functional characterizations and related concepts , 2004 .

[16]  Measure of Non-Radon–Nikodym Property and Differentiability of Convex Functions on Banach Spaces , 2005 .

[17]  R. Rockafellar,et al.  Prox-regular functions in variational analysis , 1996 .

[18]  L. Thibault,et al.  Uniform prox-regularity of functions and epigraphs in Hilbert spaces , 2005 .

[19]  Chong Li,et al.  The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces , 2007, SIAM J. Optim..

[20]  Michel Théra,et al.  Metric Inequality, Subdifferential Calculus and Applications , 2001 .

[21]  Chong Li,et al.  Majorizing Functions and Convergence of the Gauss--Newton Method for Convex Composite Optimization , 2007, SIAM J. Optim..

[22]  Wu Li,et al.  Best Approximation from the Intersection of a Closed Convex Set and a Polyhedron in Hilbert Space, Weak Slater Conditions, and the Strong Conical Hull Intersection Property , 1999, SIAM J. Optim..

[23]  G. Jameson.  The Duality of Pairs of Wedges , 1972 .

[24]  A. Lewis,et al.  Error Bounds for Convex Inequality Systems , 1998 .

[25]  Xi Yin Zheng,et al.  Calmness for L-Subsmooth Multifunctions in Banach Spaces , 2008, SIAM J. Optim..

[26]  G. Jameson.  Ordered Linear Spaces , 1970 .

[27]  B. Mordukhovich.  Complete characterization of openness, metric regularity, and Lipschitzian properties of multifunctions , 1993 .

[28]  Dinh The Luc,et al.  Convex composite non–Lipschitz programming , 2002, Math. Program..

[29]  Robert S. Womersley,et al.  Local properties of algorithms for minimizing nonsmooth composite functions , 1985, Math. Program..

[30]  Wei Hong Yang,et al.  Error Bounds for Abstract Linear Inequality Systems , 2002, SIAM J. Optim..

[31]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[32]  Jong-Shi Pang,et al.  Error bounds in mathematical programming , 1997, Math. Program..

[33]  Yu. S. Ledyaev,et al.  Nonsmooth analysis and control theory , 1998 .

[34]  B. Mordukhovich,et al.  Nonsmooth sequential analysis in Asplund spaces , 1996 .

[35]  Diethard Klatte,et al.  Nonsmooth Equations in Optimization: "Regularity, Calculus, Methods And Applications" , 2006 .

[36]  Wu Li,et al.  Strong CHIP, normality, and linear regularity of convex sets , 2005 .

[37]  Heinz H. Bauschke,et al.  On Projection Algorithms for Solving Convex Feasibility Problems , 1996, SIAM Rev..

[38]  F. Clarke,et al.  Proximal Smoothness and the Lower{C 2 Property , 1995 .

[39]  W. Li,et al.  Fenchel Duality and the Strong Conical Hull Intersection Property , 1999 .

[40]  Heinz H. Bauschke,et al.  Strong conical hull intersection property, bounded linear regularity, Jameson’s property (G), and error bounds in convex optimization , 1999, Math. Program..

[41]  R. Rockafellar,et al.  The radius of metric regularity , 2002 .

[42]  V. Jeyakumar.  The strong conical hull intersection property for convex programming , 2006, Math. Program..

[43]  Paul Tseng,et al.  Bounded Linear Regularity, Strong CHIP, and CHIP are Distinct Properties , 2000 .

[44]  R. Rockafellar,et al.  Local differentiability of distance functions , 2000 .