Back to Search
Start Over
Functions and Sets of Smooth Substructure: Relationships and Examples.
- Source :
- Computational Optimization & Applications; Mar2006, Vol. 33 Issue 2/3, p249-270, 22p, 1 Diagram
- Publication Year :
- 2006
-
Abstract
- The past decade has seen the introduction of a number of classes of nonsmooth functions possessing smooth substructure, e.g., ‘amenable functions’, ‘partly smooth functions’, and ‘g o F decomposable Junctions’. Along with these classes a number of structural properties have been proposed, e.g., ‘identifiable suifaces’. ‘fast tracks’, and ‘primal-dual gradient structures’. In this paper we examine the relationships between these various classes of functions and their smooth substructures. In the convex case we show that the definitions of identifiable surfaces, fast tracks, and partly smooth functions are equivalent. In the nonconvex case we discuss when a primal-dual gradient structure or g o F decomposition implies the function is partly smooth, and vice versa. We further provide examples to show these classes are not equal. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 09266003
- Volume :
- 33
- Issue :
- 2/3
- Database :
- Complementary Index
- Journal :
- Computational Optimization & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 20979579
- Full Text :
- https://doi.org/10.1007/s10589-005-3059-4