Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity (Q1290671): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4003375 / 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: On a subclass of \(P_ 0\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to interior point algorithms for linear complementary problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some continuity properties of polyhedral multifunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_ *\)-matrices are just sufficient / rank
 
Normal rank

Revision as of 19:25, 28 May 2024

scientific article
Language Label Description Also known as
English
Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
scientific article

    Statements

    Identifiers