Skip to content
DraconiticResearch
Search Sources API
189,280 studies31 sourcesUpdated 52 min ago
PreprintCC BY 4.0arXiv

Finite convexification by Minkowski summation

  • Mark Meyer
Open at sourcePDFDOICite

Abstract

Let A⊂ℝn be a nonempty compact set and let K⊂ℝn be a nonempty compact convex set. We study the problem of when there exists λ>0 such that the Minkowski sum A+λK is convex. First, we show that this finite convexification is equivalent to a uniform covering condition on the exposed sets of A and K. We then show that another characterization is possible in terms of the covering radii of the iterated exposed sets after translating each exposed face of K so that its relative centroid is $0$. In the case of convex polytopes, we show that it suffices to check the exposed sets in the first level of the iteration. We also study several special cases, such as strictly convex convexifiers, lower-dimensional convexifiers, strongly isomorphic polytopes, and the planar case.

Related

  1. A generating function identity for finite and symmetric multiple zeta values via Dougall's bilateral 2H2 summation
    Takumi Maesaka, Masataka Ono
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  2. On the convexification of a bilinearly constrained set with a common variable
    Hyun-Ju Oh, Boshi Yang
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. On the partial convexification for low-rank spectral optimization: rank bounds and algorithms
    Yongchun Li, Weijun Xie
    Mathematical ProgrammingPeer-reviewedCC BYFull textOptimisation & controlHAL
  4. Fuel-optimal Boost-Back Guidance via Successive Convexification with a Terminal Constraint for ReusableLaunch Vehicles
    Mingyeom Kim, Changhyun Kang, Dohyun Lee +1
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  5. A constructive solution to Talagrand's Gaussian convexification problem
    Othmane Mazhar
    arXivPreprintarXiv licenceFull textGeometry & topologyProbabilityarXiv

Cite

BibTeXRIS
BibTeX
@misc{meyer2026finite,
  title = {{Finite convexification by Minkowski summation}},
  author = {Mark Meyer},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.26744},
  eprint = {2610.26744},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.26744},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Finite convexification by Minkowski summation
AU  - Mark Meyer
PY  - 2026
DA  - 2026/10/19
PB  - arXiv
DO  - 10.48550/arxiv.2610.26744
UR  - https://arxiv.org/abs/2610.26744
AB  - Let A⊂ℝ^n be a nonempty compact set and let K⊂ℝ^n be a nonempty compact convex set. We study the problem of when there exists λ>0 such that the Minkowski sum A+λK is convex. First, we show that this finite convexification is equivalent to a uniform covering condition on the exposed sets of A and K. We then show that another characterization is possible in terms of the covering radii of the iterated exposed sets after translating each exposed face of K so that its relative centroid is $0$. In the case of convex polytopes, we show that it suffices to check the exposed sets in the first level of the iteration. We also study several special cases, such as strictly convex convexifiers, lower-dimensional convexifiers, strongly isomorphic polytopes, and the planar case.
ER  -