Relaxation methods for solving linear inequality systems: converging results
type: Item
instance of: scholarly article
title: Relaxation methods for solving linear inequality systems: converging results
zbMATH Open document ID: 1258.49043
author: L. Hernández Rebollar
author: Enrique González-Gutiérrez
author: Maxim Ivanov Todorov
published in: Top
publication date: 2013-02-26T00:00:00Z
full work available at URL: http://ddd.uab.cat/record/76056
Mathematics Subject Classification ID: 49M20
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 65K15
Mathematics Subject Classification ID: 90C34
zbMATH DE Number: 6139262
zbMATH Keywords: infinite inequality systems
zbMATH Keywords: feasibility problem
zbMATH Keywords: relaxation method
MaRDI profile type: Publication
OpenAlex ID: W2127326301
cites work: The Relaxation Method for Linear Inequalities
cites work: Proper efficiency in vector infinite programming problems
cites work: Q4718793
cites work: A projected lagrangian algorithm for semi-infinite programming
cites work: An inexact approach to solving linear semi-infinite programming problems
cites work: Solving variational inequalities defined on a domain with infinitely many linear constraints
cites work: Linear semi-infinite programming theory: an updated survey
cites work: On linear inequality systems with smooth coefficients
cites work: Separating the solution sets of analytical and polynomial systems
cites work: Under and over projection methods for solving linear inequality systems
cites work: Q3325518
cites work: Q4840105
cites work: Q4191529
cites work: On the numerical treatment of linearly constrained semi-infinite optimization problems
cites work: Implementation of an inexact approach to solving linear semi-infinite programming problems
cites work: On general infinite dimensional complementarity problems
DOI: 10.1007/S11750-011-0234-4
description: scientific article; zbMATH DE number 6139262