We introduce the concept of nearly convex set-valued mappings and investigate fundamental properties of these mappings. Additionally, we establish a geometric approach for generalized differentiation of nearly convex set-valued mappings and nearly convex functions. Our contributions expand the current knowledge of nearly convex sets and functions, while providing several new results involving nearly convex set-valued mappings.

Contact details are reproduced from the original publication and may be historical.

Nguyen Mau Nam

Fariborz Maseeh Dept. of Mathematics & Statistics, Portland State University, Portland, U.S.A.

mnn3@pdx.edu

Nguyen Nang Thieu

(1) Institute of Mathematics, Vietnam Academy of Science and Technology, Hanoi, Vietnam
(2) The State University of New York, Incheon, South Korea

nnthieu@math.ac.vn

Nguyen Dong Yen

Institute of Mathematics, Vietnam Academy of Science and Technology, Hanoi, Vietnam

ndyen@math.ac.vn
  1. H. H. Bauschke, W. L. Hare, W. M. Moursi: On the range of the Douglas-Rachford operator, Math. Oper. Res. 41 (2016) 884–897.https://doi.org/10.1287/moor.2015.0759Google Scholar
  2. H. H. Bauschke, S. M. Moffat, X. Wang: Near equality, near convexity, sums of maximally monotone operators, and averages of firmly nonexpansive mappings, Math. Programming B 139 (2013) 55–70.https://doi.org/10.1007/s10107-013-0659-7Google Scholar
  3. H. H. Bauschke, W. M. Moursi: On the behavior of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint, SIAM J. Optimization 30 (2020) 2559–2576.https://doi.org/10.1137/19M1281538Google Scholar
  4. J. M. Borwein, A. S. Lewis: Convex Analysis and Nonlinear Optimization, 2nd ed., Springer, New York (2006).https://doi.org/10.1007/978-0-387-31256-9Google Scholar
  5. R. I. Boţ, G. Kassay, G. Wanka: Duality for almost convex optimization problems via the perturbation approach, J. Global Optimization 42 (2008) 385–399.https://doi.org/10.1007/s10898-008-9300-3Google Scholar
  6. D. Hinrichsen, E. Oeljeklaus: The set of controllable multi-input systems is generically convex, Math. Control Signals Systems 31 (2019) 265–278.https://doi.org/10.1007/s00498-019-0243-7Google Scholar
  7. J. B. Hiriart-Urruty, C. Lemaréchal: Convex Analysis and Minimization Algorithms. I: Fundamentals, Springer, Berlin (1993).https://doi.org/10.1007/978-3-662-02796-7Google Scholar
  8. J. Li, G. Mastroeni: Near equality and almost convexity of functions with applications to optimization and error bounds, J. Convex Analysis 26 (2019) 785–822.https://doi.org/10.68381/jca26043Google Scholar
  9. H. Luo, X. Wang, B. Lukens: Variational analysis on the signed distance functions, J. Optim. Theory Appl. 180 (2019) 751–774.https://doi.org/10.1007/s10957-018-1414-2Google Scholar
  10. G. J. Minty: On the maximal domain of a “monotone” function, Michigan Math. J. 8 (1961) 135–137.https://doi.org/10.1307/mmj/1028998564Google Scholar
  11. S. M. Moffat, W. M. Moursi, X. Wang: Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions, Math. Programming A 160 (2016) 193–223.https://doi.org/10.1007/s10107-016-0980-zGoogle Scholar
  12. B. S. Mordukhovich, N. M. Nam: Convex Analysis and Beyond. I: Basic Theory, Springer, Cham (2022).https://doi.org/10.1007/978-3-030-94785-9Google Scholar
  13. B. S. Mordukhovich, N. M. Nam: An Easy Path to Convex Analysis and Applications, 2nd ed., Springer, Cham (2023).https://doi.org/10.1007/978-3-031-26458-0Google Scholar
  14. W. M. Moursi: The forward-backward algorithm and the normal problem, J. Optim. Theory Appl. 176 (2018) 605–624.https://doi.org/10.1007/s10957-017-1113-4Google Scholar
  15. R. T. Rockafellar: Convex Analysis, Princeton University Press, Princeton (1970).https://doi.org/10.1515/9781400873173Google Scholar
  16. R. T. Rockafellar: On the virtual convexity of the domain and range of a nonlinear maximal monotone operator, Math. Ann. 185 (1970) 81–90.https://doi.org/10.1007/BF01359698Google Scholar
  17. R. T. Rockafellar, R. J.-B. Wets: Variational Analysis, corrected 3rd printing, Springer, Berlin (2009).Google Scholar

N. M. Nam, N. N. Thieu, N. D. Yen. “Near Convexity and Generalized Differentiation.” Journal of Convex Analysis 32 (2025), No. 2, 605–630. https://doi.org/10.68381/jca32030