On the monotone convergence of algorithmic models
From MaRDI portal
Monotone convergence results are provided for nonstationary algorithmic models generated by point-to-set maps under very general assumptions. The results can be applied in developing monotonically convergent iterative algorithms in dynamic systems, in the solution of nonlinear equations, and in optimization problems.
Recommendations
Cites work
- A comparative study of several general convergence conditions for algorithms modeled by point-to-set maps
- Applications of a general convergence theory for outer approximation algorithms
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Monotone iterative methods for nonlinear operator equations∗)
- On a nonlinear input-output system
- Principles and procedures of numerical analysis
- Sufficient convergence conditions for iteration schemes modelled by point-to-set mappings
- The stability and control of discrete processes
Cited in
(9)- Complexity of monotone modelling algorithms for discrete distributions
- A special matrix equation and its application in microelectronics
- The alternating offer bargaining method under uncertainty
- Comparison theorems for algorithmic models
- scientific article; zbMATH DE number 4145883 (Why is no real title available?)
- scientific article; zbMATH DE number 24440 (Why is no real title available?)
- On convergence of the monotone structural evolution
- Point monotonicity of maps and its applications in numerical computation
- On the convergence of nonstationary algorithms modeled by point-to-set maps
This page was built for publication: On the monotone convergence of algorithmic models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186532)