Projection algorithms for linear programming

DOI10.1016/0377-2217(92)90080-SzbMath0767.90043OpenAlexW2071903345MaRDI QIDQ1199509

Peter Gritzmann, Ulrich. Betke

Publication date: 16 January 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90080-s

zbMATH Keywords

projection methodsvariable metric methodexact line searchnearest point projectionfeasibility problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

Zonotopes and the LP-Newton method ⋮ Linear programming by minimizing distances ⋮ Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes ⋮ Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
• A new polynomial-time algorithm for linear programming
• Geometric algorithms and combinatorial optimization
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Polynomial algorithms in linear programming
• Khachiyan’s algorithm for linear programming
• Feature Article—The Ellipsoid Method: A Survey
• On the non-polynomiality of the relaxation method for systems of linear inequalities
• Polynomial algorithms for a class of linear programs
• A Rapidly Convergent Descent Method for Minimization
• Variance algorithm for minimization
• A Family of Variable-Metric Methods Derived by Variational Means
• A new approach to variable metric algorithms
• The Convergence of Single-Rank Quasi-Newton Methods
• Conditioning of Quasi-Newton Methods for Function Minimization
• Convergence rate of the gradient descent method with dilatation of the space
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

This page was built for publication: Projection algorithms for linear programming