An unconstrained convex programming approach to linear semi-infinite programming
Journal
SIAM Journal on Optimization
Journal Volume
8
Journal Issue
2
Pages
443-456
Date Issued
1998
Author(s)
Abstract
In this paper, an unconstrained convex programming dual approach for solving a class of linear semi-infinite programming problems is proposed. Both primal and dual convergence results are established under some basic assumptions. Numerical examples are also included to illustrate this approach.
Type
journal article