Optimal scaling of a gradient method for distributed resource allocation

DOI10.1007/s10957-006-9080-1zbMath1330.90136OpenAlexW2114085163MaRDI QIDQ868539

Publication date: 6 March 2007

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20110714-135402006

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Methods of reduced gradient type (90C52)

Related Items

Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation, A solution strategy for distributed uncertain economic dispatch problems via scenario theory, An extended projected residual algorithm for solving smooth convex optimization problems, Distributed resource allocation over random networks based on stochastic approximation, Initialization-free distributed coordination for economic dispatch under varying loads and generator commitment, Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems, Distributed discrete‐time optimization algorithms with applications to resource allocation in epidemics control, Distributed algorithm design for constrained resource allocation problems with high-order multi-agent systems, Random block coordinate descent methods for linearly constrained optimization over networks, A nonpenalty neurodynamic model for complex-variable optimization, Distributed optimal resource allocation over strongly connected digraphs: a surplus-based approach, Cluster-based distributed augmented Lagrangian algorithm for a class of constrained convex optimization problems, Distributed optimal in-network resource allocation algorithm design via a control theoretic approach, A centre–free approach for resource allocation with lower bounds, A continuous-time neurodynamic approach and its discretization for distributed convex optimization over multi-agent systems, An almost cyclic 2-coordinate descent method for singly linearly constrained problems, Distributed strategy for constrained resource allocation problems of autonomous second-order nonlinear agents and its application to smart grids, Distributed optimization with hybrid linear constraints for multi‐agent networks, A one-layer recurrent neural network for nonsmooth pseudoconvex optimization with quasiconvex inequality and affine equality constraints, Distributed resource allocation of second‐order nonlinear multiagent systems, Distributed safe resource allocation using barrier functions, A Fenchel dual gradient method enabling regularization for nonsmooth distributed optimization over time-varying networks, Distributed delay-tolerant strategies for equality-constraint sum-preserving resource allocation, A Unified Framework for Continuous-Time Unconstrained Distributed Optimization, Distributed optimization in predefined-time for multi-agent systems over a directed network, A Privacy-Preserving Method to Optimize Distributed Resource Allocation, Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems, A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints, Blocks of coordinates, stochastic programming, and markets, Distributed constrained optimization for multi-agent networks with nonsmooth objective functions, Convergence of the augmented decomposition algorithm, Distributed algorithm design for optimal resource allocation problems via incremental passivity theory, Distributed resource allocation on dynamic networks in quadratic time, An Optimal Algorithm for Decentralized Finite-Sum Optimization, Distributed sub-optimal resource allocation via a projected form of singular perturbation, Distributed approximate Newton algorithms and weight design for constrained optimization, Iteration complexity analysis of dual first-order methods for conic convex programming, Distributed algorithm for resource allocation problems under persistent attacks, A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations, A dual approach for optimal algorithms in distributed optimization over networks, Primal recovery from consensus-based dual decomposition for distributed convex optimization, Bilateral exchange and competitive equilibrium, Distributed optimisation for resource allocation with event-triggered communication over general directed topology

Cites Work