On the public citation graph

Distributed Mirror Descent for Online Composite Optimization

https://doi.org/10.1109/tac.2020.2987379
0 signed · 122 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/s10957-010-9737-7openalex-snapshot
Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization
inferredcites →https://doi.org/10.1016/j.automatica.2017.12.053openalex-snapshot
Optimal distributed stochastic mirror descent for strongly convex optimization
inferredcites →https://doi.org/10.1016/j.sysconle.2017.07.005openalex-snapshot
A fast proximal gradient algorithm for decentralized composite optimization over directed networks
inferredcites →https://doi.org/10.1016/s1570-579x(01)80004-5openalex-snapshot
Joint and Separate Convexity of the Bregman Distance
inferredcites →https://doi.org/10.1023/a:1026319107706openalex-snapshot
The Robustness of the p-Norm Algorithms
inferredcites →https://doi.org/10.1109/acc.2011.5991212openalex-snapshot
Decentralized Online Convex Programming with local information
inferredcites →https://doi.org/10.1109/allerton.2012.6483273openalex-snapshot
A fast distributed proximal-gradient method
inferredcites →https://doi.org/10.1109/camsap.2015.7383850openalex-snapshot
Multi-agent mirror descent for decentralized stochastic optimization
inferredcites →https://doi.org/10.1109/cdc.2008.4738860openalex-snapshot
Distributed subgradient methods and quantization effects
inferredcites →https://doi.org/10.1109/cdc.2013.6760092openalex-snapshot
Online distributed optimization via dual averaging
inferredcites →https://doi.org/10.1109/tac.2010.2041686openalex-snapshot
Constrained Consensus and Optimization in Multi-Agent Networks
inferredcites →https://doi.org/10.1109/tac.2011.2160020openalex-snapshot
Gossip Algorithms for Convex Consensus Optimization Over Networks
inferredcites →https://doi.org/10.1109/tac.2011.2161027openalex-snapshot
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
inferredcites →https://doi.org/10.1109/tac.2011.2167817openalex-snapshot
On Distributed Convex Optimization Under Inequality and Equality Constraints
inferredcites →https://doi.org/10.1109/tac.2014.2298712openalex-snapshot
Fast Distributed Gradient Methods
inferredcites →https://doi.org/10.1109/tac.2014.2308612openalex-snapshot
Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
inferredcites →https://doi.org/10.1109/tac.2014.2309261openalex-snapshot
Approximate Projected Consensus for Convex Intersection Computation: Convergence Analysis and Critical Error Angle
inferredcites →https://doi.org/10.1109/tac.2016.2525928openalex-snapshot
Online Distributed Convex Optimization on Dynamic Networks
inferredcites →https://doi.org/10.1109/tac.2016.2604324openalex-snapshot
Distributed Continuous-Time Optimization: Nonuniform Gradient Gains, Finite-Time Convergence, and Convex Constraint Set
inferredcites →https://doi.org/10.1109/tac.2016.2610945openalex-snapshot
A Multi-Agent System With a Proportional-Integral Protocol for Distributed Constrained Optimization
inferredcites →https://doi.org/10.1109/tac.2017.2650563openalex-snapshot
Stochastic Dual Averaging for Decentralized Online Optimization on Time-Varying Communication Graphs
inferredcites →https://doi.org/10.1109/tac.2017.2669321openalex-snapshot
Distributed Optimization for Linear Multiagent Systems: Edge- and Node-Based Adaptive Designs
inferredcites →https://doi.org/10.1109/tac.2017.2743462openalex-snapshot
Distributed Online Optimization in Dynamic Environments Using Mirror Descent
inferredcites →https://doi.org/10.1109/tkde.2012.191openalex-snapshot
Distributed Autonomous Online Learning: Regrets and Intrinsic Privacy-Preserving Properties
inferredcites →https://doi.org/10.1109/tnnls.2014.2336806openalex-snapshot
Randomized Gradient-Free Method for Multiagent Optimization Over Time-Varying Networks
inferredcites →https://doi.org/10.1109/tsp.2010.2055862openalex-snapshot
Distributed Sparse Linear Regression
inferredcites →https://doi.org/10.1109/tsp.2015.2461520openalex-snapshot
A Proximal Gradient Algorithm for Decentralized Composite Optimization
inferredcites →https://doi.org/10.1137/15m1048896openalex-snapshot
On Convergence Rate of Distributed Stochastic Gradient Algorithm for Convex Optimization with Inequality Constraints
inferredcites →https://doi.org/10.48550/arxiv.1412.5526openalex-snapshot
Distributed Mirror Descent over Directed Graphs
inferredcites →https://doi.org/10.48550/arxiv.1507.08752openalex-snapshot
An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
inferredcites →https://doi.org/10.5555/1070432.1070486openalex-snapshot
Online convex optimization in the bandit setting: gradient descent without a gradient
inferredcites →https://doi.org/10.5555/1756006.1953017openalex-snapshot
Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4660550openalex-extracted
A Review of Accelerated First-Order Methods for Distributed Convex Optimisation
inferred← citeshttps://doi.org/10.2139/ssrn.4663056openalex-extracted
Distributed Dual Averaging for Composite Optimization
inferred← citeshttps://doi.org/10.1002/rnc.70394openalex-snapshot
Prescribed‐Time Distributed Optimization for Multi‐agent Systems Over Unbalanced Directed Networks
inferred← citeshttps://doi.org/10.1007/s11431-023-2513-8openalex-snapshot
Distributed online bandit tracking for Nash equilibrium under partial-decision information setting
inferred← citeshttps://doi.org/10.1007/s11432-020-3275-3openalex-snapshot
Distributed quantized mirror descent for strongly convex optimization over time-varying directed graph
inferred← citeshttps://doi.org/10.1007/s11432-023-4086-5openalex-snapshot
Improved dynamic regret of distributed online multiple Frank-Wolfe convex optimization
inferred← citeshttps://doi.org/10.1007/s11768-023-00134-1openalex-snapshot
Distributed regularized online optimization using forward–backward splitting
inferred← citeshttps://doi.org/10.1007/s11768-023-00186-3openalex-snapshot
Online distributed optimization with stochastic gradients: high probability bound of regrets
inferred← citeshttps://doi.org/10.1016/j.amc.2023.127865openalex-snapshot
Event-triggered distributed online convex optimization with delayed bandit feedback
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2023.100904openalex-snapshot
A survey on distributed online optimization and online games
inferred← citeshttps://doi.org/10.1016/j.automatica.2021.110059openalex-snapshot
Distributed resource allocation via multi-agent systems under time-varying networks
inferred← citeshttps://doi.org/10.1016/j.automatica.2022.110297openalex-snapshot
Distributed ergodic algorithms for mixed equilibrium problems: Absent of cut property
inferred← citeshttps://doi.org/10.1016/j.automatica.2022.110590openalex-snapshot
Distributed online bandit optimization under random quantization
inferred← citeshttps://doi.org/10.1016/j.automatica.2023.111364openalex-snapshot
Distributed constrained optimization with periodic dynamic quantization
inferred← citeshttps://doi.org/10.1016/j.automatica.2025.112200openalex-snapshot
Distributed online path-length-independent algorithm for noncooperative games over unbalanced digraphs
inferred← citeshttps://doi.org/10.1016/j.automatica.2025.112499openalex-snapshot
Distributed mirror descent for online bandit saddle point problem
inferred← citeshttps://doi.org/10.1016/j.automatica.2025.112679openalex-snapshot
Communication-efficient online federated composite optimization
inferred← citeshttps://doi.org/10.1016/j.automatica.2025.112771openalex-snapshot
Online distributed algorithms for mixed equilibrium problems in dynamic environments
inferred← citeshttps://doi.org/10.1016/j.automatica.2026.113059openalex-snapshot
Distributed stochastic dual averaging algorithm over time-varying networks with communication noises
inferred← citeshttps://doi.org/10.1016/j.dsp.2026.106216openalex-snapshot
Variance-reduced distributed adaptive stochastic gradient tracking for nonconvex optimization over directed networks
inferred← citeshttps://doi.org/10.1016/j.ifacol.2022.11.094openalex-snapshot
Distributed Online Mirror Descent Algorithm with Event Triggered Communication
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2021.11.034openalex-snapshot
Continuous-time distributed optimization with strictly pseudoconvex objective functions
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2023.08.009openalex-snapshot
Distributed mirror descent algorithm over unbalanced digraphs based on gradient weighting technique
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2023.08.026openalex-snapshot
Online distributed detection of sensor networks with delayed information
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2024.106884openalex-snapshot
Online composite optimization with time-varying regularizers
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2024.107466openalex-snapshot
Distributed constrained optimization over unbalanced graphs and delayed gradient
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2026.108575openalex-snapshot
Distributed online convex optimization under delayed feedback with edge-Based event-Triggered communication
inferred← citeshttps://doi.org/10.1016/j.knosys.2024.112582openalex-snapshot
Stabilized distributed online mirror descent for multi-agent optimization
inferred← citeshttps://doi.org/10.1016/j.neucom.2022.05.024openalex-snapshot
Distributed online convex optimization with a bandit primal-dual mirror descent push-sum algorithm
inferred← citeshttps://doi.org/10.1016/j.neucom.2023.126531openalex-snapshot
Differentially private distributed online mirror descent algorithm
inferred← citeshttps://doi.org/10.1016/j.neucom.2024.128952openalex-snapshot
Gossip-based asynchronous algorithms for distributed composite optimization
inferred← citeshttps://doi.org/10.1016/j.neucom.2025.131406openalex-snapshot
Online bandit optimization with stochastic inequality constraints
inferred← citeshttps://doi.org/10.1016/j.neucom.2026.134340openalex-snapshot
Distributed online sequential learning for directed networks via zero-gradient-sum strategy
inferred← citeshttps://doi.org/10.1016/j.sysconle.2025.106078openalex-snapshot
Privacy-preserving distributed online mirror descent for nonconvex optimization
inferred← citeshttps://doi.org/10.1038/s41598-026-36058-4openalex-snapshot
A novel distributed gradient algorithm for composite constrained optimization over directed network
inferred← citeshttps://doi.org/10.1063/5.0155863openalex-snapshot
Distributed inertial online game algorithm for tracking generalized Nash equilibria
inferred← citeshttps://doi.org/10.1080/23307706.2026.2735344openalex-snapshot
Online generalised Nash equilibrium seeking over switching communication topologies: a distributed primal–dual approach
inferred← citeshttps://doi.org/10.1109/allerton49937.2022.9929356openalex-snapshot
Distributed Online Non-convex Optimization with Composite Regret
inferred← citeshttps://doi.org/10.1109/cac59555.2023.10450774openalex-snapshot
Randomized Gradient-Free Mirror Descent Algorithm for Distributed Online Optimization
inferred← citeshttps://doi.org/10.1109/ccdc52312.2021.9602370openalex-snapshot
Quantizer-based distributed mirror descent for multi-agent convex optimization
inferred← citeshttps://doi.org/10.1109/cdc49753.2023.10383716openalex-snapshot
Distributed Online Learning Algorithms for Aggregative Games Over Time-Varying Unbalanced Digraphs
inferred← citeshttps://doi.org/10.1109/cdc57313.2025.11312212openalex-snapshot
Several Performance Bounds on Decentralized Online Optimization are Highly Conservative and Potentially Misleading
inferred← citeshttps://doi.org/10.1109/cdc57313.2025.11312327openalex-snapshot
Distributed Constrained Online Nonconvex Optimization with Compressed Communication
inferred← citeshttps://doi.org/10.1109/icca69928.2026.11618308openalex-snapshot
Distributed Online Minimax Optimization with Compressed Communication
inferred← citeshttps://doi.org/10.1109/jas.2022.105506openalex-snapshot
Cooperative and Competitive Multi-Agent Systems: From Optimization to Games
inferred← citeshttps://doi.org/10.1109/lcsys.2020.3040934openalex-snapshot
Distributed Mirror Descent With Integral Feedback: Asymptotic Convergence Analysis of Continuous-Time Dynamics
inferred← citeshttps://doi.org/10.1109/milcom55135.2022.10017636openalex-snapshot
Aggregation in the Mirror Space (AIMS): Fast, Accurate Distributed Machine Learning in Military Settings
inferred← citeshttps://doi.org/10.1109/tac.2021.3138155openalex-snapshot
2021 Index IEEE Transactions on Automatic Control Vol. 66
inferred← citeshttps://doi.org/10.1109/tac.2022.3230767openalex-snapshot
On Centralized and Distributed Mirror Descent: Convergence Analysis Using Quadratic Constraints
inferred← citeshttps://doi.org/10.1109/tac.2023.3239432openalex-snapshot
Online Distributed Optimization With Nonconvex Objective Functions via Dynamic Regrets
inferred← citeshttps://doi.org/10.1109/tac.2023.3244995openalex-snapshot
Distributed Mirror Descent Algorithm With Bregman Damping for Nonsmooth Constrained Optimization
inferred← citeshttps://doi.org/10.1109/tac.2023.3264784openalex-snapshot
A Generic Algorithm Framework for Distributed Optimization Over the Time-Varying Network With Communication Delays
inferred← citeshttps://doi.org/10.1109/tac.2023.3312033openalex-snapshot
Dynamic Regret of Distributed Online Saddle Point Problem
inferred← citeshttps://doi.org/10.1109/tac.2024.3380710openalex-snapshot
Distributed Adaptive Gradient Algorithm With Gradient Tracking for Stochastic Nonconvex Optimization
inferred← citeshttps://doi.org/10.1109/tac.2024.3489222openalex-snapshot
Dynamic Regret for Distributed Online Composite Optimization
inferred← citeshttps://doi.org/10.1109/tac.2025.3547606openalex-snapshot
Distributed Online Convex Optimization With Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds Under Slater's Condition
inferred← citeshttps://doi.org/10.1109/tac.2025.3581321openalex-snapshot
Distributed Stochastic Frank–Wolfe for Constrained Composite Minimization
inferred← citeshttps://doi.org/10.1109/tac.2025.3632693openalex-snapshot
Static and Dynamic Regrets for Online Distributed Composite Optimization: Edge-Based Dynamic Event-Triggered Algorithms
inferred← citeshttps://doi.org/10.1109/tac.2026.3677785openalex-snapshot
Communication-Efficient Distributed Online Nonconvex Optimization With Time-Varying Constraints
inferred← citeshttps://doi.org/10.1109/tccn.2023.3325815openalex-snapshot
Differentially Private Federated Learning With Stragglers’ Delays in Cross-Silo Settings: An Online Mirror Descent Approach
inferred← citeshttps://doi.org/10.1109/tcns.2025.3558791openalex-snapshot
Distributed Event-Triggered Bandit Convex Optimization With Time-Varying Constraints
inferred← citeshttps://doi.org/10.1109/tcns.2025.3608004openalex-snapshot
One-Point Sampling for Distributed Bandit Convex Optimization With Time-Varying Constraints
inferred← citeshttps://doi.org/10.1109/tcns.2026.3662099openalex-snapshot
IDO-ADMM: Inexact Distributed Online Alternating Direction Method of Multipliers Under Full-Information and Bandit Feedback
inferred← citeshttps://doi.org/10.1109/tcyb.2021.3127278openalex-snapshot
Distributed Stochastic Constrained Composite Optimization Over Time-Varying Network With a Class of Communication Noise
inferred← citeshttps://doi.org/10.1109/tii.2025.3645932openalex-snapshot
Distributed Optimization Under Information Constraints: A Survey
inferred← citeshttps://doi.org/10.1109/tnnls.2021.3132658openalex-snapshot
Distributed Finite-Time Optimization of Second-Order Multiagent Systems With Unknown Velocities and Disturbances
inferred← citeshttps://doi.org/10.1109/tnnls.2021.3137010openalex-snapshot
Event-Triggered Distributed Stochastic Mirror Descent for Convex Optimization
inferred← citeshttps://doi.org/10.1109/tnnls.2022.3172450openalex-snapshot
Distributed Constrained Optimization With Delayed Subgradient Information Over Time-Varying Network Under Adaptive Quantization
inferred← citeshttps://doi.org/10.1109/tnnls.2022.3184957openalex-snapshot
Distributed Online Constrained Optimization With Feedback Delays
inferred← citeshttps://doi.org/10.1109/tnnls.2023.3290049openalex-snapshot
Distributed Online Learning Algorithm for Noncooperative Games Over Unbalanced Digraphs
inferred← citeshttps://doi.org/10.1109/tnnls.2026.3650771openalex-snapshot
Distributed Learning for Online Stochastic Mixed Equilibrium Problems With Heavy-Tailed Noises
inferred← citeshttps://doi.org/10.1109/tnse.2023.3253143openalex-snapshot
Distributed Aggregative Optimization via Finite-time Dynamic Average Consensus
inferred← citeshttps://doi.org/10.1109/tnse.2023.3329523openalex-snapshot
Distributed Online Mirror Descent With Delayed Subgradient and Event-Triggered Communications
inferred← citeshttps://doi.org/10.1109/tnse.2024.3409061openalex-snapshot
Online Distributed Optimization With Nonconvex Objective Functions Under Unbalanced Digraphs: Dynamic Regret Analysis
inferred← citeshttps://doi.org/10.1109/tpds.2024.3403883openalex-snapshot
Communication-Efficient Regret-Optimal Distributed Online Convex Optimization
inferred← citeshttps://doi.org/10.1109/tsipn.2025.3579245openalex-snapshot
Online Non-Convex Non-Cooperative Cluster-Based Games With Byzantine Resiliency in Decentralized Multi-Agent Systems
inferred← citeshttps://doi.org/10.1109/tsipn.2026.3735531openalex-snapshot
Distributed Mirror Descent for Correlated Equilibrium Seeking on Routing Mechanism
inferred← citeshttps://doi.org/10.1109/tsp.2024.3400453openalex-snapshot
Event-Triggered Proximal Online Gradient Descent Algorithm for Parameter Estimation
inferred← citeshttps://doi.org/10.14736/kyb-2021-2-0256openalex-snapshot
A stochastic mirror-descent algorithm for solving AXB=C over an multi-agent system
inferred← citeshttps://doi.org/10.14736/kyb-2023-3-0392openalex-snapshot
A penalty ADMM with quantized communication for distributed optimization over multi-agent systems
inferred← citeshttps://doi.org/10.1561/2400000037openalex-snapshot
Multi-agent Online Optimization
inferred← citeshttps://doi.org/10.2139/ssrn.7593445openalex-snapshot
Bregman Distance-Based Proximal Dynamics for Equilibrium Problems with Fixed-Time Convergence
inferred← citeshttps://doi.org/10.23919/acc50511.2021.9482802openalex-snapshot
Distributed Mirror Descent with Integral Feedback: Asymptotic Convergence Analysis of Continuous-time Dynamics
inferred← citeshttps://doi.org/10.23919/ccc52363.2021.9550749openalex-snapshot
Distributed No-Regret Learning for Stochastic Aggregative Games over Networks
inferred← citeshttps://doi.org/10.23919/ecc64448.2024.10591048openalex-snapshot
Nash Equilibrium Seeking over Time-Varying Networks with Time-Varying Delays
inferred← citeshttps://doi.org/10.3390/math14101731openalex-snapshot
Statistical Privacy-Preserving Distributed Online Aggregative Games via Mirror Descent with Correlated Perturbations
inferred← citeshttps://doi.org/10.3390/math14193551openalex-snapshot
Privacy-Preserving Distributed Online Dispatch of Low-Carbon Microgrids with TCN–BiLSTM Probabilistic Photovoltaic Forecasts
inferred← citeshttps://doi.org/10.3390/su18147111openalex-snapshot
Communication-Efficient Distributed Online Voltage Control for Sustainable Distribution Networks with High Penetration PV
inferred← citeshttps://doi.org/10.3934/mfc.2023026openalex-snapshot
Federated learning for minimizing nonsmooth convex loss functions
inferred← citeshttps://doi.org/10.48550/arxiv.2009.06747openalex-snapshot
Distributed Mirror Descent with Integral Feedback: Asymptotic Convergence Analysis of Continuous-time Dynamics
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.