Discrete convex subdifferentials and optimality
Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Axiomatic and generalized convexity (52A01) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)
Given a set \(S\subset\mathbb{Z}^{n},\) one denotes by \(\mathrm{conv}_{\mathbb{R}^{n} }(S)\) its convex hull as a subset of \(\mathbb{R}^{n}.\) The set \(S\) is called convex in \(\mathbb{Z}^{n}\) if \((1-\lambda)x+\lambda y\in S\) for all \(x,y\) in \(\mathrm{conv}_{\mathbb{R}^{n}}(S)\cap\mathbb{Z}^{n}\) and \(\lambda\in\lbrack0,1]\) such that \((1-\lambda)x+\lambda y\in\) \(\mathbb{Z}^{n}\). An extended real-valued function \(f:\mathbb{Z}^{n}\rightarrow\mathbb{R\cup\{\infty\}}\) is called convex if its epigraph \(\left\{ (x,\alpha)\in\mathbb{Z}^{n}\times \mathbb{R}:f(x)\leq\alpha\right\} \) is a convex set in \(\mathbb{Z}^{n} \times\mathbb{R}\). Based on previous work done by \textit{B.~Mordukhovich} and \textit{N.~M. Nam} [An easy path to convex analysis and applications. 2nd edition. Cham: Springer (2023; Zbl 1515.49004)], the authors have extended the notions of normal cone, subgradient and optimality conditions from the setting of \(\mathbb{R}^{n}\) to \(\mathbb{Z}^{n}\). Various properties and calculus rules of normal cones, subdifferentials and singular subdifferentials are established and the differences with existing analogous rules in the real domain \(\mathbb{R}^{n}\) are justified through counter-examples. The paper also includes optimality conditions for a constrained optimization problem.
- A note on discrete convexity and local optimality
- Algorithms for convex optimization
- An Easy Path to Convex Analysis and Applications
- Analysis on measure chains - a unified approach to continuous and discrete calculus
- Application of normal cones to the computation of solutions of the nonlinear Kolmogorov backward equation
- Convex analysis and beyond. Volume I. Basic theory
- Convex analysis and duality over discrete domains
- Convex analysis in \(\mathbb{Z}^n\) and applications to integer linear programming
- Convex analysis in groups and semigroups: a sampler
- Convex optimization on mixed domains
- Convexity and Steinitz's exchange property
- Convexity in cristallographical lattices
- Discrete Convex Analysis
- Discrete convex analysis
- On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application
- The Splitting Algorithms by Ryu, by Malitsky–Tam, and by Campoy Applied to Normal Cones of Linear Subspaces Converge Strongly to the Projection onto the Intersection
This page was built for publication: Discrete convex subdifferentials and optimality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6967159)
