5 papers
Explicit data-dependent characterizations of the subdifferential of convex pointwise suprema and optimality conditions
Stephanie Caro, Abderrahim Hantoute
We establish explicit data-dependent and symmetric characterizations of the subdifferential of the supremum of convex functions, formulated directly in terms of the underlying data…
Normal cones to sublevel sets of convex and quasi-convex supremum functions
Stephanie Caro, Rafael Correa, Abderrahim Hantoute
We provide sharp and explicit characterizations of the normal cone to sublevel sets of suprema of arbitrary functions, expressed exclusively in terms of subdifferentials of the dat…
Relaxation in infinite convex programming under Slater-type regularity conditions
Rafael Correa, Abderrahim Hantoute, Marco A. López
The main purpose of this paper is to close the gap between the optimal values of an infinite convex program and that of its biconjugate relaxation. It is shown that Slater and cont…
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…
Optimality conditions and subdifferential calculus for infinite sums of functions
Abderrahim Hantoute, Alexander Y. Kruger, Marco A. Lopez
The paper extends the widely used in optimisation theory decoupling techniques to infinite collections of functions. Extended concepts of uniform lower semicontinuity and firm unif…