Search directions for a class of projective methods

DOI10.1007/BF01416226zbMath0719.90046MaRDI QIDQ5752283

Uwe T. Zimmermann

Publication date: 1990

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

zbMATH Keywords

upper boundsearch directionspolynomial time bounddescent directions for projective methodsinfeasibility criteria

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• A polynomial Newton method for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Conical projection algorithms for linear programming
• Search directions for interior linear-programming methods
• An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex

This page was built for publication: Search directions for a class of projective methods