DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems

DOI10.1007/S11081-019-09450-5MaRDI QIDQ2302363zbMATH OpenOpenAlexWikidataFDO

Authors Andrew Allman, Wentao Tang, Prodromos Daoutidis

Publication date 26 February 2020

Published in Optimization and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11081-019-09450-5

zbMATH Keywords

automated subproblem generationcommunity detectiondecompositionstructure detectionvariable-constraint graph

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
• The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
• scientific article; zbMATH DE number 5846648
• A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
• Optimization of nonhierarchically decomposed problems

Cites work

• A polyhedral branch-and-cut approach to global optimization
• Community structure in social and biological networks
• Data-driven construction of convex region surrogate models
• DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems
• Decomposition Principle for Linear Programs
• Decomposition techniques in mathematical programming. Engineering and science applications.
• Deterministic electric power infrastructure planning: mixed-integer programming model and nested decomposition algorithm
• Deterministic global optimization with artificial neural networks embedded
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Fast unfolding of communities in large networks
• Generalized Benders decomposition
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Parallel interior-point solver for structured quadratic programs: Application to financial planning problems
• Partitioning procedures for solving mixed-variables programming problems
• Structure Detection in Mixed-Integer Programs

Cited in

(6)

• A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
• A preface to the special issue on enterprise-wide optimization
• DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems
• DeCODe
• Domain decomposition preconditioners for Schur complement systems arising in structured nonlinear optimization problems
• Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization

Describes a project that uses

Uses Software

• MINLP

This page was built for publication: DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems

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