scientific article; zbMATH DE number 108319
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.
- An interior point algorithm for semi-infinite linear programming
- An interior-point method for approximate positive semidefinite completions
- An interior-point method for semi-infinite programming problems
- A perturbation method for solving linear semi-infinite programming problems
- An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs
- A homotopy interior point method for semi-infinite programming problems
- An interior point constraint generation algorithm for semi-infinite optimization with health-care application
- scientific article; zbMATH DE number 4170652 (Why is no real title available?)
- A logarithmic barrier approach and its regularization applied to convex semi-finite programming problems.
- An interior point technique for solving bilevel programming problems
- scientific article; zbMATH DE number 589258 (Why is no real title available?)
- A boundary point method to solve semidefinite programs
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4023787)