Pages that link to "Item:Q644903"

The following pages link to Distributed multi-agent optimization with state-dependent communication (Q644903):

Displaying 29 items.

• Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings (Q288530) (← links)
• Selective bi-coordinate variations for resource allocation type problems (Q301690) (← links)
• Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings (Q312694) (← links)
• Opinion dynamics and learning in social networks (Q545653) (← links)
• Distributed multi-agent optimization with state-dependent communication (Q644903) (← links)
• Geometrical convergence rate for distributed optimization with time-varying directed graphs and uncoordinated step-sizes (Q781032) (← links)
• Distributed multi-agent optimization subject to nonidentical constraints and communication delays (Q905789) (← links)
• Distributed constraint optimization on networked multi-agent systems (Q1732839) (← 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)
• Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks (Q1992405) (← links)
• Distributed stochastic gradient tracking methods (Q2020611) (← links)
• A decentralized multi-objective optimization algorithm (Q2032002) (← links)
• Primal-dual method for optimization problems with changing constraints (Q2104289) (← links)
• Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint (Q2218645) (← links)
• Distributed nonsmooth convex optimization over Markovian switching random networks with two step-sizes (Q2235612) (← links)
• Distributed stochastic subgradient projection algorithms based on weight-balancing over time-varying directed graphs (Q2331322) (← links)
• Sequential threshold control in descent splitting methods for decomposable optimization problems (Q3458841) (← links)
• Distributed optimisation for resource allocation with event-triggered communication over general directed topology (Q5027515) (← links)
• Decentralized multi-agent optimization based on a penalty method (Q5055302) (← links)
• Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays (Q5058405) (← links)
• Distributed Algorithms with Finite Data Rates that Solve Linear Equations (Q5110554) (← links)
• On the steady state of continuous-time stochastic opinion dynamics with power-law confidence (Q5152522) (← links)
• Newton-like Method with Diagonal Correction for Distributed Optimization (Q5275293) (← links)
• Computing over Unreliable Communication Networks (Q5497047) (← links)
• Splitting proximal with penalization schemes for additive convex hierarchical minimization problems (Q5858997) (← links)
• Variable metric primal-dual method for convex optimization problems with changing constraints (Q6043906) (← links)
• A distributed accelerated optimization algorithm over time‐varying directed graphs with uncoordinated step‐sizes (Q6078638) (← links)
• On the gradient method for solving multi-agent systems (Q6187998) (← links)