.png){kind=icon}
.png){kind=icon}
Return
Stochastic blockmodeling for learning the structure of optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1002/aic.17415.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Decomposition-based solution algorithms for optimization problems depend on the underlying latent block structure of the problem. Methods for detecting this structure are currently lacking. In this article, we propose stochastic blockmodeling (SBM) as a systematic framework for learning the underlying block structure in generic optimization problems. SBM is a generative graph model in which nodes belong to some blocks and the interconnections among the nodes are stochastically dependent on their block affiliations. Hence, through parametric statistical inference, the interconnection patterns underlying optimization problems can be estimated. For benchmark optimization problems, we show that SBM can reveal the underlying block structure and that the estimated blocks can be used as the basis for decomposition-based solution algorithms which can reach an optimum or bound estimates in reduced computational time. Finally, we present a general software platform for automated block structure detection and decomposition-based solution following distributed and hierarchical optimization approaches.
Keywords:
Benders decomposition
Lagrangean decomposition
network decomposition
stochastic blockmodeling