Vector-Supercomputer Experiments with the Primal Affine Linear Programming Scaling Algorithm
The interior point method of \textit{I. I. Dikin} [Dokl. Akad. Nauk SSSR 174, 747-748 (1967; Zbl 0189.195)] is tested on some discretized semi- infinite programming problems. But first, a proof of the asymptotic linear convergence rate is given under mild assumptions. The following two classes of problems are studied. The first class consists of problems that owe their size to either single-precision or double-precision, fully dense, constraint matrices. The second class stems from computing limit collapse loads in a plastic plane strain problem, as studied in engineering continuum mechanics. All computational experiments were performed on CRAY supercomputers.
- Superlinear primal-dual affine scaling algorithms for LCP
- Linear Programming on Cray Supercomputers
- Nonlinear Network Programming on Vector Supercomputers: A Study on the CRAY X-MP
- Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm
- Vector processing in simplex and interior methods for linear programming
- Computing material collapse displacement fields on a Cray X-MP/48 by the LP primal affine scaling algorithm
This page was built for publication: Vector-Supercomputer Experiments with the Primal Affine Linear Programming Scaling Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286349)