Computational complexity of a piecewise linear homotopy algorithm

DOI10.1007/BF02612356zbMath0536.65030OpenAlexW1998130373MaRDI QIDQ3321342

Romesh Saigal

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02612356

zbMATH Keywords

arithmetic complexityaverage behaviorlarge sparse nonlinear systemsworst case behaviorsimplicial homotopy algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10)

Related Items (3)

Rudiments of an average case complexity theory for piecewise-linear path following algorithms ⋮ Efficiency and implementation of simplicial zero point algorithms ⋮ Model transform and local parameters. Application to instantaneous attractors

Cites Work

• Unnamed Item
• The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
• The fundamental theorem of algebra and complexity theory
• A new variable dimension algorithm for the fixed point problem
• On Paths Generated by Fixed Point Algorithms
• Computational complexity of complementary pivot methods
• On the computational complexity of piecewise-linear homotopy algorithms
• Homotopies for computation of fixed points on unbounded regions

This page was built for publication: Computational complexity of a piecewise linear homotopy algorithm