Revisiting Invex Functions: Explicit Kernel Constructions and Characterizations
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910098511626240 |
|---|---|
| author | Nishioka, Akatsuki |
| author_facet | Nishioka, Akatsuki |
| contents | An invex function generalizes a convex function in the sense that every stationary point is a global minimizer. Recently, invex functions and their subclasses have attracted attention in signal processing and machine learning. However, verifying invexity is often difficult because its definition involves an unknown function called a kernel function. This paper studies kernel functions associated with invex functions, which have received relatively limited attention in the literature. In particular, we develop several methods for constructing explicit kernel functions and establish a characterization of pseudoconvexity in terms of kernel functions. These results provide constructive tools for proving invexity of new functions and for clarifying their structural properties. We also present examples of nonsmooth, non-pseudoconvex invex functions arising in signal processing. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_05523 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Revisiting Invex Functions: Explicit Kernel Constructions and Characterizations Nishioka, Akatsuki Optimization and Control An invex function generalizes a convex function in the sense that every stationary point is a global minimizer. Recently, invex functions and their subclasses have attracted attention in signal processing and machine learning. However, verifying invexity is often difficult because its definition involves an unknown function called a kernel function. This paper studies kernel functions associated with invex functions, which have received relatively limited attention in the literature. In particular, we develop several methods for constructing explicit kernel functions and establish a characterization of pseudoconvexity in terms of kernel functions. These results provide constructive tools for proving invexity of new functions and for clarifying their structural properties. We also present examples of nonsmooth, non-pseudoconvex invex functions arising in signal processing. |
| title | Revisiting Invex Functions: Explicit Kernel Constructions and Characterizations |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2510.05523 |