A global convergence theorem for aggregation algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 66945
- scientific article; zbMATH DE number 510832
- A General Approach to Aggregation Problems
- Aggregation Theorems for Allocation Problems
- A note on the fundamental theorem of exact aggregation
- Localization of the optimal solution and a posteriori bounds for aggregation
- scientific article; zbMATH DE number 3997045
- An algorithm of feasible directions for the aggregation problem
- A convergence theorem for graph shift-type algorithms
- Publication:4490820
Cites work
- An Iterative Aggregation Procedure for Markov Decision Processes
- Bounds on the Effect of Aggregating Variables in Linear Programs
- scientific article; zbMATH DE number 3791939 (Why is no real title available?)
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- Iterative Aggregation--A New Approach to the Solution of Large-Scale Problems
- Technical Note—Improved Bounds for Aggregated Linear Programs
Cited in
(9)- Aggregation and decomposition for multi-divisional linear programs
- Decomposition and iterative aggregation in hierarchical and decentralised planning structures
- Convergence of a reactive planning algorithm
- Optimal weights and degeneracy in variable aggregated linear programs
- Aggregation in linear programming and in matrix games
- scientific article; zbMATH DE number 4199498 (Why is no real title available?)
- Decomposition-aggregation method for convex programming problems
- Unconventional analogs of single-parametric method of iterational aggregation
- An algorithm of feasible directions for the aggregation problem
This page was built for publication: A global convergence theorem for aggregation algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3818124)
