On the computational complexity of piecewise-linear homotopy algorithms (Q4749612): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Observations on a class of nasty linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopies for computation of fixed points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4112523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopies for computation of fixed points on unbounded regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Solution of Systems of Piecewise Linear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of LCPs associated with positive definite symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving Nonlinear Resistor Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3893221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of simplicial restart fixed point algorithms without an extra dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of complementary pivot methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Paths Generated by Fixed Point Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of fixed points and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the convergence of fixed-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The octahedral algorithm, a new simplicial fixed point algorithm / rank
 
Normal rank

Revision as of 17:39, 13 June 2024

scientific article; zbMATH DE number 3805285
Language Label Description Also known as
English
On the computational complexity of piecewise-linear homotopy algorithms
scientific article; zbMATH DE number 3805285

    Statements

    On the computational complexity of piecewise-linear homotopy algorithms (English)
    0 references
    0 references
    1982
    0 references
    computational complexity
    0 references
    piecewise linear homotopy algorithm
    0 references
    exponential growth
    0 references
    linear complementarity problem
    0 references
    solutions nonlinear equations
    0 references
    fixed point algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references