A unified approach to interior point algorithms for linear complementarity problems: A summary (Q1180826): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Kojima, Masakazu / rank
Normal rank
 
Property / author
 
Property / author: Kojima, Masakazu / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: KORBX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Sufficient matrices and the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583564 / 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: A new polynomial-time algorithm for linear programming / 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: Q4206561 / 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: Q3804467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733658 / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-6377(91)90010-m / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020305724 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:51, 30 July 2024

scientific article
Language Label Description Also known as
English
A unified approach to interior point algorithms for linear complementarity problems: A summary
scientific article

    Statements

    A unified approach to interior point algorithms for linear complementarity problems: A summary (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 June 1992
    0 references
    path-following
    0 references
    potential reduction
    0 references
    interior point algorithms
    0 references
    linear complementarity
    0 references
    positive semi-definite matrix
    0 references
    nonsymmetric matrices with nonnegative principal minors
    0 references

    Identifiers