We observe a curious property of dual versus primal-dual path-following interior-point methods when applied to unbounded linear or conic programming problems in dual form. While primal-dual methods can be viewed as implicitly following a central path to detect primal infeasibility and dual unboundedness, dual methods are implicitly moving {\em away} from the analytic center of the set of infeasibility/unboundedness detectors.
Citation
Technical Report 1410, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, August 2004.
Article
View Dual versus primal-dual interior-point methods for linear and conic programming