Abstract:This paper gives an overview of verification methods for finite dimensional conic linear programming problems. Besides the computation of verified tight enclosures for unique non-degenerate solutions to well-posed conic linear programming instances, we discuss a rigorous treatment of problems with multiple or degenerate solutions. It will be further shown how a priori knowledge about certain boundedness qualifications can be exploited to efficiently compute verified bounds for the optimal objective value. The … Show more
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.