Decomposition-aggregation method for convex programming problems

DOI10.1080/02331939108843642MaRDI QIDQ3352850zbMATH OpenOpenAlexFDO

Authors I. 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

block structure with coupling variablesdecomposition-aggregation method

Mathematics Subject Classification ID

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

Recommendations

• A Decomposition Method and Its Application to Convex Programming
• scientific article; zbMATH DE number 3959124
• scientific article; zbMATH DE number 4045481
• Convex-concave programming as a decomposition approach to global optimization
• scientific article; zbMATH DE number 1190656
• scientific article; zbMATH DE number 3959143
• A decomposition method for convex minimization problems and its application.
• An algorithm for decomposition coordination of large scale convex programming problems
• Aggregation and decomposition for multi-divisional linear programs
• Decomposition for structured convex programs with smooth multiplier methods

Cites work

• A global convergence theorem for aggregation algorithms
• scientific article; zbMATH DE number 3864992 (Why is no real title available?)

Cited in

(20)

• Decomposition algorithm for convex differentiable minimization
• Aggregation and decomposition for multi-divisional linear programs
• Constraint aggregation principle in convex optimization
• Decomposition and iterative aggregation in hierarchical and decentralised planning structures
• Iterative aggregation and decomposition in block-separable extremum problems
• Optimized packing multidimensional hyperspheres: a unified approach
• Optimized filling of a given cuboid with spherical powders for additive manufacturing
• Certain questions in solving block nonlinear optimization problems with coupling variables
• Optimal weights and degeneracy in variable aggregated linear programs
• Aggregation-based decomposition for multi-divisional models
• scientific article; zbMATH DE number 4129515 (Why is no real title available?)
• scientific article; zbMATH DE number 4170651 (Why is no real title available?)
• scientific article; zbMATH DE number 3959124 (Why is no real title available?)
• A regularized decomposition method for minimizing a sum of polyhedral functions
• scientific article; zbMATH DE number 4009672 (Why is no real title available?)
• scientific article; zbMATH DE number 4068623 (Why is no real title available?)
• Method of expansion for optimization problems which do not have a block-separable structure
• scientific article; zbMATH DE number 6027005 (Why is no real title available?)
• Decomposition in terms of variables for some optimization problems
• Digital model of natural cores using geometric design

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

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