A new predictor-collector algorithm for linear programming
From MaRDI portal
Recommendations
- A predictor-corrector algorithm for linearly constrained convex optimization
- New interior point algorithms in linear programming
- A wide-neighborhood predictor-correcting algorithm for linear programming
- A predictor-corrector infeasible-interior-point algorithm for linear programming
- scientific article; zbMATH DE number 954673
Cited in
(10)- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- A corrector-predictor interior-point method with new search direction for linear optimization
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization
- A predictor-corrector algorithm for linearly constrained convex optimization
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function
- Corrector-predictor interior-point method with new search direction for semidefinite optimization
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
- New predictor-corrector algorithm for symmetric cone horizontal linear complementarity problems
This page was built for publication: A new predictor-collector algorithm for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3428838)
