A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood

DOI10.1007/S10957-016-0927-9zbMATH Open1344.90037OpenAlexW2324999667MaRDI QIDQ306400FDOQ306400

Authors: M. Sayadi Shahraki, H. Mansouri, M. Zangiabadi 

Publication date: 31 August 2016

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-016-0927-9

Recommendations

• A new wide neighborhood primal-dual predictor-corrector interior-point method for linear programming
• A wide-neighborhood predictor-correcting algorithm for linear programming
• A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming
• A new predictor-corrector infeasible interior-point algorithm for linear optimization in a wide neighborhood
• scientific article; zbMATH DE number 6401300

zbMATH Keywords

predictor-corrector methodprimal-dual interior-point methodswide neighbourhood

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Cites Work

• Title not available (Why is that?)
• A new polynomial-time algorithm for linear programming
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• On Mehrotra-Type Predictor-Corrector Algorithms
• An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
• Title not available (Why is that?)
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Neighborhood-following algorithms for linear programming
• A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with \(O(\sqrt{n}\log\frac{\text{Tr}(X^0S^0)}{\varepsilon})\) iteration complexity
• An easy way to teach interior-point methods.

Cited In (14)

• An \(\operatorname{O}(\sqrt{r}(\operatorname{cond}(G))^{1 / 4}\log \varepsilon^{- 1})\) iteration predictor-corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization
• A new predictor-corrector infeasible interior-point algorithm for linear optimization in a wide neighborhood
• A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization
• A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming
• Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions
• A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization
• A wide neighborhood infeasible-interior-point method with arc-search for \(P_\ast (\kappa)\)-SCLCPs
• A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
• A wide-neighborhood predictor-correcting algorithm for linear programming
• A new wide neighborhood primal-dual predictor-corrector interior-point method for linear programming
• Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
• Title not available (Why is that?)
• A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming
• A step-truncated method in a wide neighborhood interior-point algorithm for linear programming

This page was built for publication: A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306400)