Please use this identifier to cite or link to this item:
|Title:||Analyticity of weighted central paths and error bounds for semidefinite programming||Authors:||Chua, Chek Beng.||Keywords:||DRNTU::Science::Mathematics::Applied mathematics::Optimization||Issue Date:||2007||Source:||Chua, C. B. (2007). Analyticity of weighted central paths and error bounds for semidefinite programming. Mathematical Programming, 239-271.||Series/Report no.:||Mathematical programming||Abstract:||The purpose of this paper is two-fold. Firstly, we show that every Cholesky-based weighted central path for semi definite programming is analytic under strict complementarity. This result is applied to homogeneous cone programming to show that the central paths defined by the known class of optimal self-concordant barriers are analytic in the presence of strictly complementary solutions. Secondly, we consider a sequence of primal-dual solutions that lies within a prescribed neighborhood of the central path of a pair of primal-dual semi definite programming problems, and converges to the respective optimal faces. Under the additional assumption of strict complementarity, we derive two necessary and sufficient conditions for the sequence of primal-dual solutions to converge linearly with their duality gaps.||URI:||https://hdl.handle.net/10356/91356
|ISSN:||0025-5610||DOI:||10.1007/s10107-007-0155-z||Rights:||Mathematical Programming @ copyright 2007 Springer-Verlag. The journal's website is located at http://www.springerlink.com.ezlibproxy1.ntu.edu.sg/content/103081.||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SPMS Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.