Ehtesham Akhter, Musavvir Ali
Published 2023-01-02Version 1
This manuscript introduces the idea of GS-exponential kind of convex functions and some of their algebraic features, and we introduce a new class GS-exponential kind of convex sets. In addition, we describe certain fundamental GS-exponential kind of convex function with characteristics in both the general and the differentiable cases. We establish the sufficient conditions of optimality and offer the proof for unconstrained as well as inequality-constrained programming while considering the assumption of GS-exponential kind of convexity.
Global and local approaches for the minimization of a sum of pointwise minima of convex functions
Algorithms for DC Programming via Polyhedral Approximations of Convex Functions
A necessary and sufficient condition on the stability of the infimum of convex functions
![QR code for arXiv:2301.00655 [math.OC]](http://oss.arxitics.com/images/favicon.svg)