Neighborhood-following algorithms for linear programming
From MaRDI portal
Publication:2386553
zbMath1081.90040MaRDI QIDQ2386553
Publication date: 30 August 2005
Published in: Science in China. Series A (Search for Journal in Brave)
Related Items (23)
A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming ⋮ A wide neighborhood infeasible-interior-point method with arc-search for linear programming ⋮ A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming ⋮ A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood ⋮ A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ−1) iteration complexity ⋮ A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming ⋮ A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization ⋮ A New Wide Neighborhood Primal-Dual Predictor-Corrector Interior-Point Method for Linear Programming ⋮ Two wide neighborhood interior-point methods for symmetric cone optimization ⋮ A new infeasible-interior-point algorithm for linear programming over symmetric cones ⋮ An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs ⋮ A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization ⋮ A new second-order corrector interior-point algorithm for semidefinite programming ⋮ A step-truncated method in a wide neighborhood interior-point algorithm for linear programming ⋮ Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions ⋮ An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming ⋮ A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood ⋮ An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood ⋮ A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs ⋮ An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization ⋮ A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function ⋮ An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming ⋮ A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity
This page was built for publication: Neighborhood-following algorithms for linear programming
