2 papers
math.OC2025
Numerical analysis of the convex relaxation of the barrier parameter functional of self-concordant barriers
Vitali Pirau, Roland Hildebrand
Self-concordant barriers are essential for interior-point algorithms in conic programming. To speed up the convergence it is of interest to find a barrier with the lowest possible…
math.OC2025
Robustifying networks for flow problems against edge failure
Artyom Klyuchikov, Roland Hildebrand, Sergei Protasov +2
We consider the robust version of a multi-commodity network flow problem. The robustness is defined with respect to the deletion, or failure, of edges. While the flow problem itsel…