An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
From MaRDI portal
Publication:4877503
DOI10.1137/0806002zbMath0846.90071OpenAlexW2144868677MaRDI QIDQ4877503
Publication date: 30 September 1996
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0806002
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)
Related Items
Local convergence of interior-point algorithms for degenerate monotone LCP, Global convergence in infeasible-interior-point algorithms, Superlinear convergence of infeasible-interior-point methods for linear programming, Polynomiality of infeasible-interior-point algorithms for linear programming, A wide neighborhood infeasible-interior-point method with arc-search for linear programming, A predictor-corrector infeasible-interior-point algorithm for linear programming, Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems, A generalized homogeneous and self-dual algorithm for linear programming, An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution, An infeasible-interior-point algorithm using projections onto a convex set, An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence, A path-following interior-point algorithm for linear and quadratic problems, A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization, A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems, An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization, Full Nesterov-Todd step infeasible interior-point method for symmetric optimization, Equivaence between different formulations of the linear complementarity promblem, A modified infeasible-interior-point algorithm for linear optimization problems, New complexity analysis of IIPMs for linear optimization based on a specific self-regular function, A new class of infeasible interior-point algorithm for linear complementarity problem, An infeasible interior-point algorithm with full-Newton step for linear optimization, An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization, Convergence of the homotopy path for a full-Newton step infeasible interior-point method, SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps, Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization, Infeasible constraint-reduced interior-point methods for linear optimization, Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions, Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions, A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem, A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points, An adaptive infeasible interior-point algorithm for linear complementarity problems, An interior point potential reduction method for constrained equations, Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming, On the convergence analysis of arc search interior point methods for LCPs, Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems
