A relaxation method for solving systems with infinitely many linear inequalities
From MaRDI portal
Recommendations
- Relaxation methods for solving linear inequality systems: converging results
- Rate of convergence of a class of numerical methods solving linear inequality systems
- scientific article; zbMATH DE number 776085
- scientific article; zbMATH DE number 24371
- 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 accelerated central cutting plane algorithm for linear 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
- Handbook of applied optimization
- scientific article; zbMATH DE number 3856876 (Why is no real title available?)
- scientific article; zbMATH DE number 3810823 (Why is no real title available?)
- scientific article; zbMATH DE number 3630144 (Why is no real title available?)
- scientific article; zbMATH DE number 679864 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 776085 (Why is no real title available?)
- 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
- Motzkin decomposition of closed convex sets
- On general infinite dimensional complementarity problems
- Proper efficiency in vector infinite programming problems
- Semi-Infinite Programming: Theory, Methods, and Applications
- Solving variational inequalities defined on a domain with infinitely many linear constraints
- Spectral localization of operators in Banach spaces
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
Cited in
(15)- An automatic relaxation method for solving interval linear inequalities
- On approximate solutions of infinite systems of linear inequalities
- Solution of infinite linear systems by automatic adaptive iterations
- Recent contributions to linear semi-infinite optimization
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
- Recent contributions to linear semi-infinite optimization: an update
- Relaxation methods for solving linear inequality systems: converging results
- Under and over projection methods for solving linear inequality systems
- Rate of convergence of a class of numerical methods solving linear inequality systems
- scientific article; zbMATH DE number 3864993 (Why is no real title available?)
- scientific article; zbMATH DE number 7295437 (Why is no real title available?)
- scientific article; zbMATH DE number 24371 (Why is no real title available?)
- scientific article; zbMATH DE number 3998018 (Why is no real title available?)
- scientific article; zbMATH DE number 776085 (Why is no real title available?)
- Boundedness Theorems for the Relaxation Method
This page was built for publication: A relaxation method for solving systems with infinitely many linear inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691462)
