Search directions for a class of projective methods

DOI10.1007/BF01416226MaRDI QIDQ5752283zbMATH OpenFDO

Authors Uwe T. Zimmermann

Publication date 1990

Published in 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

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

Recommendations

• An interior feasible direction method with constraint projections for linear programming
• A Family of Search Directions for Karmarkar's Algorithm
• scientific article; zbMATH DE number 4151220
• Alternative Approaches to Feasibility in Projective Methods for Linear Programming
• scientific article; zbMATH DE number 4189470

Cites work

• scientific article; zbMATH DE number 4164543 (Why is no real title available?)
• A new polynomial-time algorithm for linear programming
• A polynomial Newton method for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex
• Conical projection algorithms for linear programming
• Search directions for interior linear-programming methods

Cited in

(2)

• Backtrack search for parallelisms of projective spaces
• Alternative Approaches to Feasibility in Projective Methods for Linear Programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5752283)