Minimizing Compositions of Differences-of-Convex Functions with Smooth Mappings
Mathematics of Operations Research · 2024-05 · 49 (2) · 1140-1168
DOI: 10.1287/moor.2021.0258 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics of Operations Research, 2024-05. Verfasst von Hoai An Le Thi und 2 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 60 Literaturangaben.
Abstract (Originalsprache)
We address the so-called DC (difference-of-convex functions) composite minimization problems (or DC composite programs) whose objective function is a composition of a DC function with a continuously differentiable mapping. We first develop an algorithm named DC composite algorithm (DCCA in short) for unconstrained DC composite programs and further extend to DC composite programs with constraints of inclusion associated with a smooth mapping and a closed convex set. The convergence analysis of the proposed algorithms is investigated. Applications of DCCA for two different problems, computation of the numerical radius of a square matrix and minimization of composite energies, are presented.
Zitieren
APA
Thi, H. A. L., Huynh, V. N., & Dinh, T. P. (2024). Minimizing Compositions of Differences-of-Convex Functions with Smooth Mappings. Mathematics of Operations Research, 49(2), 1140-1168. https://doi.org/10.1287/moor.2021.0258
Vancouver
Thi HAL, Huynh VN, Dinh TP. Minimizing Compositions of Differences-of-Convex Functions with Smooth Mappings. Mathematics of Operations Research. 2024;49(2):1140-1168. doi:10.1287/moor.2021.0258
BibTeX
@article{Thi2024,
author = {Thi, Hoai An Le and Huynh, Van Ngai and Dinh, Tao Pham},
title = {Minimizing Compositions of Differences-of-Convex Functions with Smooth Mappings},
journal = {Mathematics of Operations Research},
year = {2024},
volume = {49},
number = {2},
pages = {1140--1168},
doi = {10.1287/moor.2021.0258}
}
EUVIMED