Rate of convergence of a class of numerical methods solving linear inequality systems
From MaRDI portal
Recommendations
- Relaxation methods for solving linear inequality systems: converging results
- A relaxation method for solving systems with infinitely many linear inequalities
- Under and over projection methods for solving linear inequality systems
- Newton's method for linear inequality systems
- A primal-dual projection method for solving systems of linear inequalities
Cites work
- A discretization based smoothing method for solving semi-infinite variational inequalities
- A projected lagrangian algorithm for semi-infinite programming
- An inexact approach to solving linear semi-infinite programming problems
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- Implementation of an inexact approach to solving linear semi-infinite programming problems
- Infinite inequality systems and cardinal revelations
- Linear semi-infinite programming theory: an updated survey
- On general infinite dimensional complementarity problems
- Regularity modulus of arbitrarily perturbed linear inequality systems
- Semi-Infinite Programming: Theory, Methods, and Applications
- Solving variational inequalities defined on a domain with infinitely many linear constraints
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
Cited in
(11)- Empirical versus asymptotic rate of convergence of a class of methods for solving a polynomial equation
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
- Relaxation methods for solving linear inequality systems: converging results
- Rate of convergence of higher-order methods
- On convergence of the inexact Rayleigh quotient iteration with the Lanczos method used for solving linear systems
- Entropy based solid transportation problems with discounted unit costs under fuzzy random environment
- Under and over projection methods for solving linear inequality systems
- Extended Active Constraints in Linear Optimization with Applications
- Boundedness Theorems for the Relaxation Method
- A relaxation method for solving systems with infinitely many linear inequalities
- Convergence of a numerical solver for an \(\mathbb R\)-linear Beltrami equation
This page was built for publication: Rate of convergence of a class of numerical methods solving linear inequality systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3112495)
