An example of cycling in a feasible point algorithm
From MaRDI portal
Publication:3912363
DOI10.1007/BF01589358zbMath0462.90062OpenAlexW1998558841MaRDI QIDQ3912363
Publication date: 1981
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01589358
Related Items
On determining the on-line minimax linear fit to a discrete point set in the plane ⋮ A numerically stable dual method for solving strictly convex quadratic programs ⋮ Phase I cycling under the most-obtuse-angle pivot rule
Cites Work