Comparison theorems for algorithmic models

DOI10.1016/0096-3003(90)90131-LzbMath0717.65033OpenAlexW2086776349MaRDI QIDQ2638727

Ioannis K. Argyros, Ferenc Szidarovszky

Publication date: 1990

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(90)90131-l

zbMATH Keywords

monotonicityoptimization problemscomparison theoremscommon fixed pointsparametric equationsiteration sequenceslinear input-output systemsequilibria in dynamic processesnonnegative invertibility of real matrices

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) General theory of numerical analysis in abstract spaces (65J05) Numerical methods for initial value problems involving ordinary differential equations (65L05) Direct numerical methods for linear systems and matrix inversion (65F05)

Cites Work

• Unnamed Item
• Unnamed Item
• Principles and procedures of numerical analysis
• On non-negative solvability of nonlinear input-output systems
• Convergence of general iteration schemes
• Epigraphical nesting: A unifying theory for the convergence of algorithms
• A comparative study of several general convergence conditions for algorithms modeled by point-to-set maps

This page was built for publication: Comparison theorems for algorithmic models