A relaxation method for solving systems with infinitely many linear inequalities
From MaRDI portal
Publication:691462
DOI10.1007/s11590-010-0244-4zbMath1258.90092OpenAlexW1973599773MaRDI QIDQ691462
Maxim Ivanov Todorov, Enrique González-Gutiérrez
Publication date: 30 November 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-010-0244-4
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proper efficiency in vector infinite programming problems
- Motzkin decomposition of closed convex sets
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- 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
- On general infinite dimensional complementarity problems
- Infinite inequality systems and cardinal revelations
- Spectral localization of operators in Banach spaces
- 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: A relaxation method for solving systems with infinitely many linear inequalities
