Decomposition-aggregation method for convex programming problems

DOI10.1080/02331939108843642zbMath0728.90070OpenAlexW2018697013MaRDI QIDQ3352850

Igor S. Litvinchev

Publication date: 1991

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939108843642

zbMATH Keywords

decomposition-aggregation methodblock structure with coupling variables

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Decomposition methods (49M27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (6)

Decomposition and iterative aggregation in hierarchical and decentralised planning structures ⋮ Digital model of natural cores using geometric design ⋮ Optimized packing multidimensional hyperspheres: a unified approach ⋮ Optimized filling of a given cuboid with spherical powders for additive manufacturing ⋮ Optimal weights and degeneracy in variable aggregated linear programs ⋮ Aggregation and decomposition for multi-divisional linear programs

Cites Work

• A global convergence theorem for aggregation algorithms
• Unnamed Item

This page was built for publication: Decomposition-aggregation method for convex programming problems