On the public citation graph

On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm

https://doi.org/10.1137/0801036
0 signed · 81 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/bf00935004openalex-snapshot
On the gradient-projection method for solving the nonsymmetric linear complementarity problem
inferredcites →https://doi.org/10.1007/bf00939081openalex-snapshot
On the convergence of projected gradient processes to singular critical points
inferredcites →https://doi.org/10.1007/bf00939948openalex-snapshot
On the convergence of the coordinate descent method for convex differentiable minimization
inferredcites →https://doi.org/10.1007/bf02592073openalex-snapshot
Projected gradient methods for linearly constrained problems
inferredcites →https://doi.org/10.1007/bfb0120929openalex-snapshot
Some continuity properties of polyhedral multifunctions
inferredcites →https://doi.org/10.1007/bfb0120965openalex-snapshot
Projection methods for variational inequalities with application to the traffic assignment problem
inferredcites →https://doi.org/10.1007/bfb0120989openalex-snapshot
Generalized equations and their solutions, part II: Applications to nonlinear programming
inferredcites →https://doi.org/10.1016/0024-3795(69)90028-7openalex-snapshot
Chaotic relaxation
inferredcites →https://doi.org/10.1016/0041-5553(66)90114-5openalex-snapshot
Constrained minimization methods
inferredcites →https://doi.org/10.1016/c2013-0-10366-2openalex-snapshot
Constrained Optimization and Lagrange Multiplier Methods
inferredcites →https://doi.org/10.1090/s0002-9904-1964-11178-2openalex-snapshot
Convex programming in Hilbert space
inferredcites →https://doi.org/10.1109/tac.1976.1101194openalex-snapshot
On the Goldstein-Levitin-Polyak gradient projection method
inferredcites →https://doi.org/10.1109/tac.1986.1104261openalex-snapshot
Distributed asynchronous optimal routing in data networks
inferredcites →https://doi.org/10.1109/tac.1986.1104412openalex-snapshot
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
inferredcites →https://doi.org/10.1137/0319022openalex-snapshot
Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
inferredcites →https://doi.org/10.1137/0320018openalex-snapshot
Projected Newton Methods for Optimization Problems with Simple Constraints
inferredcites →https://doi.org/10.1137/0322061openalex-snapshot
Two-Metric Projection Methods for Constrained Optimization
inferredcites →https://doi.org/10.1137/0330025openalex-snapshot
On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
inferredcites →https://doi.org/10.1137/0802004openalex-snapshot
Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
inferredcites →https://doi.org/10.12681/eadd/3778openalex-snapshot
PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION
inferredcites →https://doi.org/10.1287/moor.12.3.474openalex-snapshot
A Posteriori Error Bounds for the Linearly-Constrained Variational Inequality Problem

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-306-48332-7_14openalex-snapshot
Asynchronous Distributed Optimization Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_21openalex-snapshot
Asynchronous Distributed Optimization Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4471-5113-5_5openalex-snapshot
Decentralised Decision Making for Ad-hoc Multi-Agent Systems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3400-2_9openalex-snapshot
Parallel Cost Approximation Algorithms for Differentiable Optimization
inferred← citeshttps://doi.org/10.1007/978-1-84628-982-8openalex-snapshot
Advances in Applied Self-organizing Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-34102-2_5openalex-snapshot
Parallel Decomposition of a Road Network
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_21-1openalex-snapshot
Asynchronous Distributed Optimization Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-41589-5_7openalex-snapshot
Nonconvex Sparse Regularization and Splitting Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-53817-4_3openalex-snapshot
Privacy Preserving Federated Big Data Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-97142-1_3openalex-snapshot
Parallel and Distributed Successive Convex Approximation Methods for Big-Data Optimization
inferred← citeshttps://doi.org/10.1007/bf01299452openalex-snapshot
Computational study of a nonhierarchical decomposition algorithm
inferred← citeshttps://doi.org/10.1007/bf02096261openalex-snapshot
Error bounds and convergence analysis of feasible descent methods: a general approach
inferred← citeshttps://doi.org/10.1007/bf02614322openalex-snapshot
Error bounds in mathematical programming
inferred← citeshttps://doi.org/10.1007/s10107-007-0170-0openalex-snapshot
A coordinate gradient descent method for nonsmooth separable minimization
inferred← citeshttps://doi.org/10.1007/s10107-010-0394-2openalex-snapshot
Approximation accuracy, gradient methods, and error bound for structured convex optimization
inferred← citeshttps://doi.org/10.1007/s10107-019-01408-wopenalex-snapshot
Asynchronous parallel algorithms for nonconvex optimization
inferred← citeshttps://doi.org/10.1007/s101070050020openalex-snapshot
New error bounds and their applications to convergence analysis of iterative algorithms
inferred← citeshttps://doi.org/10.1007/s10589-018-0037-8openalex-snapshot
Asynchronous parallel primal–dual block coordinate update methods for affinely constrained convex programs
inferred← citeshttps://doi.org/10.1007/s10915-017-0628-zopenalex-snapshot
On Unbounded Delays in Asynchronous Parallel Fixed-Point Algorithms
inferred← citeshttps://doi.org/10.1007/s10957-013-0409-2openalex-snapshot
Incrementally Updated Gradient Methods for Constrained and Regularized Optimization
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90046-popenalex-snapshot
A unified description of iterative algorithms for traffic equilibria
inferred← citeshttps://doi.org/10.1016/j.robot.2008.10.020openalex-snapshot
Decentralised decision making in heterogeneous teams using anonymous optimisation
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00409-xopenalex-snapshot
On asynchronous iterations
inferred← citeshttps://doi.org/10.1023/a:1018358602892openalex-snapshot
Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets
inferred← citeshttps://doi.org/10.1080/10556788.2015.1004064openalex-snapshot
On the rate of convergence of projected Barzilai–Borwein methods
inferred← citeshttps://doi.org/10.1080/10556788.2021.2023524openalex-snapshot
Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays
inferred← citeshttps://doi.org/10.1080/10556789908805730openalex-snapshot
Globally convergent block-coordinate techniques for unconstrained optimization
inferred← citeshttps://doi.org/10.1090/s0025-5718-01-01344-8openalex-snapshot
Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
inferred← citeshttps://doi.org/10.1109/9.284908openalex-snapshot
On the rate of convergence of a distributed asynchronous routing algorithm
inferred← citeshttps://doi.org/10.1109/allerton.2017.8262872openalex-snapshot
Asynchronous primal updates in dual subgradient methods via approximate lagrange multipliers
inferred← citeshttps://doi.org/10.1109/allerton.2019.8919791openalex-snapshot
Distributed SGD Generalizes Well Under Asynchrony
inferred← citeshttps://doi.org/10.1109/cdc.2007.4434301openalex-snapshot
Asynchronous gradient-based optimisation for team decision making
inferred← citeshttps://doi.org/10.1109/cdc.2017.8264311openalex-snapshot
On the connectivity of unions of random graphs
inferred← citeshttps://doi.org/10.1109/cdc.2018.8619278openalex-snapshot
Multi-agent structured optimization over message-passing architectures with bounded communication delays
inferred← citeshttps://doi.org/10.1109/cdc51059.2022.9993341openalex-snapshot
Faster Asynchronous Nonconvex Block Coordinate Descent with Locally Chosen Stepsizes
inferred← citeshttps://doi.org/10.1109/icassp.2016.7472320openalex-snapshot
Asynchronous local voltage control in power distribution networks
inferred← citeshttps://doi.org/10.1109/lcsys.2021.3082800openalex-snapshot
Asynchronous Parallel Nonconvex Optimization Under the Polyak-Łojasiewicz Condition
inferred← citeshttps://doi.org/10.1109/tac.2020.3033490openalex-snapshot
Asynchronous Optimization Over Graphs: Linear Convergence Under Error Bound Conditions
inferred← citeshttps://doi.org/10.1109/tac.2021.3071651openalex-snapshot
Distributed Adaptive Optimization With Weight-Balancing
inferred← citeshttps://doi.org/10.1109/tac.2023.3261465openalex-snapshot
Composite Optimization With Coupling Constraints via Penalized Proximal Gradient Method in Asynchronous Networks
inferred← citeshttps://doi.org/10.1109/tac.2024.3520677openalex-snapshot
Distributed Asynchronous Discrete-Time Feedback Optimization
inferred← citeshttps://doi.org/10.1109/tac.2026.3654317openalex-snapshot
Distributed Asynchronous Time-Varying Quadratic Programming With Asynchronous Objective Sampling
inferred← citeshttps://doi.org/10.1109/tcns.2020.3013715openalex-snapshot
Nonasymptotic Connectivity of Random Graphs and Their Unions
inferred← citeshttps://doi.org/10.1137/15m1024950openalex-snapshot
ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates
inferred← citeshttps://doi.org/10.1184/r1/6720416openalex-snapshot
Learning with Staleness
inferred← citeshttps://doi.org/10.1287/moor.2018.0986openalex-snapshot
On Synchronous, Asynchronous, and Randomized Best-Response Schemes for Stochastic Nash Games
inferred← citeshttps://doi.org/10.2514/1.g006532openalex-snapshot
Decentralized Weapon–Target Assignment Under Asynchronous Communications
inferred← citeshttps://doi.org/10.32657/10356/165973openalex-snapshot
Decentralized optimization methods for solving social profit optimization problems in electricity market
inferred← citeshttps://doi.org/10.4134/bkms.2016.53.2.589openalex-snapshot
A MEMORY EFFICIENT INCREMENTAL GRADIENT METHOD FOR REGULARIZED MINIMIZATION
inferred← citeshttps://doi.org/10.4310/amsa.2016.v1.n1.a2openalex-snapshot
Coordinate-friendly structures, algorithms and applications
inferred← citeshttps://doi.org/10.48550/arxiv.1604.00526openalex-snapshot
The Asynchronous PALM Algorithm for Nonsmooth Nonconvex Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1606.02338openalex-snapshot
The Sound of APALM Clapping: Faster Nonsmooth Nonconvex Optimization with Stochastic Asynchronous PALM
inferred← citeshttps://doi.org/10.48550/arxiv.1606.04551openalex-snapshot
TMAC: A Toolbox of Modern Async-Parallel, Coordinate, Splitting, and Stochastic Methods
inferred← citeshttps://doi.org/10.48550/arxiv.1704.03540openalex-snapshot
Distributed Proximal Gradient Algorithm for Partially Asynchronous Computer Clusters
inferred← citeshttps://doi.org/10.48550/arxiv.1704.04578openalex-snapshot
On Synchronous, Asynchronous, and Randomized Best-Response schemes for computing equilibria in Stochastic Nash games
inferred← citeshttps://doi.org/10.48550/arxiv.1709.07772openalex-snapshot
Probabilistic Synchronous Parallel
inferred← citeshttps://doi.org/10.48550/arxiv.1810.09270openalex-snapshot
A Model Parallel Proximal Stochastic Gradient Algorithm for Partially Asynchronous Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1909.10144openalex-snapshot
Asynchronous Decentralized Successive Convex Approximation
inferred← citeshttps://doi.org/10.48550/arxiv.1911.05606openalex-snapshot
Non-Asymptotic Connectivity of Random Graphs and Their Unions
inferred← citeshttps://doi.org/10.48550/arxiv.2102.04547openalex-snapshot
Asynchronous Parallel Nonconvex Optimization Under the Polyak-Lojasiewicz Condition
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.