Discretization in semi-infinite programming: The rate of approximation

G.J. Still

Research output: Book/ReportReportOther research output

28 Downloads (Pure)

Abstract

The discretization approach for solving semi-infinite optimization problems is considered. We are interested in the rate of the approximation error between the solution of the semi-infinite problem and the solution of the discretized program depending on the discretization mesh-size $d$. It will be shown how this rate depends on whether the minimizer is strict of order one or two and on whether the discretization includes boundary points of the index set in a consistent way. This is done for common and for generalized semi-infinite problems.
Original languageEnglish
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Publication statusPublished - 2001

Publication series

NameMemorandum
PublisherDepartment of Applied Mathematics, University of Twente
No.1565
ISSN (Print)0169-2690

Keywords

  • MSC-90C30
  • MSC-90C34
  • IR-65752
  • MSC-65K05
  • EWI-3385

Fingerprint Dive into the research topics of 'Discretization in semi-infinite programming: The rate of approximation'. Together they form a unique fingerprint.

  • Cite this

    Still, G. J. (2001). Discretization in semi-infinite programming: The rate of approximation. (Memorandum; No. 1565). Enschede: University of Twente, Department of Applied Mathematics.