.png){kind=icon}
.png){kind=icon}
Return
Lagrange dualities for DC infinite optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1080/02331934.2025.2579724.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In the present paper, we study the Lagrange dualities of the DC infinite optimization problems. By using the properties of the epigraph of the conjugate functions, we provide characterizations for the DC infinite optimization problem to have the stable weak Lagrange dualities and the stable Lagrange dualities. Applications to DC semi-infinite programming, DC conic programming and convex infinite programming are given.
Keywords:
Weak Lagrange duality
Lagrange duality
DC infinite programming
Journal
O
IF:
1.8
Papers:
121
Citations:
0
Organization
View more organizations