On homogeneous and self-dual algorithms for LCP (Q1361111): 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: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence behavior of interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds for monotone linear 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: Local convergence of interior-point algorithms for degenerate monotone LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some perturbation theory for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified homogeneous and self-dual linear programming algorithm and its implementation / rank
 
Normal rank

Revision as of 16:37, 27 May 2024

scientific article
Language Label Description Also known as
English
On homogeneous and self-dual algorithms for LCP
scientific article

    Statements

    Identifiers