Print Email Facebook Twitter Infeasible Interior-Point Methods for Linear Optimization Based on Large Neighborhood Title Infeasible Interior-Point Methods for Linear Optimization Based on Large Neighborhood Author Asadi, A.R. Roos, C. Faculty Electrical Engineering, Mathematics and Computer Science Department Delft Institute of Applied Mathematics Date 2015-10-29 Abstract In this paper, we design a class of infeasible interior-point methods for linear optimization based on large neighborhood. The algorithm is inspired by a full-Newton step infeasible algorithm with a linear convergence rate in problem dimension that was recently proposed by the second author. Unfortunately, despite its good numerical behavior, the theoretical convergence rate of our algorithm is worse up to square root of problem dimension. Subject linear optimizationprimal-dual infeasible interior-point methodspolynomial algorithms To reference this document use: http://resolver.tudelft.nl/uuid:3e7d8a9e-280c-4b6c-98a9-fcbb0985a3d9 Publisher Springer ISSN 0022-3239 Source https://doi.org/10.1007/s10957-015-0826-5 Source Journal of Optimization Theory and Applications, 2015 Part of collection Institutional Repository Document type journal article Rights © 2015 The Author(s)This article is published with open access at Springerlink.com Files PDF Roos_2015.pdf 535.45 KB Close viewer /islandora/object/uuid:3e7d8a9e-280c-4b6c-98a9-fcbb0985a3d9/datastream/OBJ/view