  


A NEW SELFCONCORDANT BARRIER FOR THE HYPERCUBE
Erik Alex Quiroz (erikcos.ufrj.br) Abstract: In this paper we introduce a new barrier function $\sum\limits_{i=1}^n(2x_i1)[\ln{x_i}\ln(1x_i)]$ to solve the following optimization problem: $\min\,\, f(x)$ subject to: $Ax=b;\;\;0\leq x\leq e$. We show that this function is a $(3/2)n$selfconcordant barrier on the hypercube $[0,1]^n$. We prove that the central path is well defined and that under an additional assumption on the objective function, which includes linear and convex quadratic problems, the primal central path converges to the analytic center of the optimal set (with respect to the given barrier). Finally, we present a new polynomial long step path following algorithm to solve the problem when the objective function is linear. For that algorithm we give an upper bound for the total number of Newton iterations to obtain an $\epsilon$optimal solution, with similar complexity to the classic logarithmic barrier, that is $O(n\ln(n\mu_0/\epsilon))$. Keywords: Interior point methods, selfconcordant function, Category 1: Linear, Cone and Semidefinite Programming (Linear Programming ) Category 2: Nonlinear Optimization (Boundconstrained Optimization ) Citation: J Optim Theory Appl (2007) 135:475490 Download: Entry Submitted: 08/10/2004 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  