Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Let K be a subspace of Rn and let K⊥ be the orthogonal complement of K. Rockafellar has shown that certain properties of K may be characterized by considering the possible patterns of signs of the nonzero components of vectors of K and of K⊥. Such considerations are shown to lead to the standard characterization theorem for discrete linear Chebyshev approximation as well as to several results on uniqueness of solutions. A method is given for testing uniqueness of a given solution. A special case related to graph theory is discussed and combinatorial methods are given for solving and testing for uniqueness. © 1976.
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
A. Skumanich
SPIE OE/LASE 1992