An asynchronous subgradient-proximal method for solving additive convex optimization problems

DOI10.1007/S12190-023-01908-1MaRDI QIDQ6093360zbMATH OpenOpenAlexFDO

Authors Tipsuda Arunrat, Sakrapee Namsak, Nimit Nimana

Publication date 6 October 2023

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12190-023-01908-1

zbMATH Keywords

convergence analysisconvex optimizationdelaysubgradient-proximal method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Convex programming (90C25)

Recommendations

• Distributed asynchronous incremental subgradient methods
• A distributed flexible delay-tolerant proximal gradient algorithm
• Asynchronous level bundle methods
• Parallel subgradient methods for convex optimization.
• A distributed asynchronous method of multipliers for constrained nonconvex optimization

Cites work

• A Convergent Incremental Gradient Method with a Constant Step Size
• A Decentralized Proximal-Gradient Method With Network Independent Step-Sizes and Separated Convergence Rates
• A distributed proximal gradient method with time-varying delays for solving additive convex optimizations
• An efficient primal dual prox method for non-smooth optimization
• Asynchronous Distributed Optimization Via Randomized Dual Proximal Gradient
• Classification with a reject option using a hinge loss
• Constrained Consensus and Optimization in Multi-Agent Networks
• Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints
• Convex analysis and monotone operator theory in Hilbert spaces
• Convex optimization algorithms
• Distributed asynchronous deterministic and stochastic gradient optimization algorithms
• Distributed Optimization for Network Resource Allocation With Nonsmooth Utility Functions
• Distributed Proximal Algorithms for Multiagent Optimization With Coupled Inequality Constraints
• Distributed stochastic subgradient projection algorithms for convex optimization
• Distributed Subgradient Methods for Multi-Agent Optimization
• First-order methods in optimization
• Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
• Global convergence rate of proximal incremental aggregated gradient methods
• scientific article; zbMATH DE number 2121575 (Why is no real title available?)
• scientific article; zbMATH DE number 3359250 (Why is no real title available?)
• Incremental proximal gradient scheme with penalization for constrained composite convex optimization problems
• Incremental proximal methods for large scale convex optimization
• Iterative methods for fixed point problems in Hilbert spaces
• On Distributed Averaging Algorithms and Quantization Effects
• On the Convergence Rate of Incremental Aggregated Gradient Algorithms
• Parallel subgradient method for nonsmooth convex optimization with a simple constraint

Cited in

(2)

• A distributed flexible delay-tolerant proximal gradient algorithm
• A distributed proximal gradient method with time-varying delays for solving additive convex optimizations

This page was built for publication: An asynchronous subgradient-proximal method for solving additive convex optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6093360)