Pages that link to "Item:Q3738944"

The following pages link to Distributed asynchronous deterministic and stochastic gradient optimization algorithms (Q3738944):

Displaying 50 items.

• A cooperative optimization algorithm inspired by chaos-order transition (Q1667142) (← links)
• Stochastic mirror descent method for distributed multi-agent optimization (Q1670526) (← links)
• Dual decomposition for multi-agent distributed optimization with coupling constraints (Q1680912) (← links)
• On multi-agent self-tuning consensus (Q1689343) (← links)
• Maximizing the coverage of roadmap graph for optimal motion planning (Q1723053) (← links)
• Consensus of multi-agent systems via hybrid impulsive protocols with time-delay (Q1730334) (← links)
• Consensus rate regulation for general linear multi-agent systems under directed topology (Q1732250) (← links)
• Making noise: emergent stochasticity in collective motion (Q1733007) (← links)
• An Arrow-Hurwicz-Uzawa type flow as least squares solver for network linear equations (Q1737636) (← links)
• Distributed optimization over directed graphs with row stochasticity and constraint regularity (Q1737783) (← links)
• Distributed consensus-based multi-agent convex optimization via gradient tracking technique (Q1738645) (← links)
• On control of strong consensus for networked agents with noisy observations (Q1761382) (← links)
• Cyclic stochastic approximation with disturbance on input in the parameter tracking problem based on a multiagent algorithm (Q1792519) (← links)
• A new approach to average consensus problems with multiple time-delays and jointly-connected topologies (Q1926346) (← links)
• Randomized optimal consensus of multi-agent systems (Q1932692) (← links)
• The landscape of empirical risk for nonconvex losses (Q1991675) (← links)
• Asynchronous iterative sub-structuring methods (Q1996992) (← links)
• A decentralized strategy for generalized Nash equilibrium with linear coupling constraints (Q1997984) (← links)
• Gradient-free method for nonsmooth distributed optimization (Q2018475) (← links)
• Stochastic approximation on Riemannian manifolds (Q2020323) (← links)
• Distributed stochastic gradient tracking methods (Q2020611) (← links)
• A study on distributed optimization over large-scale networked systems (Q2036031) (← links)
• Distributed linear regression by averaging (Q2039793) (← links)
• Reaching a consensus via Krause mean processes in multi-agent systems: quadratic stochastic operators (Q2050495) (← links)
• Asynchronous networked aggregative games (Q2063821) (← links)
• Multi-agent control: a graph-theoretic perspective (Q2070030) (← links)
• A multi-scale method for distributed convex optimization with constraints (Q2073060) (← links)
• Surplus-based accelerated algorithms for distributed optimization over directed networks (Q2097723) (← links)
• A resilient continuous-time consensus method using a switching topology (Q2107620) (← links)
• Distributed optimization for uncertain Euler-Lagrange systems with local and relative measurements (Q2116632) (← links)
• Delay-dependent consensus criteria for fractional-order Takagi-Sugeno fuzzy multi-agent systems with time delay (Q2127124) (← links)
• Adaptive backstepping for distributed optimization (Q2139422) (← links)
• Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization (Q2154832) (← links)
• A unitary distributed subgradient method for multi-agent optimization with different coupling sources (Q2174029) (← links)
• Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs (Q2181641) (← links)
• Nonlinear robustified stochastic consensus seeking (Q2189132) (← links)
• Network flows that solve least squares for linear equations (Q2203042) (← links)
• Asynchronous parallel algorithms for nonconvex optimization (Q2205974) (← links)
• Asynchronous level bundle methods (Q2205980) (← links)
• Accelerating the distributed Kaczmarz algorithm by strong over-relaxation (Q2228508) (← links)
• Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup (Q2235160) (← links)
• Self-tuning average consensus in complex networks (Q2263596) (← links)
• Asymptotic properties of consensus-type algorithms for networked systems with regime-switching topologies (Q2276105) (← links)
• Dynamics of opinions with social biases (Q2280789) (← links)
• Consensus in asynchronous multiagent systems. I: Asynchronous consensus models (Q2290394) (← links)
• Communication-efficient algorithms for decentralized and stochastic optimization (Q2297648) (← links)
• Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate (Q2342451) (← links)
• Dynamic coupling design for nonlinear output agreement and time-varying flow control (Q2342534) (← links)
• Agreeing in networks: unmatched disturbances, algebraic constraints and optimality (Q2374467) (← links)
• Consensus based overlapping decentralized estimation with missing observations and communication faults (Q2391324) (← links)