Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Kojima, Masakazu / rank
Normal rank
 
Property / author
 
Property / author: Kojima, Masakazu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of Karmarkar's algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variation on Karmarkar’s algorithm for solving linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Predictor-Corrector Algorithm for a Class of Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Enhancements to the Method of Centers for Linear Programming Problems / 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: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopy Continuation Methods for Nonlinear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior point potential reduction algorithm for the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491304 / 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 \(O(\sqrt n L)\) iteration potential reduction algorithm for 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: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS / 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 Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global ellipsoidal approximations and homotopy methods for solving convex analytic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Centered Projective Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification of Karmarkar's linear programming algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near boundary behavior of primal-dual potential reduction algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01581234 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992241390 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:49, 30 July 2024

scientific article
Language Label Description Also known as
English
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
scientific article

    Statements

    Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (English)
    0 references
    0 references
    0 references
    0 references
    30 August 1993
    0 references
    generic primal-dual interior point method
    0 references
    global convergence
    0 references
    polynomial-time computational complexity
    0 references
    large steps
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers