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

Cites Work

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

Cited In (8)

A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
A modified explicit algorithm based relaxation strategy for solving semi-infinite programming problems
Selected applications of linear semi-infinite systems theory
Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality
Recent contributions to linear semi-infinite optimization
Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints
Recent contributions to linear semi-infinite optimization: an update
A comparative study of several semi-infinite nonlinear programming algorithms

Uses Software

RPSALG

This page was built for publication: A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686516)