Pages that link to "Item:Q5737727"
From MaRDI portal
The following pages link to A Simple Parallel Algorithm with an $O(1/t)$ Convergence Rate for General Convex Programs (Q5737727):
Displaying 6 items.
- Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization (Q2125072) (← links)
- Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming (Q2220658) (← links)
- Decentralized hierarchical constrained convex optimization (Q2303528) (← links)
- A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints (Q4969032) (← links)
- A Privacy-Preserving Method to Optimize Distributed Resource Allocation (Q5123999) (← links)
- Adversarial bandits with knapsacks (Q6551256) (← links)
