Pages that link to "Item:Q868539"

The following pages link to Optimal scaling of a gradient method for distributed resource allocation (Q868539):

Displaying 50 items.

• Primal recovery from consensus-based dual decomposition for distributed convex optimization (Q255083) (← links)
• Bilateral exchange and competitive equilibrium (Q255173) (← links)
• Initialization-free distributed coordination for economic dispatch under varying loads and generator commitment (Q340665) (← links)
• Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems (Q340685) (← links)
• A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
• Distributed resource allocation on dynamic networks in quadratic time (Q503828) (← links)
• Dual subgradient method with averaging for optimal resource allocation (Q723992) (← links)
• Distributed algorithm for resource allocation problems under persistent attacks (Q776086) (← links)
• Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation (Q1626886) (← links)
• Distributed resource allocation over random networks based on stochastic approximation (Q1643399) (← links)
• Distributed optimal in-network resource allocation algorithm design via a control theoretic approach (Q1680667) (← links)
• Blocks of coordinates, stochastic programming, and markets (Q1722745) (← links)
• Distributed constrained optimization for multi-agent networks with nonsmooth objective functions (Q1729131) (← links)
• Convergence of the augmented decomposition algorithm (Q1734773) (← links)
• Distributed algorithm design for optimal resource allocation problems via incremental passivity theory (Q1984735) (← links)
• Distributed sub-optimal resource allocation via a projected form of singular perturbation (Q2003827) (← links)
• A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations (Q2089889) (← links)
• A solution strategy for distributed uncertain economic dispatch problems via scenario theory (Q2138939) (← links)
• An extended projected residual algorithm for solving smooth convex optimization problems (Q2141614) (← links)
• Distributed algorithm design for constrained resource allocation problems with high-order multi-agent systems (Q2165999) (← links)
• An improved distributed gradient-push algorithm for bandwidth resource allocation over wireless local area network (Q2278902) (← links)
• Distributed approximate Newton algorithms and weight design for constrained optimization (Q2280935) (← links)
• Random block coordinate descent methods for linearly constrained optimization over networks (Q2401516) (← links)
• An almost cyclic 2-coordinate descent method for singly linearly constrained problems (Q2419552) (← links)
• A nonpenalty neurodynamic model for complex-variable optimization (Q2662999) (← links)
• Distributed optimal resource allocation over strongly connected digraphs: a surplus-based approach (Q2663958) (← links)
• Cluster-based distributed augmented Lagrangian algorithm for a class of constrained convex optimization problems (Q2665106) (← links)
• Iteration complexity analysis of dual first-order methods for conic convex programming (Q2815553) (← links)
• Distributed discrete‐time optimization algorithms with applications to resource allocation in epidemics control (Q4563349) (← links)
• Distributed optimisation for resource allocation with event-triggered communication over general directed topology (Q5027515) (← links)
• Composite optimization for the resource allocation problem (Q5085260) (← links)
• A Privacy-Preserving Method to Optimize Distributed Resource Allocation (Q5123999) (← links)
• Input–Output Performance of Linear–Quadratic Saddle-Point Algorithms With Application to Distributed Resource Allocation Problems (Q5125623) (← links)
• An Optimal Algorithm for Decentralized Finite-Sum Optimization (Q5162661) (← links)
• A centre–free approach for resource allocation with lower bounds (Q5348382) (← links)
• An <formula formulatype="inline"><tex Notation="TeX">$O(1/k)$</tex> </formula> Gradient Method for Network Resource Allocation Problems (Q5358406) (← links)
• Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems (Q5375972) (← links)
• A dual approach for optimal algorithms in distributed optimization over networks (Q5859014) (← links)
• A continuous-time neurodynamic approach and its discretization for distributed convex optimization over multi-agent systems (Q6055067) (← links)
• Distributed strategy for constrained resource allocation problems of autonomous second-order nonlinear agents and its application to smart grids (Q6059613) (← links)
• Distributed optimization with hybrid linear constraints for multi‐agent networks (Q6071455) (← links)
• A one-layer recurrent neural network for nonsmooth pseudoconvex optimization with quasiconvex inequality and affine equality constraints (Q6072431) (← links)
• Distributed resource allocation of second‐order nonlinear multiagent systems (Q6083830) (← links)
• Distributed safe resource allocation using barrier functions (Q6110305) (← links)
• A Fenchel dual gradient method enabling regularization for nonsmooth distributed optimization over time-varying networks (Q6113532) (← links)
• Distributed delay-tolerant strategies for equality-constraint sum-preserving resource allocation (Q6131454) (← links)
• A Unified Framework for Continuous-Time Unconstrained Distributed Optimization (Q6173814) (← links)
• Distributed optimization in predefined-time for multi-agent systems over a directed network (Q6205001) (← links)
• An exponentially convergent distributed algorithm for resource allocation problem (Q6569881) (← links)
• Distributed algorithm for a finite time horizon resource allocation over a directed network (Q6598888) (← links)