Relaxation methods for solving linear inequality systems: converging results

DOI10.1007/S11750-011-0234-4MaRDI QIDQ1939079zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

feasibility problemrelaxation methodinfinite inequality systems

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3856876 (Why is no real title available?)
• scientific article; zbMATH DE number 3630144 (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?)
• A projected lagrangian algorithm for semi-infinite programming
• An inexact approach to solving linear semi-infinite programming problems
• Implementation of an inexact approach to solving linear semi-infinite programming problems
• Linear semi-infinite programming theory: an updated survey
• On general infinite dimensional complementarity problems
• On linear inequality systems with smooth coefficients
• On the numerical treatment of linearly constrained semi-infinite optimization problems
• Proper efficiency in vector infinite programming problems
• Separating the solution sets of analytical and polynomial systems
• Solving variational inequalities defined on a domain with infinitely many linear constraints
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• Under and over projection methods for solving linear inequality systems

Cited in

(13)

• scientific article; zbMATH DE number 7295437 (Why is no real title available?)
• Boundedness Theorems for the Relaxation Method
• A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
• Recent contributions to linear semi-infinite optimization: an update
• A relaxation method for solving systems with infinitely many linear inequalities
• scientific article; zbMATH DE number 3864993 (Why is no real title available?)
• scientific article; zbMATH DE number 4131528 (Why is no real title available?)
• Extending linear relaxation for non-square matrices and soft constraints
• Convergence of the cyclical relaxation method for linear inequalities
• Rate of convergence of a class of numerical methods solving linear inequality systems
• Recent contributions to linear semi-infinite optimization
• A class of problems for which cyclic relaxation converges linearly
• scientific article; zbMATH DE number 5669891 (Why is no real title available?)

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)