algebraic-based primal interior-point algorithms for stochastic infinity norm optimization

We study the two-stage stochastic infinity norm optimization problem with recourse based on a commutative algebra. first, we explore and develop the algebraic structure of the infinity norm cone, and utilize it to compute the derivatives of the barrier recourse functions. then, we prove that the barrier recourse functions and the composite barrier functions for this optimization problem are self-concordant families with reference to barrier parameters. these findings are used to develop interior-point algorithms based on primal decomposition for this class of stochastic programming problems. our complexity results for the short- and long-step algorithms show that the dominant complexity terms are linear in the rank of the underlying cone. despite the asymmetry of the infinity norm cone, we also show that the obtained complexity results match (in terms of rank) the best known results in the literature for other well-studied stochastic symmetric cone programs. finally, we demonstrate the efficiency of the proposed algorithm by presenting some numerical experiments on both stochastic uniform facility location problems and randomly-generated problems.