EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Optimality Conditions Characterizing Approximate Solutions for DC Composite Programs

Gang Li, Qiqiong Chen

Journal of Mathematics · 2026-01 · 2026 (1)

DOI: 10.1155/jom/3604946 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Mathematics, online erschienen am 01.06.2026. Verfasst von Gang Li und 1 weiteren Autor:innen. Die Arbeit nennt 22 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Natural Science Foundation of Zhejiang Province.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper concerns DC composite optimization problems with conic constraints. By virtue of epigraph of conjugate functions, we introduce some new regularity conditions. Under the new regularity conditions, we give some necessary optimality conditions for ε ‐optimal solutions, global optimal solutions, and local optimal solutions by using the ε ‐subdifferential formula. Moreover, we provide some sufficient optimality conditions for the global optimal solutions. As applications, we also study the composite convex optimization problem and DC optimization problem.

Förderung

  • Natural Science Foundation of Zhejiang Province

Zitieren

APA

Li, G., & Chen, Q. (2026). Optimality Conditions Characterizing Approximate Solutions for DC Composite Programs. Journal of Mathematics, 2026(1). https://doi.org/10.1155/jom/3604946

Vancouver

Li G, Chen Q. Optimality Conditions Characterizing Approximate Solutions for DC Composite Programs. Journal of Mathematics. 2026;2026(1). doi:10.1155/jom/3604946

BibTeX
@article{Li2026,
  author = {Li, Gang and Chen, Qiqiong},
  title = {Optimality Conditions Characterizing Approximate Solutions for DC Composite Programs},
  journal = {Journal of Mathematics},
  year = {2026},
  volume = {2026},
  number = {1},
  doi = {10.1155/jom/3604946}
}
Kostenlos starten →