A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood
From MaRDI portal
(Redirected from Publication:306400)
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
Cites work
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- 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
- A new polynomial-time algorithm for linear programming
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
- An easy way to teach interior-point methods.
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Neighborhood-following algorithms for linear programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On Mehrotra-Type Predictor-Corrector Algorithms
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
- A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming
- scientific article; zbMATH DE number 6401300 (Why is no real title available?)
- 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)
