On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise (Q1206441): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q192567
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Thomas F. Coleman / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long steps in an \(O(n^ 3L)\) algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of a Primal-Dual Interior Point Method for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4206561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. I: Linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm, based on Newton's method, for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Karmarkar projections quickly / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01188712 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050681410 / rank
 
Normal rank

Latest revision as of 11:12, 30 July 2024

scientific article
Language Label Description Also known as
English
On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise
scientific article

    Statements

    On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise (English)
    0 references
    0 references
    0 references
    0 references
    1 April 1993
    0 references
    This paper is concerned with improving the efficiency of the primal-dual potential reduction approach to linear programming of \textit{M. Kojima, S. Mizuno} and \textit{A. Yoshise} [Math. Program., Ser. A 50, No. 3, 331-342 (1991; Zbl 0738.90077)]with the use of partial updating. Various theoretical complexity results are established. Experimental results are not provided.
    0 references
    interior-point method
    0 references
    primal-dual potential reduction approach
    0 references
    partial updating
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references