On the public citation graph

On the computational complexity of piecewise-linear homotopy algorithms

https://doi.org/10.1007/bf01585104
0 signed · 29 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1965.tb04195.xopenalex-snapshot
An Algorithm for Solving Nonlinear Resistor Networks
inferredcites →https://doi.org/10.1007/978-3-642-50327-6openalex-snapshot
The Computation of Fixed Points and Applications
inferredcites →https://doi.org/10.1007/bf01584229openalex-snapshot
The octahedral algorithm, a new simplicial fixed point algorithm
inferredcites →https://doi.org/10.1007/bf01584975openalex-snapshot
Homotopies for computation of fixed points
inferredcites →https://doi.org/10.1007/bf01584991openalex-snapshot
Homotopies for computation of fixed points on unbounded regions
inferredcites →https://doi.org/10.1007/bf01588254openalex-snapshot
Computational complexity of LCPs associated with positive definite symmetric matrices
inferredcites →https://doi.org/10.1007/bf01589331openalex-snapshot
A class of simplicial restart fixed point algorithms without an extra dimension
inferredcites →https://doi.org/10.1007/bfb0064322openalex-snapshot
A restart algorithm without an artificial level for computing fixed points on unbounded regions
inferredcites →https://doi.org/10.1007/bfb0120782openalex-snapshot
Computational complexity of complementary pivot methods
inferredcites →https://doi.org/10.1007/bfb0120788openalex-snapshot
Improving the convergence of fixed-point algorithms
inferredcites →https://doi.org/10.1016/0166-218x(80)90001-3openalex-snapshot
Observations on a class of nasty linear complementarity problems
inferredcites →https://doi.org/10.1137/1022003openalex-snapshot
Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
inferredcites →https://doi.org/10.1287/moor.1.1.1openalex-snapshot
The Solution of Systems of Piecewise Linear Equations
inferredcites →https://doi.org/10.1287/moor.1.4.359openalex-snapshot
On Paths Generated by Fixed Point Algorithms
inferredcites →https://doi.org/10.1287/moor.5.2.242openalex-snapshot
Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cta.307openalex-snapshot
On simplex-based piecewise-linear approximations of non-linear mappings
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_79openalex-snapshot
Simplicial Methods for Approximating Fixed Point with Applications in Combinatorial Optimizations
inferred← citeshttps://doi.org/10.1007/978-3-642-61257-2openalex-snapshot
Numerical Continuation Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_2openalex-snapshot
Predictor-Corrector and Simplicial Methods for Approximating Fixed Points and Zero Points of Nonlinear Mappings
inferred← citeshttps://doi.org/10.1007/bf01580727openalex-snapshot
Rudiments of an average case complexity theory for piecewise-linear path following algorithms
inferred← citeshttps://doi.org/10.1007/bf02591869openalex-snapshot
Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's
inferred← citeshttps://doi.org/10.1007/bf02612356openalex-snapshot
Computational complexity of a piecewise linear homotopy algorithm
inferred← citeshttps://doi.org/10.1007/bfb0063203openalex-snapshot
An introduction to piecewise-linear homotopy algorithms for solving systems of equations
inferred← citeshttps://doi.org/10.1016/0885-064x(89)90017-4openalex-snapshot
Exponential lower bounds for finding Brouwer fix points
inferred← citeshttps://doi.org/10.1016/s0165-1889(98)00073-6openalex-snapshot
General equilibrium models and homotopy methods
inferred← citeshttps://doi.org/10.1016/s1570-8659(97)80002-6openalex-snapshot
Numerical path following
inferred← citeshttps://doi.org/10.1016/s1574-0021(96)01004-0openalex-snapshot
Chapter 2 Computation of equilibria in finite games
inferred← citeshttps://doi.org/10.1017/s0962492900002336openalex-snapshot
Continuation and path following
inferred← citeshttps://doi.org/10.1109/43.55173openalex-snapshot
A globally and quadratically convergent algorithm for solving nonlinear resistive networks
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.