Projection methods for finding the greatest element of the intersection of max-closed convex sets

DOI10.1007/s10479-024-05980-zMaRDI QIDQ6638853

Tomáš Dlask

Publication date: 14 November 2024

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

shortest pathseuclidean projectionmax-closed polyhedronmax-closed set

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Operations research and management science (90Bxx) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hilbertian convex feasibility problem: Convergence of projection methods
• The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
• Simplicial pivoting algorithms for a tractable class of integer programs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A combinatorial algorithm for Horn programs
• A zero-space algorithm for negative cost cycle detection in networks
• Extreme points of Leontief substitution systems
• An \(O(nm)\)-time network simplex algorithm for the shortest path problem
• A New Algorithm for Linear and Integer Feasibility in Horn Constraints
• On a routing problem
• An Auction Algorithm for Shortest Paths
• A note on polyhedral sets having A least element
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• On Projection Algorithms for Solving Convex Feasibility Problems
• Discrete Graphical Models — An Optimization Perspective
• Polyhedral sets having a least element
• Functional Operators (AM-22), Volume 2
• Self-dual configurations and regular graphs

This page was built for publication: Projection methods for finding the greatest element of the intersection of max-closed convex sets