Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Mathematics > Optimization and Control

arXiv:1812.00196 (math)
[Submitted on 1 Dec 2018 (v1), last revised 23 Feb 2019 (this version, v2)]

Title:Optimality conditions for an exhausterable function on an exhausterable set

Authors:Majid Abbasov
View PDF
Abstract:Exhausters are families of convex compact sets that allow one to represent directional derivative of the studied function at the considered point in the form of InfMax or SupMin of linear functions. Functions for which such a representation is valid we call exhausterable. The class of these functions is quite wide and contains many nonsmooth ones. The set which is given by exhausterable function is also called exhausterable.
In the present paper we describe optimality conditions for an exhausterable function on an exhausterable set. These conditions can be used for solving of many nondifferentiable optimization problems. An example that illustrate obtained results is provided.
Subjects: Optimization and Control (math.OC)
Cite as: arXiv:1812.00196 [math.OC]
  (or arXiv:1812.00196v2 [math.OC] for this version)
  https://doi.org/10.48550/arXiv.1812.00196

Submission history

From: Majid Abbasov [view email]
[v1] Sat, 1 Dec 2018 12:17:11 UTC (134 KB)
[v2] Sat, 23 Feb 2019 16:06:02 UTC (134 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
math.OC
< prev   |   next >
new | recent | 2018-12
Change to browse by:
math

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)