Filling the gap between lower-C^1 and lower-C^2 functions
From MaRDI portal
Publication:5480079
zbMATH Open1107.26013MaRDI QIDQ5480079FDOQ5480079
Authors: Jérôme Malick, A. Daniilidis 
Publication date: 25 July 2006
Recommendations
- $\alpha $-Lower Subdifferentiable Functions
- A characterization of \(C^{1,1}\) functions via lower directional derivatives.
- Characterizations of weak sharp minima for lower-\(C^1\) functions
- Generalized convexities of lower semicontinuous functions
- A characterization of \(C^ 1\)-convex sets in Sobolev spaces
Nonsmooth analysis (49J52) Convexity of real functions of several variables, generalizations (26B25) Methods involving semicontinuity and convergence; relaxation (49J45)
Cited In (15)
- Nonconvex bundle method with application to a delamination problem
- Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems
- Area theorem and smoothness of compact Cauchy horizons
- Closing the gap between the continuous functionals and recursion in \(^3E\)
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
- Efficiency of minimizing compositions of convex functions and smooth maps
- Short paper -- A note on the Frank-Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems
- The equivalence of three types of error bounds for weakly and approximately convex functions
- Vector optimization problem and generalized convexity
- Learning with risks based on M-location
- Optimization conditions and decomposable algorithms for convertible nonconvex optimization
- $\alpha $-Lower Subdifferentiable Functions
- Variational analysis of paraconvex multifunctions
- Sard theorems for Lipschitz functions and applications in optimization
- The Morse-Sard theorem for Clarke critical values
This page was built for publication: Filling the gap between lower-\(C^1\) and lower-\(C^2\) functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5480079)
