Abstract convex approximations of nonsmooth functions
Abstract
In this article we utilise abstract convexity theory in order to unify and generalize many different concepts from nonsmooth analysis. We introduce the concepts of abstract codifferentiability, abstract quasidifferentiability and abstract convex (concave) approximations of a nonsmooth function mapping a topological vector space to an order complete topological vector lattice. We study basic properties of these notions, construct elaborate calculus of abstract codifferentiable functions and discuss continuity of abstract codifferential. We demonstrate that many classical concepts of nonsmooth analysis, such as subdifferentiability and quasidifferentiability, are particular cases of the concepts of abstract codifferentiability and abstract quasidifferentiability. We also show that abstract convex and abstract concave approximations are a very convenient tool for the study of nonsmooth extremum problems. We use these approximations in order to obtain various necessary optimality conditions for nonsmooth nonconvex optimization problems with the abstract codifferentiable or abstract quasidifferentiable objective function and constraints. Then we demonstrate how these conditions can be transformed into simpler and more constructive conditions in some particular cases.
Cite
@article{arxiv.1810.00979,
title = {Abstract convex approximations of nonsmooth functions},
author = {M. V. Dolgopolik},
journal= {arXiv preprint arXiv:1810.00979},
year = {2018}
}
Comments
This is a slightly edited version of Accepted Manuscript of an article published by Taylor & Francis in Optimization on 13/01/2014, available online: https://doi.org/10.1080/02331934.2013.869811