A global convergence theorem for aggregation algorithms

DOI10.1080/02331938808843395zbMath0665.90060OpenAlexW2223856709MaRDI QIDQ3818124

No author found.

Publication date: 1988

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

aggregation algorithmsglobal convergence conditions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30)

Related Items (6)

Decomposition and iterative aggregation in hierarchical and decentralised planning structures ⋮ Unconventional analogs of single-parametric method of iterational aggregation ⋮ Decomposition-aggregation method for convex programming problems ⋮ An algorithm of feasible directions for the aggregation problem ⋮ Optimal weights and degeneracy in variable aggregated linear programs ⋮ Aggregation and decomposition for multi-divisional linear programs

Cites Work

• Unnamed Item
• Unnamed Item
• Bounds on the Effect of Aggregating Variables in Linear Programs
• Iterative Aggregation--A New Approach to the Solution of Large-Scale Problems
• Technical Note—Improved Bounds for Aggregated Linear Programs
• An Iterative Aggregation Procedure for Markov Decision Processes

This page was built for publication: A global convergence theorem for aggregation algorithms