Combined projected gradient algorithm for linear programming
From MaRDI portal
Publication:5481683
DOI10.1080/10556780600627552zbMATH Open1113.90097OpenAlexW1973338922MaRDI QIDQ5481683FDOQ5481683
Authors: Wei Li, Ping-Qi Pan, Guang-Ting Chen
Publication date: 10 August 2006
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780600627552
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
- Title not available (Why is that?)
- Pivot rules for linear programming: A survey on recent theoretical developments
- A basis-defiency-allowing variation of the simplex method for linear programming
- Commentary—Progress in Linear Programming
- Pivot versus interior point methods: Pros and cons
- A projective simplex method for linear programming
Cited In (6)
- An interesting characteristic of phase-1 of dual–primal algorithm for linear programming
- Title not available (Why is that?)
- A combined phase I-phase II projective algorithm for linear programming
- Dual–primal algorithm for linear optimization
- Projected gradient methods for linearly constrained problems
- Title not available (Why is that?)
Uses Software
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)