Relaxation methods for solving linear inequality systems: converging results

DOI10.1007/s11750-011-0234-4zbMath1258.49043OpenAlexW2127326301MaRDI QIDQ1939079

L. Hernández Rebollar, Maxim Ivanov Todorov, Enrique González-Gutiérrez

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

relaxation methodfeasibility probleminfinite inequality systems

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Semi-infinite programming (90C34) Numerical methods of relaxation type (49M20) Numerical methods for variational inequalities and related problems (65K15)

Related Items (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Separating the solution sets of analytical and polynomial systems
• Proper efficiency in vector infinite programming problems
• On linear inequality systems with smooth coefficients
• Linear semi-infinite programming theory: an updated survey
• Implementation of an inexact approach to solving linear semi-infinite programming problems
• On the numerical treatment of linearly constrained semi-infinite optimization problems
• On general infinite dimensional complementarity problems
• Solving variational inequalities defined on a domain with infinitely many linear constraints
• A projected lagrangian algorithm for semi-infinite programming
• An inexact approach to solving linear semi-infinite programming problems
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

This page was built for publication: Relaxation methods for solving linear inequality systems: converging results