Abstract
AbstractWe focus on the problem of finding the greatest element of the intersection of max-closed convex sets. For this purpose, we analyze the famous method of cyclic projections and show that, if this method is suitably initialized and applied to max-closed convex sets, it converges to the greatest element of their intersection. Moreover, we propose another projection method, called the decreasing projection, which turns out both theoretically and practically preferable to Euclidean projections in this particular case. Next, we argue that several known algorithms, such as Bellman-Ford and Floyd-Warshall algorithms for shortest paths or Gauss-Seidel variant of value iteration in Markov decision processes, can be interpreted as special cases of iteratively applying decreasing projections onto certain max-closed convex sets. Finally, we link decreasing projections (and thus also the aforementioned algorithms) to bounds consistency in constraint programming.
Funder
Ministerstvo Školství, Mládeže a Tělovýchovy
Czech Technical University in Prague
Publisher
Springer Science and Business Media LLC
Reference46 articles.
1. Altman, E. (1999). Constrained Markov Decision Processes: Stochastic Modeling. Danvers, MA: Routledge.
2. Apt, K.R. (1999). The rough guide to constraint propagation. In: Principles and Practice of Constraint Programming–CP’99: 5th International Conference, CP’99, Alexandria, VA, USA, October 11-14, 1999. Proceedings 5, pp. 1–23. Springer
3. Bauschke, H. H., & Borwein, J. M. (1996). On projection algorithms for solving convex feasibility problems. SIAM review, 38(3), 367–426.
4. Bellman, R. (1958). On a routing problem. Quarterly of applied mathematics, 16(1), 87–90.
5. Bertsekas, D.P. (1991). Linear network optimization.