A stochastic halfspace projection method with flexible linearization point achieves O(1/sqrt(k)) optimality and feasibility violation for convex smooth objectives with nonsmooth constraints, and O(1/k) under strong convexity.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Stochastic halfspace approximation method for convex optimization with nonsmooth functional constraints
A stochastic halfspace projection method with flexible linearization point achieves O(1/sqrt(k)) optimality and feasibility violation for convex smooth objectives with nonsmooth constraints, and O(1/k) under strong convexity.