2026-03-10T00:52:51Z https://grips.repo.nii.ac.jp/oai

oai:grips.repo.nii.ac.jp:00001372 2023-12-14T04:14:56Z 52:53

An O(√nL) Iteration Large-Step Logarithmic Barrier Function Algorithm for Linear Programming TONE, Kaoru Linear programming interior point algorithm barrier function potential function primal and dual complexity As a natural extension of Roos and Vial's "Long steps with logarithmic penalty barrier function in llnear programming" (1989) and Ye's "An O(n³L) potential reduction algorithm for linear programming" (1989), it will be shown that the classical logarithmic barrier function method can be adjusted so that it generates the optimal solution in O(√nL) iterations, where n is the number of variables and L is the data length. departmental bulletin paper Technology Policy Science, Saitama Univ 1989-11 AM application/pdf Institute for Policy Science research report. B B-5 89 https://grips.repo.nii.ac.jp/record/1372/files/89-B-5.pdf https://grips.repo.nii.ac.jp/records/1372 eng