An incremental decomposition method for unconstrained optimization

DOI10.1016/j.amc.2014.02.088zbMath1334.90071OpenAlexW2096977119MaRDI QIDQ272371

Luca Bravi, Marco Sciandrone

Publication date: 20 April 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.02.088

zbMATH Keywords

decompositiongradient incremental methodslarge-scale unconstrained optimization

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06)

Related Items (2)

Block layer decomposition schemes for training deep neural networks ⋮ On the convergence of a block-coordinate incremental gradient method

Uses Software

• PRMLT

Cites Work

• Incremental gradient algorithms with stepsizes bounded away from zero
• Globally convergent block-coordinate techniques for unconstrained optimization
• Gradient Convergence in Gradient methods with Errors
• Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
• A Convergent Incremental Gradient Method with a Constant Step Size
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An incremental decomposition method for unconstrained optimization