Pages that link to "Item:Q4567169"
From MaRDI portal
The following pages link to On the Convergence Time of Dual Subgradient Methods for Strongly Convex Programs (Q4567169):
Displaying 5 items.
- Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems (Q1785469) (← links)
- Steelmaking-continuous casting scheduling problem with multi-position refining furnaces under time-of-use tariffs (Q2115759) (← links)
- Note on time bounds of two-phase algorithms for \(L\)-convex function minimization (Q2400167) (← links)
- On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization (Q4286937) (← links)
- An accelerated decentralized stochastic optimization algorithm with inexact model (Q6664887) (← links)