Dual averaging with adaptive random projection for solving evolving distributed optimization problems

DOI10.1007/S10957-016-0932-ZzbMATH Open1346.90674OpenAlexW2320746101MaRDI QIDQ306393FDOQ306393

Authors: Shreyas Vathul Subramanian, Daniel A. DeLaurentis, Dengfeng Sun 

Publication date: 31 August 2016

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-016-0932-z

Recommendations

• Inexact dual averaging method for distributed multi-agent optimization
• Adaptive online distributed optimization in dynamic environments
• Adaptive step size selection in distributed optimization with observation noise and unknown stochastic target variation
• Primal-dual stochastic distributed algorithm for constrained convex optimization
• Distributed delayed dual averaging for distributed optimization over time-varying digraphs

zbMATH Keywords

convex optimizationdual averagingtopology optimizationdistributedmaximum feasibility problemsensor management

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30)

Cites Work

• On Projection Algorithms for Solving Convex Feasibility Problems
• Robust Estimation of a Location Parameter
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• Subgradient methods for saddle-point problems
• An iterative row-action method for interval convex programming
• Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
• A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
• Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization
• Distributed stochastic subgradient projection algorithms for convex optimization
• Title not available (Why is that?)
• Feasibility and infeasibility in optimization. Algorithms and computational methods.
• Incremental proximal methods for large scale convex optimization
• Optimal estimator for distributed anonymous observers
• A relaxed version of Bregman's method for convex programming
• An interior points algorithm for the convex feasibility problem
• Steered sequential projections for the inconsistent convex feasibility problem
• Branch-and-Cut for the Maximum Feasible Subsystem Problem
• Title not available (Why is that?)
• Diffusion recursive least-squares for distributed estimation over adaptive networks
• Robust Distributed Estimation Using the Embedded Subgraphs Algorithm
• The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets

Cited In (3)

• Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
• The maximum feasible subset problem (maxFS) and applications
• Adaptive step size selection in distributed optimization with observation noise and unknown stochastic target variation

This page was built for publication: Dual averaging with adaptive random projection for solving evolving distributed optimization problems

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