An incremental decomposition method for unconstrained optimization
From MaRDI portal
Recommendations
- A decomposition algorithm for unconstrained optimization problems with partial derivative information
- Incremental proximal methods for large scale convex optimization
- Incremental subgradient methods for nondifferentiable optimization
- A convergent decomposition method for box-constrained optimization problems
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- A Convergent Incremental Gradient Method with a Constant Step Size
- Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
- Globally convergent block-coordinate techniques for unconstrained optimization
- Gradient Convergence in Gradient methods with Errors
- Incremental gradient algorithms with stepsizes bounded away from zero
- Pattern recognition and machine learning.
Cited in
(5)- Block layer decomposition schemes for training deep neural networks
- A decomposition algorithm for unconstrained optimization problems with partial derivative information
- On the convergence of a block-coordinate incremental gradient method
- A convergent decomposition method for box-constrained optimization problems
- Computational and Information Science
This page was built for publication: An incremental decomposition method for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q272371)