  


Limiting behavior and analyticity of weighted central paths in semidefinite programming
Maria Trnovska (trnovskafmph.uniba.sk) Abstract: In this paper we analyze the limiting behavior of infeasible weighted central paths in semidefinite programming under the assumption that a strictly complementary solution exists. We show that the paths associated with the "square root" symmetrization of the weighted centrality condition are analytic functions of the barrier parameter $\mu$ even at $\mu=0$ if and only if the weight matrix is block diagonal in terms of optimal block partition of variables. This result strengthens some recent result by Lu and Monteiro establishing the analyticity of the paths as functions of $\sqrt\mu$ at $\mu=0$. Moreover, in this paper we study the analytical properties of the paths associated with the "Cholesky factor" symmetrization. We show that the paths exhibit the same analytical behavior at $\mu=0$ as the paths corresponding to the square root symmetrization. Keywords: Semidefinite programming, interiorpoint methods, Category 1: Linear, Cone and Semidefinite Programming (Semidefinite Programming ) Category 2: Linear, Cone and Semidefinite Programming Category 3: Convex and Nonsmooth Optimization Citation: Faculty of Mathematics, Physics and Informatics, Comenius University Bratislava, December 2007 Download: [Postscript][PDF] Entry Submitted: 12/31/2007 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  