Implementation of an inexact approach to solving linear semi-infinite programming problems

DOI10.1016/0377-0427(94)00051-2zbMath0840.65057OpenAlexW2014044475MaRDI QIDQ1903653

Soon-Yi Wu, Chih-Jen Lin, Eugene K. Yang, Shu-Cherng Fang

Publication date: 1 February 1996

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(94)00051-2

zbMATH Keywords

linear programmingnumerical resultsrobustnesscomputational efficiencysemi-infinite programmingentropy optimizationinexact approach

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Semi-infinite programming (90C34)

Related Items (4)

Relaxation methods for solving linear inequality systems: converging results ⋮ A relaxation method for solving systems with infinitely many linear inequalities ⋮ Rate of convergence of a class of numerical methods solving linear inequality systems ⋮ Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints

Uses Software

• MINOS

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• An interior point algorithm for semi-infinite linear programming
• On affine scaling and semi-infinite programming
• Curved search methods for unconstrained optimization
• An inexact approach to solving linear semi-infinite programming problems
• Entropy in linear programs
• An unconstrained convex programming view of linear programming
• On Linear Semi-Infinite Programming Problems: An Algorithm
• A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems
• Numerical treatment of a class of semi‐infinite programming problems
• Linear programming with entropic perturbation

This page was built for publication: Implementation of an inexact approach to solving linear semi-infinite programming problems