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:2210.02606 (math)
[Submitted on 5 Oct 2022 (v1), last revised 6 Sep 2023 (this version, v3)]

Title:Nonlocal error bounds for piecewise affine functions

Authors:M.V. Dolgopolik
View PDF
Abstract:The paper is devoted to a detailed analysis of nonlocal error bounds for nonconvex piecewise affine functions. We both improve some existing results on error bounds for such functions and present completely new necessary and/or sufficient conditions for a piecewise affine function to have an error bound on various types of bounded and unbounded sets. In particular, we show that any piecewise affine function has an error bound on an arbitrary bounded set and provide several types of easily verifiable sufficient conditions for such functions to have an error bound on unbounded sets. We also present general necessary and sufficient conditions for a piecewise affine function to have an error bound on a finite union of polyhedral sets (in particular, to have a global error bound), whose derivation reveals a structure of sublevel sets and recession functions of piecewise affine functions.
Subjects: Optimization and Control (math.OC)
Cite as: arXiv:2210.02606 [math.OC]
  (or arXiv:2210.02606v3 [math.OC] for this version)
  https://doi.org/10.48550/arXiv.2210.02606
Journal reference: Set-Valued and Variational Analysis, vol. 31, article number 32, (2023)
Related DOI: https://doi.org/10.1007/s11228-023-00694-z

Submission history

From: Maksim Dolgopolik [view email]
[v1] Wed, 5 Oct 2022 23:43:10 UTC (19 KB)
[v2] Sat, 1 Apr 2023 00:10:40 UTC (20 KB)
[v3] Wed, 6 Sep 2023 22:04:04 UTC (20 KB)
Full-text links:

Access Paper:

view license
Current browse context:
math.OC
< prev   |   next >
new | recent | 2022-10
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?)