Acceleration Method Combining Broadcast and Incremental Distributed Optimization Algorithms
From MaRDI portal
Publication:5245368
DOI10.1137/130939560zbMath1317.49044OpenAlexW2037124030MaRDI QIDQ5245368
Kazuhiro Hishinuma, Hideaki Iiduka
Publication date: 8 April 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/51d0bfdf7157e3bf30e4fa96fd43045136637f7d
nonexpansive mappingfixed-pointdistributed optimizationincremental subgradient methodacceleration methodbroadcast optimization algorithm
Numerical mathematical programming methods (65K05) Convex programming (90C25) Applications of mathematical programming (90C90) Numerical methods based on nonlinear programming (49M37) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items
Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings ⋮ Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings ⋮ Proximal point algorithms for nonsmooth convex optimization with fixed point constraints ⋮ A Sequential Constraint Method for Solving Variational Inequality over the Intersection of Fixed Point Sets ⋮ Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization ⋮ Two stochastic optimization algorithms for convex optimization with fixed point constraints ⋮ Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets ⋮ Convex optimization over fixed point sets of quasi-nonexpansive and nonexpansive mappings in utility-based bandwidth allocation problems with operational constraints ⋮ Decentralized hierarchical constrained convex optimization ⋮ Incremental subgradient method for nonsmooth convex optimization with fixed point constraints ⋮ Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints ⋮ Iterative methods for parallel convex optimization with fixed point constraints
