Projection algorithms for linear programming
From MaRDI portal
The paper is concerned with iterative projection methods for solving the feasibility problem of linear programming. The approach gives rise to a geometric interpretation based on the nearest point projection. It uses an unconstrained convex programming formulation in which it is possible to chose differentiable objective functions. A particular study of an algorithm using a variable metric method with exact line search is presented.
Recommendations
Cites work
- A Family of Variable-Metric Methods Derived by Variational Means
- A modification of Karmarkar's linear programming algorithm
- A new approach to variable metric algorithms
- A new polynomial-time algorithm for linear programming
- A Rapidly Convergent Descent Method for Minimization
- Conditioning of Quasi-Newton Methods for Function Minimization
- Convergence rate of the gradient descent method with dilatation of the space
- Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
- Feature Article—The Ellipsoid Method: A Survey
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 3876916 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 3588394 (Why is no real title available?)
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 3229228 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3345859 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- Khachiyan’s algorithm for linear programming
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- On the non-polynomiality of the relaxation method for systems of linear inequalities
- Polynomial algorithms for a class of linear programs
- Polynomial algorithms in linear programming
- The Convergence of Single-Rank Quasi-Newton Methods
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Variance algorithm for minimization
Cited in
(31)- An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems
- Implementing proximal point methods for linear programming
- Solution of projection problems over polytopes
- On combined phase 1-phase 2 projective methods for linear programming
- On a class of iterative projection and contraction methods for linear programming
- Approximation of linear programs by Bregman's \(D_F\) projections
- A polynomial projection-type algorithm for linear programming
- Algorithms of projective optimization which use the multipliers of previous iterations
- A projective simplex algorithm using LU decomposition
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- Computational acceleration of projection algorithms for the linear best approximation problem
- Large-scale nonlinear programming algorithm using projection methods
- Single-projection procedure for linear optimization
- scientific article; zbMATH DE number 4211801 (Why is no real title available?)
- A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs
- scientific article; zbMATH DE number 3991280 (Why is no real title available?)
- scientific article; zbMATH DE number 4025156 (Why is no real title available?)
- scientific article; zbMATH DE number 4110452 (Why is no real title available?)
- Linear programming by minimizing distances
- scientific article; zbMATH DE number 495923 (Why is no real title available?)
- How good are extrapolated bi-projection methods for linear feasibility problems?
- scientific article; zbMATH DE number 4119925 (Why is no real title available?)
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
- Solving LP using random projections
- On the step choice in projection algorithms for large-scale linear programming problems
- A fast converging iterative algorithm for linear programming
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- Computing projections with LSQR
- Finding the projection of a given point on the set of solutions of a linear programming problem
- Zonotopes and the LP-Newton method
- An alternating projections algorithm for solving linear programs
This page was built for publication: Projection algorithms for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199509)
