A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem

DOI10.1007/s10479-016-2135-2zbMath1382.90107OpenAlexW2283100802MaRDI QIDQ1686516

Alberto Ferrer, Enrique González-Gutiérrez, Miguel Angel Goberna, Maxim Ivanov Todorov

Publication date: 15 December 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/132581

zbMATH Keywords

relaxation methodcutting angle methodfeasibility problemlinear semi-infinite systems

Mathematics Subject Classification ID

Linear programming (90C05) Semi-infinite programming (90C34) Numerical methods of relaxation type (49M20)

Related Items

Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints, Recent contributions to linear semi-infinite optimization, Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality, Recent contributions to linear semi-infinite optimization: an update, Selected applications of linear semi-infinite systems theory

Uses Software

• RPSALG

Cites Work

• A relaxation method for solving systems with infinitely many linear inequalities
• Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
• Bounded lower subdifferentiability optimization techniques: applications
• Newton's method for convex programming and Tschebyscheff approximation
• Robust solutions of uncertain linear programs
• Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
• Relaxation methods for solving linear inequality systems: converging results
• A cyclic Douglas-Rachford iteration scheme
• Comparative study of RPSALG algorithm for convex semi-infinite programming
• Robust solutions to multi-objective linear programs with uncertain data
• Post-Optimal Analysis in Linear Semi-Infinite Optimization
• Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
• On Chubanov's Method for Linear Programming
• Rate of convergence of a class of numerical methods solving linear inequality systems
• Cutting angle method – a tool for constrained global optimization
• The Cutting-Plane Method for Solving Convex Programs
• Geometry and combinatorics of the cutting angle method
• The Relaxation Method for Linear Inequalities
• Introduction to global optimization.
• Global minimization of increasing positively homogeneous functions over the unit simplex
• Abstract convexity and global optimization
• Benchmarking optimization software with performance profiles.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item