The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods

DOI10.1137/1033049zbMath0753.90043OpenAlexW4253497532WikidataQ56228652 ScholiaQ56228652MaRDI QIDQ3978507

Richard E. Stone, Craig A. Tovey

Publication date: 25 June 1992

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1033049

zbMATH Keywords

interior point algorithmssimplex methodleast squares methodsaffine scaling methodprojective scaling algorithm

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (4)

A linear programming primer: from Fourier to Karmarkar ⋮ Loss and retention of accuracy in affine scaling methods ⋮ The effectiveness of finite improvement algorithms for finding global optima ⋮ Pivot rules for linear programming: A survey on recent theoretical developments

This page was built for publication: The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods