Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality - Archive ouverte HAL Access content directly
Journal Articles Optimization Year : 2022

Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality

, , , (1)
1
N. Dinh
  • Function : Author
M. Goberna
M. López-Cerdá
  • Function : Author

Dates and versions

hal-03561053 , version 1 (08-02-2022)

Identifiers

Cite

N. Dinh, M. Goberna, M. López-Cerdá, M. Volle. Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality. Optimization, 2022, pp.1-26. ⟨10.1080/02331934.2022.2031192⟩. ⟨hal-03561053⟩
23 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More