Generalized Polyhedral DC Optimization Problems

The problem of minimizing the difference of two lower semicontinuous, proper, convex functions (a DC function) on a nonempty closed convex set in a locally convex Hausdorff topological vector space is studied in this paper. The focus is made on the situations where either the second component of the...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of optimization theory and applications Ročník 207; číslo 1; s. 11
Hlavní autoři: Huong, Vu Thi, Kim Huyen, Duong Thi, Yen, Nguyen Dong
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer Nature B.V 01.10.2025
Témata:
Algorithms
Convex analysis
Convexity
Linear programming
Optimization
Theorems
Vector space
Vector spaces
ISSN:0022-3239, 1573-2878
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The problem of minimizing the difference of two lower semicontinuous, proper, convex functions (a DC function) on a nonempty closed convex set in a locally convex Hausdorff topological vector space is studied in this paper. The focus is made on the situations where either the second component of the objective function is a generalized polyhedral convex function or the first component of the objective function is a generalized polyhedral convex function and the constraint set is generalized polyhedral convex. Various results on optimality conditions, the local solution set, the global solution set, and solution algorithms via duality are obtained. Useful illustrative examples are considered.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0022-3239
1573-2878
DOI:10.1007/s10957-025-02769-3