Decomposition of Approximately Monotone and Convex Sequences
Angshuman Robin Goswami

TL;DR
This paper explores how approximately monotone and convex sequences can be decomposed into simpler components, introduces a new operator for convex functions, and studies their properties and relationships.
Contribution
It provides novel decomposition methods for approximately monotone and convex sequences and introduces a twisting operator with applications to convex functions.
Findings
Any sequence can be expressed as the difference of two nondecreasing sequences.
Approximately monotone sequences can be closely approximated by non-decreasing sequences.
Approximately convex sequences can be written as the difference of a convex sequence and a Lipschitz sequence.
Abstract
In this paper, we primarily deal with approximately monotone and convex sequences. We start by showing that any sequence can be expressed as the difference between two nondecreasing sequences. One of these two monotone sequences act as the majorant of the original sequence, while the other possesses non-negativity. Another result establishes that an approximately monotone(increasing) sequence can be closely approximated by a non-decreasing sequence. A similar assertion can be made for approximately convex sequence. A sequence is said to be approximately convex (or -convex) if the following inequality holds under the mentioned assumptions \begin{equation*} u_{i}- u_{i-1}\leq u_{j}-u_{j-1}+\varepsilon\quad\quad\mbox{ where}\quad\quad i,j\in\mathbb{N} \quad \mbox{with} \quad i<j. \end{equation*} We proved that an approximately convex sequence can…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis
