Relating the gap and graph metrics via the triangle inequality
Andy Packard, M. Helwig · IEEE Transactions on Automatic Control · 1989
A bound relating a special class of constrained optimization problems to their unconstrained counterparts is presented. An application of the results is a bound on the graph metric in terms of the (computable) gap metric.>