A little theorem of the big \({\mathcal M}\) in interior point algorithms (Q687037): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 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: A combined phase I-phase II projective algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical efficiency of a shifted-barrier-function algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial Newton method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonlinear complementarity problem, with applications. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Framework of Continuation Methods for Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical convergence of large-step primal-dual interior point algorithms for linear programming / 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: Feasibility issues in a primal-dual interior-point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a primal-dual interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple bounds for solutions of monotone complementarity problems and convex programs / 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: A monotone complementarity problem with feasible solutions but no complementary solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial time method 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: Classes of functions and feasibility conditions in nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining phase I and phase II in a potential reduction algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric indefinite systems for interior point methods / rank
 
Normal rank

Latest revision as of 11:14, 22 May 2024

scientific article
Language Label Description Also known as
English
A little theorem of the big \({\mathcal M}\) in interior point algorithms
scientific article

    Statements

    A little theorem of the big \({\mathcal M}\) in interior point algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 August 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    interior point algorithms
    0 references
    big \(\mathcal M\)
    0 references
    polynomial-time potential reduction algorithm
    0 references
    positive semi-definite linear complementarity
    0 references
    artificial self-dual linear program
    0 references
    0 references