Pages that link to "Item:Q2273110"
From MaRDI portal
The following pages link to A Mehrotra type predictor-corrector interior-point algorithm for linear programming (Q2273110):
Displaying 12 items.
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming (Q1012253) (← links)
- Todd's low-complexity algorithm is a predictor-corrector path-following method (Q1197903) (← links)
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms (Q1890928) (← links)
- A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence (Q1915908) (← links)
- A corrector-predictor interior-point method with new search direction for linear optimization (Q2201317) (← links)
- A predictor-corrector algorithm combined conjugate gradient with homotopy interior point for general nonlinear programming (Q2350141) (← links)
- A finite termination Mehrotra-type predictor-corrector algorithm (Q2383922) (← links)
- A Mehrotra-type predictor-corrector algorithm with \(O(\sqrt{n}L)\)-iteration complexity (Q2886846) (← links)
- A second order infeasible Mehrotra-type predictor-corrector algorithm for linear programming (Q2924132) (← links)
- The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method (Q4877505) (← links)
- A Mehrotra Type Predictor-Corrector Interior-Point Method for P∗(κ)-HLCP (Q5039376) (← links)
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming (Q5934414) (← links)