Primal-dual subgradient method for huge-scale linear conic problems
From MaRDI portal
Recommendations
Cited in
(10)- Dual methods for finding equilibriums in mixed models of flow distribution in large transportation networks
- Parallel subgradient algorithm with block dual decomposition for large-scale optimization
- Primal-dual mirror descent method for constraint stochastic optimization problems
- A first-order smoothing technique for a class of large-scale linear programs
- Subgradient methods for huge-scale optimization problems
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- Adaptive mirror descent algorithms for convex and strongly convex optimization problems with functional constraints
- Solving large-scale optimization problems with a convergence rate independent of grid size
- Convergence and iteration-complexity of a primal-dual majorization-minimization method for large-scale linear programming
- Mirror descent methods with a weighting scheme for outputs for optimization problems with functional constraints
This page was built for publication: Primal-dual subgradient method for huge-scale linear conic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934485)