Relaxation methods for solving linear inequality systems: converging results
DOI10.1007/S11750-011-0234-4zbMATH Open1258.49043OpenAlexW2127326301MaRDI QIDQ1939079FDOQ1939079
Authors: L. Hernández Rebollar, Enrique González-Gutiérrez, Maxim Ivanov Todorov 
Publication date: 26 February 2013
Published in: Top (Search for Journal in Brave)
Full work available at URL: http://ddd.uab.cat/record/76056
Recommendations
- A relaxation method for solving systems with infinitely many linear inequalities
- Rate of convergence of a class of numerical methods solving linear inequality systems
- Boundedness Theorems for the Relaxation Method
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
- Under and over projection methods for solving linear inequality systems
Numerical methods based on nonlinear programming (49M37) Numerical methods for variational inequalities and related problems (65K15) Semi-infinite programming (90C34) Numerical methods of relaxation type (49M20)
Cites Work
- Title not available (Why is that?)
- On general infinite dimensional complementarity problems
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Title not available (Why is that?)
- Implementation of an inexact approach to solving linear semi-infinite programming problems
- An inexact approach to solving linear semi-infinite programming problems
- Linear semi-infinite programming theory: an updated survey
- A projected lagrangian algorithm for semi-infinite programming
- Proper efficiency in vector infinite programming problems
- Solving variational inequalities defined on a domain with infinitely many linear constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- On linear inequality systems with smooth coefficients
- Separating the solution sets of analytical and polynomial systems
- On the numerical treatment of linearly constrained semi-infinite optimization problems
- Under and over projection methods for solving linear inequality systems
Cited In (13)
- A relaxation method for solving systems with infinitely many linear inequalities
- Convergence of the cyclical relaxation method for linear inequalities
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A class of problems for which cyclic relaxation converges linearly
- Extending linear relaxation for non-square matrices and soft constraints
- Title not available (Why is that?)
- Rate of convergence of a class of numerical methods solving linear inequality systems
- Title not available (Why is that?)
- Recent contributions to linear semi-infinite optimization
- Recent contributions to linear semi-infinite optimization: an update
- Boundedness Theorems for the Relaxation Method
This page was built for publication: Relaxation methods for solving linear inequality systems: converging results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1939079)
