Vanishing price of decentralization in large coordinative nonconvex optimization

DOI10.1137/16M1068207zbMATH Open1371.90114OpenAlexW2753851509MaRDI QIDQ5359499FDOQ5359499

Authors: Mengdi Wang 

Publication date: 25 September 2017

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/16m1068207

Recommendations

• Coordination complexity: small information coordinating large populations
• DECENTRALIZED OPTIMIZATION VIA NASH BARGAINING
• Decentralized multi-agent optimization based on a penalty method
• Distributed coordination for nonsmooth convex optimization via saddle-point dynamics
• Decentralized optimization over tree graphs

zbMATH Keywords

nonconvex optimizationcutting plane methodduality gapmulti-agent optimizationcooperative optimizationprice of decentralization

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)

Cites Work

• Linear programming. Foundations and extensions
• Title not available (Why is that?)
• Convex optimization theory.
• Convex Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Distributed Maximum Likelihood Sensor Network Localization
• A decomposition method for large scale MILPs, with performance guarantees and a power system application
• Optimal short-term scheduling of large-scale power systems
• Estimates of the Duality Gap in Nonconvex Optimization
• Bundle methods for regularized risk minimization
• A geometric study of dual gaps, with applications
• Bounding duality gap for separable problems with linear constraints
• Quasi-Equilibria in Markets with Non-Convex Preferences
• A Note on Approximation Schemes for Multidimensional Knapsack Problems
• A simple proof of the Shapley-Folkman theorem
• On the existence of pure-strategy equilibria in large games
• Approximation of points of the convex hull of a sum of sets by points of the sum: an elementary approach
• Measures of the non-convexity of sets and the Shapley–Folkman–Starr theorem
• Set-Valued Approximations with Minkowski Averages – Convergence and Convexification Rates
• Existence of Approximate Equilibria and Cores
• Limit theorems for random compact sets in Banach space
• Sharing nonconvex costs
• General equilibrium theory. An introduction.
• Duality Gap Estimation and Polynomial Time Approximation for Optimal Spectrum Management
• A geometric framework for nonconvex optimization duality using augmented Lagrangian functions
• An Equilibrium Existence Theorem without Convexity Assumptions
• Convexification procedures and decomposition methods for nonconvex optimization problems
• On Finding Primal- and Dual-Optimal Bases
• Large deviations for sums of i.i.d. random compact sets
• On the Duality Gap in Nonconvex Optimization
• Blessing of massive scale: spatial graphical model estimation with a total cardinality constraint approach
• Noncooperative and Cooperative Optimization of Distributed Energy Generation and Storage in the Demand-Side of the Smart Grid

Cited In (3)

• DECENTRALIZED OPTIMIZATION VIA NASH BARGAINING
• Near-Optimal Distributed Linear-Quadratic Regulator for Networked Systems
• Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution

Uses Software

• bmrm
• LPbook

This page was built for publication: Vanishing price of decentralization in large coordinative nonconvex optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5359499)