scientific article; zbMATH DE number 1300325
From MaRDI portal
Publication:4248871
zbMATH Open0926.90070MaRDI QIDQ4248871FDOQ4248871
Authors: Kunping Zhou, Xinxin Hu, Xu Meng 
Publication date: 29 November 1999
Title of this publication is not available (Why is that?)
Recommendations
- Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming
- A new infeasible interior-point algorithm for linear complementarity problem
- A primal-dual infeasible-interior-point algorithm for linear programming
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
infeasible-interior-point algorithm\(\varepsilon\)-complementarity\(\varepsilon\)-feasibilitypath-tracing
Cited In (7)
- Feasible region contraction interior point algorithm
- Following a “Balanced” Trajectory from an Infeasible Point to an Optimal Linear Programming Solution with a Polynomial-Time Algorithm
- A numerical study of an infeasible primal-dual path-following algorithm for linear programming
- Infeasible/feasible search trajectories and directional rounding in integer programming
- Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming
- An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
- A full-Newton step infeasible interior-point algorithm for linear programming based on a self-regular proximity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4248871)
