An analog scheme for fixed-point computation-Part II: Applications

DOI10.1109/81.754845zbMath0953.65038OpenAlexW2132900772MaRDI QIDQ4505183

K. Soumyanath, Vivek S. Borkar

Publication date: 26 September 2000

Published in: IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/81.754845

zbMATH Keywords

dynamic programmingcombinatorial optimizationnonlinear programmingMarkov chainexponential convergencesystems of linear equationsfixed-point computationanalog networksingle source shortest path problemnetwork flow computations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10) Dynamic programming (90C39) Numerical analysis or methods applied to Markov chains (65C40)

Related Items (3)

Optimal path finding with space‐ and time‐variant metric weights via multi‐layer CNN ⋮ Distributed computation of fixed points of \(\infty\)-nonexpansive maps ⋮ Managing interprocessor delays in distributed recursive algorithms

This page was built for publication: An analog scheme for fixed-point computation-Part II: Applications