A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
From MaRDI portal
Publication:1686516
Recommendations
- Relaxation methods for solving linear inequality systems: converging results
- A modified explicit algorithm based relaxation strategy for solving semi-infinite programming problems
- A relaxation method for solving systems with infinitely many linear inequalities
- Rate of convergence of a class of numerical methods solving linear inequality systems
- Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
Cites work
- scientific article; zbMATH DE number 3630144 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 1997540 (Why is no real title available?)
- scientific article; zbMATH DE number 776085 (Why is no real title available?)
- A cyclic Douglas-Rachford iteration scheme
- A relaxation method for solving systems with infinitely many linear inequalities
- A review of applications of the cutting angle methods
- Abstract convexity and global optimization
- Benchmarking optimization software with performance profiles.
- Bounded lower subdifferentiability optimization techniques: applications
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- Cutting angle method – a tool for constrained global optimization
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- Extended cutting angle method of global optimization
- From linear to convex systems: consistency, Farkas' lemma and applications
- Geometry and combinatorics of the cutting angle method
- Global minimization of increasing positively homogeneous functions over the unit simplex
- Introduction to global optimization.
- Modified versions of the cutting angle method.
- Newton's method for convex programming and Tschebyscheff approximation
- On Chubanov's Method for Linear Programming
- Post-Optimal Analysis in Linear Semi-Infinite Optimization
- Rate of convergence of a class of numerical methods solving linear inequality systems
- Relaxation methods for solving linear inequality systems: converging results
- Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
- Robust optimization
- Robust solutions of multiobjective linear semi-infinite programs under constraint data uncertainty
- Robust solutions of uncertain linear programs
- Robust solutions to multi-objective linear programs with uncertain data
- The Cutting-Plane Method for Solving Convex Programs
- The Relaxation Method for Linear Inequalities
- Under and over projection methods for solving linear inequality systems
Cited in
(9)- A modified explicit algorithm based relaxation strategy for solving semi-infinite programming problems
- 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 Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Selected applications of linear semi-infinite systems theory
- Recent contributions to linear semi-infinite optimization
- Relaxation methods for solving linear inequality systems: converging results
- A comparative study of several semi-infinite nonlinear programming algorithms
- Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality
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)
