We present a full-Newton step infeasible interior-point algorithm based on a new search direction. The algorithm decreases the duality gap and the feasibility residuals at the same rate. During this algorithm we construct strictly feasible iterates for a sequence of perturbations of the given problem and its dual problem. Each main iteration of the algorithm consists of a feasibility step and some centering steps. We show that the algorithm converges and finds an approximate solution in a polynomial time complexity. A numerical study is done for its numerical performance.
This paper deals with an infeasible interior-point algorithm with full-Newton step for linear optimization based on a kernel function, which is an extension of the work of the first author and coworkers (J. Math. Model Algorithms (2013); DOI 10.1007/s10852-013-9227-7). The main iteration of the algorithm consists of a feasibility step and several centrality steps. The centrality step is based on Darvay's direction, while we used a kernel function in the algorithm to induce the feasibility step. For the kernel function, the polynomial complexity can be proved and the result coincides with the best result for infeasible interior-point methods.
In this paper we present a large-update primal-dual interior-point algorithm for convex quadratic semi-definite optimization problems based on a new parametric kernel function. The goal of this paper is to investigate such a kernel function and show that the algorithm has the best complexity bound. The complexity bound is shown to be O(√ n log n log n).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.