No label defined (Q4023787)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 108319
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 108319 |
Statements
23 January 1993
0 references
interior-point-method
0 references
analytic centers
0 references
linear semi-infinite programming
0 references
barrier method
0 references
\(L_ 1\)-approximation
0 references
Chebychev- approximation
0 references
0.8920611143112183
0 references
0.8173227906227112
0 references
0.8149561285972595
0 references
0.8034139275550842
0 references
0.8016731142997742
0 references
This doctoral dissertation is concerned with the application of the method of analytic centers to linear semi-infinite programming problems of the following type: Minimize \(c^ T x\) on \(\mathbb{R}^ n\) subject to \(a(z)^ T x\leq b(z)\) for all \(z\in Z\), where \(Z\) is a compact subset of \(\mathbb{R}^ n\), \(a: Z\to \mathbb{R}^ n\) and \(b: Z\to \mathbb{R}\) are given continuous functions and \(c\in \mathbb{R}^ n\) a given vector. It is assumed that \(P=\{x\in \mathbb{R}^ n\mid a(z)^ T x\leq b(z)\) for all \(z\in Z\}\) is bounded and has a non-empty interior \(\mathring P\). The method of analytic centers is a special barrier method which is based on a barrier function of the form \[ \varphi(x,\lambda)= -M \ln(\lambda- c^ T x)- \int_ Z\ln(b(z)- a(z)^ T x) dx,\quad x\in\mathring P, \] if \(Z\) is an infinite set and \[ \varphi(x,\lambda)= -M \ln(\lambda-c^ T x)-\sum_{z\in Z}\ln(b(z)- a(z)^ T x),\quad x\in\mathring P, \] if \(Z\) is finite, where \(\lambda>\lambda^*=\min\{c^ T x\mid x\in P\}\) and \(M\in\mathbb{N}\). In the latter case the method of analytic centers has been intensively investigated by Jarre and Sonnevend. In this thesis the author extends their results to the case where \(Z\) is infinite. This extension is not straightforward but requires to make use of different tools in order to follow the same concepts. So, for instance, an appropriate norm in \(\mathbb{R}^ n\) has to be introduced which is different from the one in the finite case. Computational results are given for two examples of one-side \(L_ 1\)- approximation problems and two examples of Chebychev-approximation.
0 references