English

Yet Another Convex Sets Subtraction with Application in Nondifferentiable Optimization

Optimization and Control 2018-06-18 v2

Abstract

This paper introduces a new subtraction operation for convex sets, which defines their difference as a collection of inclusion-minimal convex sets with appropriate definitions of linear operations on them. With these operations the set of collections becomes a linear vector space with common zero and possibility to invert Minkowski summation. As the demonstration of usability of this concept the Lipschitz continuity of ϵ\epsilon-subdifferentials of convex analysis is proved in a novel way.

Keywords

Cite

@article{arxiv.1801.06946,
  title  = {Yet Another Convex Sets Subtraction with Application in Nondifferentiable Optimization},
  author = {Evgeni Nurminski and Stan Uryasev},
  journal= {arXiv preprint arXiv:1801.06946},
  year   = {2018}
}
R2 v1 2026-06-22T23:51:31.487Z