On the public citation graph

Strong consistency of random gradient‐free algorithms for distributed optimization

0 signed · 32 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.1002/rnc.2856openalex-snapshot
Distributed primal–dual stochastic subgradient algorithms for multi‐agent optimization under inequality constraints
inferredcites →https://doi.org/10.1002/rnc.3164openalex-snapshot
Gradient‐free method for distributed multi‐agent optimization via push‐sum algorithms
inferredcites →https://doi.org/10.1007/s10898-014-0174-2openalex-snapshot
Gradient-free method for nonsmooth distributed optimization
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/b978-0-12-604550-5.50015-8openalex-snapshot
A CONVERGENCE THEOREM FOR NON NEGATIVE ALMOST SUPERMARTINGALES AND SOME APPLICATIONS**Research supported by NIH Grant 5-R01-GM-16895-03 and ONR Grant N00014-67-A-0108-0018.
inferredcites →https://doi.org/10.1016/j.automatica.2012.08.018openalex-snapshot
Randomized optimal consensus of multi-agent systems
inferredcites →https://doi.org/10.1109/tac.2008.2009515openalex-snapshot
Distributed Subgradient Methods for Multi-Agent Optimization
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.2012.2209984openalex-snapshot
Convergence of a Multi-Agent Projected Stochastic Gradient Algorithm for Non-Convex Optimization
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.1137/080726380openalex-snapshot
Incremental Stochastic Subgradient Algorithms for Convex Optimization
inferredcites →https://doi.org/10.1137/08073038xopenalex-snapshot
A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
inferredcites →https://doi.org/10.1137/s1052623499362111openalex-snapshot
Incremental Subgradient Methods for Nondifferentiable Optimization
inferredcites →https://doi.org/10.2307/2982562openalex-snapshot
Probability Theory: Independence, Interchangeability, Martingales.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/asjc.3148openalex-snapshot
Privacy‐preserving distributed projected one‐point bandit online optimization over directed graphs
inferred← citeshttps://doi.org/10.1002/oca.2886openalex-snapshot
A distributed accelerated optimization algorithm over time‐varying directed graphs with uncoordinated step‐sizes
inferred← citeshttps://doi.org/10.1002/oca.2949openalex-snapshot
A resilient distributed optimization strategy against false data injection attacks
inferred← citeshttps://doi.org/10.1002/oca.3000openalex-snapshot
A fixed step distributed proximal gradient push‐pull algorithm based on integral quadratic constraint
inferred← citeshttps://doi.org/10.1002/rnc.6266openalex-snapshot
A gradient‐free distributed optimization method for convex sum of nonconvex cost functions
inferred← citeshttps://doi.org/10.1007/s11424-025-4550-4openalex-snapshot
A Stochastic Extremum Seeking Approach for Distributed Optimization with Binary-Valued Intermittent Measurements over Directed Graphs
inferred← citeshttps://doi.org/10.1016/j.automatica.2022.110474openalex-snapshot
Gradient-free distributed optimization with exact convergence
inferred← citeshttps://doi.org/10.1016/j.neucom.2022.09.033openalex-snapshot
Distributed neurodynamic-based economic dispatch strategy for we-energy
inferred← citeshttps://doi.org/10.1016/j.sysconle.2022.105252openalex-snapshot
Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization
inferred← citeshttps://doi.org/10.1109/cdc.2018.8619028openalex-snapshot
Exact Convergence of Gradient-Free Distributed Optimization Method in a Multi-Agent System
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9029248openalex-snapshot
Randomized Gradient-Free Distributed Online Optimization with Time-Varying Cost Functions
inferred← citeshttps://doi.org/10.1109/icarcv57592.2022.10004351openalex-snapshot
A Gradient-free Penalty ADMM for Solving Distributed Convex Optimization Problems with Feasible Set Constraints
inferred← citeshttps://doi.org/10.1109/tac.2019.2914025openalex-snapshot
Randomized Gradient-Free Distributed Optimization Methods for a Multiagent System With Unknown Cost Function
inferred← citeshttps://doi.org/10.1109/tac.2020.2995666openalex-snapshot
Distributed Nash Equilibrium Seeking With Limited Cost Function Knowledge via a Consensus-Based Gradient-Free Method
inferred← citeshttps://doi.org/10.1109/tsmc.2017.2757265openalex-snapshot
Random Gradient-Free Optimization for Multiagent Systems With Communication Noises Under a Time-Varying Weight Balanced Digraph
inferred← citeshttps://doi.org/10.21078/jssi-2023-0115openalex-snapshot
Zeroth-Order Methods for Online Distributed Optimization with Strongly Pseudoconvex Cost Functions
inferred← citeshttps://doi.org/10.23919/chicc.2017.8028689openalex-snapshot
Randomized gradient-free distributed algorithms through sequential Gaussian smoothing
inferred← citeshttps://doi.org/10.32657/10356/143354openalex-snapshot
Gradient-free distributed optimization and nash equilibrium seeking
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.