Combined projected gradient algorithm for linear programming
From MaRDI portal
Publication:5481683
Recommendations
- Combining Interior-Point and Pivoting Algorithms for Linear Programming
- A new least square algorithm for linear programming
- A combined phase I-phase II projective algorithm for linear programming
- On combined phase 1-phase 2 projective methods for linear programming
- scientific article; zbMATH DE number 4025156
Cites work
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- A basis-defiency-allowing variation of the simplex method for linear programming
- A projective simplex method for linear programming
- Commentary—Progress in Linear Programming
- Pivot rules for linear programming: A survey on recent theoretical developments
- Pivot versus interior point methods: Pros and cons
Cited in
(6)- An interesting characteristic of phase-1 of dual-primal algorithm for linear programming
- scientific article; zbMATH DE number 4025156 (Why is no real title available?)
- A combined phase I-phase II projective algorithm for linear programming
- scientific article; zbMATH DE number 4123781 (Why is no real title available?)
- Projected gradient methods for linearly constrained problems
- Dual-primal algorithm for linear optimization
This page was built for publication: Combined projected gradient algorithm for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5481683)