Extends mirror descent with productive/non-productive steps to quasar-convex objectives with nonsmooth constraints, but the convergence claims are only partially proven.
On some stochastic mirror descent methods for constrained online op- timization problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints
Extends mirror descent with productive/non-productive steps to quasar-convex objectives with nonsmooth constraints, but the convergence claims are only partially proven.