Pages that link to "Item:Q259426"

The following pages link to A decomposition method for large scale MILPs, with performance guarantees and a power system application (Q259426):

Displaying 11 items.

• Bounding duality gap for separable problems with linear constraints (Q288396) (← links)
• Dual decomposition for multi-agent distributed optimization with coupling constraints (Q1680912) (← links)
• A decentralized approach to multi-agent MILPs: finite-time feasibility and performance guarantees (Q1737812) (← links)
• A feasibility-ensured Lagrangian heuristic for general decomposable problems (Q2068837) (← links)
• Tracking-ADMM for distributed constraint-coupled optimization (Q2184513) (← links)
• An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs (Q2318770) (← links)
• Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs (Q2665379) (← links)
• Augmented Lagrangian tracking for distributed optimization with equality and inequality coupling constraints (Q6073108) (← links)
• A distributed optimization approach via symmetric group actions under time-varying communication networks (Q6131471) (← links)
• Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm (Q6136497) (← links)
• Hierarchical distributed optimization of constraint-coupled convex and mixed-integer programs using approximations of the dual function (Q6491323) (← links)