Observations on infeasibility detectors for classifying conic convex programs. (English)
Optimization 51, No.2, 323-338 (2002).
Summary: New insights are presented from a convex duality classification theory of over 25 years ago for recent computational complexity results developed for recognizing some of the asymptotic duality states that prevail for an arbitrary convex programming pair.
Start
Contact
Print
General Help
