15 citations · 54 across the 38 of their papers we have counts for
Showing 2026 · math.OCShow all
2 papers · 2 filters
math.OC2026
Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints
Mohammad Alkousa
In this paper, we consider constraint optimization problems subject to non-smooth convex functional (inequality-type) constraints, wherein the objective function is non-smooth and…
math.OC2026
Lipschitz-Free Mirror Descent Methods for Relatively Strongly Convex Functions with/without Absolute and Relative Inexactness
Mohammad S. Alkousa, Fedor S. Stonyakin
In this paper, we analyze the mirror descent algorithm for non-smooth optimization problems in which the objective function is relatively strongly convex, without relying on the st…