Live briefing
Everything about Distributed constraint optimization
Distributed constraint optimization is the distributed analogue to constraint optimization. A DCOP is a problem in which a group of agents must distributedly choose values for a set of variables such that the cost of a set of constraints over the variables is minimized. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Distributed constraint optimizationA 5-minute orientation
- Skim a recent paper: Distributed Gradient Tracking for Unbalanced Optimization With Different Constraint SetsInfluential work since 2022
- Pick up a classic book: Artificial intelligenceThe most-reprinted book on the subject
- Read the landmark paper: Adopt: asynchronous distributed constraint optimization with quality guaranteesCited 389 times
- Go sideways: Constrained optimizationA closely related topic
- Go sideways: Duality (optimization)A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Adopt: asynchronous distributed constraint optimization with quality guarantees
Distributed Constraint Optimization Problems and Applications: A Survey
Tracking-ADMM for distributed constraint-coupled optimization
Distributed optimization over directed graphs with row stochasticity and constraint regularity
Constraint-Coupled Distributed Optimization: A Relaxation and Duality Approach
Distributed constraint optimization for teams of mobile sensing agents
Explorative anytime local search for distributed constraint optimization
Distributed Constraint Optimization Problems: Review and perspectives
🆕 Influential since 2022
Distributed Gradient Tracking for Unbalanced Optimization With Different Constraint Sets
Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization
Distributed Constrained Optimization Over Unbalanced Time-Varying Digraphs: A Randomized Constraint Solving Algorithm
Scheduling of Earth observing satellites using distributed constraint optimization
Dynamic distributed constraint optimization using multi-agent reinforcement learning
📚 Books worth reading
Artificial intelligenceStuart J. Russell, Peter Norvig · 1994
Neural Information ProcessingTingwen Huang · 2012
The personal MBAJosh Kaufman · 2010
Introduction to Multiple Time Series AnalysisHelmut Lütkepohl, Helmut Lutkepohl · 1991
Cooperative control and optimizationRobert Murphey, Panos M. Pardalos · 2002
Distance GeometryAntonio Mucherino · 2012
The computational brainPatricia Smith Churchland · 1992
Pervasive Computing and the Networked WorldQiaohong Zu · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Constrained optimization In mathematical optimization, constrained optimization (in some contexts called constraint optimization) is the process of optimizing an objective function…
- Duality (optimization) In mathematical optimization theory, duality or the duality principle is the principle that optimization problems may be viewed from either of two perspectives…
- Low-rank approximation In mathematics, low-rank approximation refers to the process of approximating a given matrix by a matrix of lower rank. More precisely, it is a minimization…
- Quantum optimization algorithms Quantum optimization algorithms are quantum algorithms that are used to solve optimization problems. Mathematical optimization deals with finding the best…
- Ellipsoid method In mathematical optimization, the ellipsoid method is an iterative method for minimizing convex functions over convex sets. The ellipsoid method generates…
- Differential evolution Differential evolution (DE) is an evolutionary algorithm to optimize a problem by iteratively trying to improve a candidate solution with regard to a given…
- Karush–Kuhn–Tucker conditions In mathematical optimization, the Karush–Kuhn–Tucker (KKT) conditions, also known as the Kuhn–Tucker conditions, are first derivative tests (sometimes…
- Interior-point method Interior-point methods (also referred to as barrier methods or IPMs) are algorithms for solving linear and non-linear convex optimization problems. IPMs…