On Paths Generated by Fixed Point Algorithms

DOI10.1287/MOOR.1.4.359zbMATH Open0363.90092OpenAlexW2087802491MaRDI QIDQ4138495FDOQ4138495

Authors: Romesh Saigal 

Publication date: 1976

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1.4.359

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Extremal problems in graph theory (05C35) Numerical computation of solutions to systems of equations (65H10) Fixed-point theorems (47H10)

Cited In (8)

• Relationships of properties of piecewise affine maps over ordered fields
• On the computational complexity of piecewise-linear homotopy algorithms
• Computation of equilibrium values in the Baron and Ferejohn bargaining model
• Computational complexity of a piecewise linear homotopy algorithm
• Some computational methods for systems of nonlinear equations and systems of polynomial equations
• The octahedral algorithm, a new simplicial fixed point algorithm
• Piecewise linear paths to minimize convex functions may not be monotonic
• A property of matrices with positive determinants

This page was built for publication: On Paths Generated by Fixed Point Algorithms

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