On the Set of Possible Minimizers of a Sum of Convex Functions

Zamani, Moslem;Glineur, François;Hendrickx, Julien
(2024) IEEE Control Systems Letters — Vol. 8, p. 1871-1876 (2024)

Files

On_the_Set_of_Possible_Minimizers_of_a_Sum_of_Convex_Functions.pdf
  • Open Access
  • Adobe PDF
  • 922.05 KB
Download

Details

Authors
Abstract
Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this letter, we give an exact characterization of the set of possible minimizers of the sum. Our results cover several types of assumptions on the summands, such as smoothness or strong convexity. Our main tool is the use of necessary and sufficient conditions for interpolating the considered function classes, which leads to shorter and more direct proofs in comparison with previous work. We also address the setting where each summand minimizer is assumed to lie in a unit ball, and prove a tight bound on the norm of any minimizer of the sum.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Zamani, M., Glineur, F., & Hendrickx, J. (2024). On the Set of Possible Minimizers of a Sum of Convex Functions. IEEE Control Systems Letters, 8, 1871-1876. https://doi.org/10.1109/lcsys.2024.3414378 (Original work published 2024)