Abstract
In this chapter, we take a careful look at the behavior of the central path, when it approaches the optimal solution set of a semidefinite program. We will demonstrate that the primal-dual central path converges to the analytic center of the optimal solution set. Moreover, the distance to this analytic center from any point on the central path is shown to converge at the same R-rate as the duality gap. This result can be interpreted as an error-bound for solutions on the central path, with respect to the optimal solution set. Underlying the analysis is an assumption that a strictly complementary solution pair for the semidefinite program exists.KeywordsAnalytic CenterCentral PathSemidefinite ProgramStrict ComplementarityDual Optimal SolutionThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.