An interior feasible direction method with constraint projections for linear programming
From MaRDI portal
Publication:804468
DOI10.1016/0898-1221(90)90163-EzbMATH Open0727.90048MaRDI QIDQ804468FDOQ804468
Authors: N. E. Zubov 
Publication date: 1990
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Recommendations
- A feasible direction method for linear programming
- The complex interior-boundary method for linear and nonlinear programming with linear constraints
- Search directions for a class of projective methods
- An experimental investigation of a new multiplex method for linear programming
- scientific article; zbMATH DE number 4189470
Parallel numerical computation (65Y05) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Convex Simplex Method
- Title not available (Why is that?)
- Title not available (Why is that?)
- An external reconstruction approach (ERA) to linear programming
Cited In (6)
- A feasible direction method for linear programming
- A feasible descent cone method for linearly constrained minimization problems
- Title not available (Why is that?)
- Search directions for a class of projective methods
- The complex interior-boundary method for linear and nonlinear programming with linear constraints
- An experimental investigation of a new multiplex method for linear programming
Uses Software
This page was built for publication: An interior feasible direction method with constraint projections for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804468)
