Exploiting structure in piecewise-linear homotopy algorithms for solving equations

DOI10.1007/BF01588321MaRDI QIDQ3872237zbMATH OpenFDO

Authors Michael J. Todd

Publication date 1980

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

computation of fixed pointsfixed-point algorithmsmodularitypiecewise-linear homotopy algorithmssolving systems of equationsspecial structuretriangulations

Mathematics Subject Classification ID

Fixed-point and coincidence theorems (topological aspects) (54H25) Numerical mathematical programming methods (65K05) Mathematical programming (90C99)

Cites work

• A modification of todd's triangulationJ 3
• A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization
• Complexity Results for Bandwidth Minimization
• Efficient Acceleration Techniques for Fixed Point Algorithms
• Homotopies for computation of fixed points on unbounded regions
• scientific article; zbMATH DE number 3487169 (Why is no real title available?)
• scientific article; zbMATH DE number 3535189 (Why is no real title available?)
• scientific article; zbMATH DE number 3632243 (Why is no real title available?)
• scientific article; zbMATH DE number 3430031 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• scientific article; zbMATH DE number 3103212 (Why is no real title available?)
• Improving the convergence of fixed-point algorithms
• On Piecewise Linear Approximations to Smooth Mappings
• On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting
• On the homotopic approach to systems of equations with separable mappings
• On triangulations for computing fixed points
• Orientation in Complementary Pivot Algorithms
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• The computation of fixed points and applications
• The Solution of Systems of Piecewise Linear Equations
• Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths

Cited in

(5)

• On parametric nonlinear programming
• A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
• Computation of all solutions to a system of polynomial equations
• On accelerating PL continuation algorithms by predictor—corrector methods
• Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods

This page was built for publication: Exploiting structure in piecewise-linear homotopy algorithms for solving equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3872237)