The Internet Archive has a preservation copy of this work in our general collections.
The file type is
The facial reduction algorithm of Borwein and Wolkowicz and the extended dual of Ramana provide a strong dual for the conic linear program (P) | Ax ≤_K b in the absence of any constraint qualification. The facial reduction algorithm solves a sequence of auxiliary optimization problems to obtain such a dual. Ramana's dual is applicable when (P) is a semidefinite program (SDP) and is an explicit SDP itself. Ramana, Tuncel, and Wolkowicz showed that these approaches are closely related; inarXiv:1301.7717v3 fatcat:x6gca7skjrbfde5ogghz7atm7y