Establishes iteration complexity for proximal bundle methods on hybrid weakly convex composite optimization problems via a unified framework with verifiable stationarity.
It follows from Lemma 4.5(a) that for every u∈ domh, ˆΓk(ˆxk) + 1 2λ∥ˆxk− ˆyk− 1∥2≤ ˆΓk(u) + 1 2λ∥u− ˆyk− 1∥2− 1 2λ∥u− ˆxk∥2
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Proximal bundle methods for hybrid weakly convex composite optimization problems
Establishes iteration complexity for proximal bundle methods on hybrid weakly convex composite optimization problems via a unified framework with verifiable stationarity.