Rate of convergence of a class of numerical methods solving linear inequality systems

DOI10.1080/02331934.2011.611513zbMath1232.65089OpenAlexW2072451226MaRDI QIDQ3112495

No author found.

Publication date: 10 January 2012

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2011.611513

zbMATH Keywords

relaxationlinear semi-infinite systemsfeasible problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (2)

A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem ⋮ Entropy based solid transportation problems with discounted unit costs under fuzzy random environment

Cites Work

• A discretization based smoothing method for solving semi-infinite variational inequalities
• Linear semi-infinite programming theory: an updated survey
• Implementation of an inexact approach to solving linear semi-infinite programming problems
• Regularity modulus of arbitrarily perturbed linear inequality systems
• On general infinite dimensional complementarity problems
• Infinite inequality systems and cardinal revelations
• Solving variational inequalities defined on a domain with infinitely many linear constraints
• Semi-Infinite Programming: Theory, Methods, and Applications
• A projected lagrangian algorithm for 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
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

This page was built for publication: Rate of convergence of a class of numerical methods solving linear inequality systems