We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min-sum or min-max objective function. Our algorithms run in polynomial time if the optimization problem itself is polynomially solvable. We also extend our results...

In linear-quadratic control (LQC) problems with singular control cost matrix and/or singular transition matrix, we derive a reduction of the dimension of the Riccati matrix, simplifying iteration and solution. Employing a novel transformation, we show that, under a certain rank condition, the...