Solving SDP completely with an interior point oracle
Sign Up to like & getrecommendations! Published in 2021 at "Optimization Methods and Software"
DOI: 10.1080/10556788.2020.1850720
Abstract: We suppose the existence of an oracle which solves any semidefinite programming (SDP) problem satisfying strong feasibility (i.e. Slater's condition) simultaneously at its primal and dual sides. We note that such an oracle might not… read more here.
Keywords: facial reduction; oracle; sdp completely; solving sdp ... See more keywords