<p>We develop a methodology for closing duality gap and guaranteeing strong duality in infinite convex optimization. Specifically, we examine two new Lagrangian-type dual formulations involving infinitely many dual variables and infinite sums of functions. Unlike the classical Haar duality scheme, these dual problems provide zero duality gap and are solvable under the standard Slater condition. We derive general optimality conditions/multiplier rules by applying subdifferential rules for infinite sums established in Hantoute, A J. Optim. Theory Appl. 2026, <a href="https://doi.org/10.1007/s10957-025-02916-w">https://doi.org/10.1007/s10957-025-02916-w</a>,</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Strong Duality in Infinite Convex Optimization

  • Abderrahim Hantoute,
  • Alexander Y. Kruger,
  • Marco A. López

摘要

We develop a methodology for closing duality gap and guaranteeing strong duality in infinite convex optimization. Specifically, we examine two new Lagrangian-type dual formulations involving infinitely many dual variables and infinite sums of functions. Unlike the classical Haar duality scheme, these dual problems provide zero duality gap and are solvable under the standard Slater condition. We derive general optimality conditions/multiplier rules by applying subdifferential rules for infinite sums established in Hantoute, A J. Optim. Theory Appl. 2026, https://doi.org/10.1007/s10957-025-02916-w,