On Paths Generated by Fixed Point Algorithms
From MaRDI portal
Publication:4138495
DOI10.1287/MOOR.1.4.359zbMath0363.90092OpenAlexW2087802491MaRDI QIDQ4138495
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
Extremal problems in graph theory (05C35) Convex programming (90C25) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Fixed-point theorems (47H10)
Related Items (8)
A property of matrices with positive determinants ⋮ Computation of equilibrium values in the Baron and Ferejohn bargaining model ⋮ Relationships of properties of piecewise affine maps over ordered fields ⋮ Computational complexity of a piecewise linear homotopy algorithm ⋮ Some computational methods for systems of nonlinear equations and systems of polynomial equations ⋮ Piecewise linear paths to minimize convex functions may not be monotonic ⋮ The octahedral algorithm, a new simplicial fixed point algorithm ⋮ On the computational complexity of piecewise-linear homotopy algorithms
This page was built for publication: On Paths Generated by Fixed Point Algorithms
