Decomposition into functions in the minimization problem
From MaRDI portal
Cited in
(16)- An incremental subgradient method on Riemannian manifolds
- The effect of deterministic noise in subgradient methods
- Space-decomposition minimization method for large-scale minimization problems
- Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Parallel Uzawa method for large-scale minimization of partially separable functions
- String-averaging incremental stochastic subgradient algorithms
- On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
- A smooth inexact penalty reformulation of convex problems with linear constraints
- Path-based incremental target level algorithm on Riemannian manifolds
- Incremental quasi-subgradient method for minimizing sum of geodesic quasi-convex functions on Riemannian manifolds with applications
- Space-decomposition multiplier method for constrained minimization problems
- Recent theoretical advances in decentralized distributed convex optimization
- Random algorithms for convex minimization problems
- Incremental proximal methods for large scale convex optimization
- Simultaneous incremental gradient method for inconsistent convex optimization problem
This page was built for publication: Decomposition into functions in the minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1137249)
