Proximal interior point method for convex semi-infinite programming
The authors propose an interior point type method for the solution of ill-posed convex semi-infinite programming problems. In fact, in each step of the algorithm a logarithmic barrier approach is used to solve a finite optimization problem which stems from a discretization of the original, infinite index set. Due to the ill-posedness of the original problem, the logarithmic barrier functions do not have to be strictly convex. Hence, a multi-step prox term is added to the barrier function. When the regularized barrier problem is solved with sufficient accuracy, the discretization of the index set, the barrier parameter, the prox parameter, and the accuracy parameter are updated for the next step. A special deleting rule allows one to drop a large part of the constraints in the discretized problem. Under mild assumptions the authors show that for an appropriate adjustment of the four mentioned parameters, the proposed method is well defined, convergent to a solution of the original problem and stable with respect to data perturbations. A number of numerical examples illustrate the performance of the algorithm.
- Proximal interior point approach in convex programming (ill-posed problems)*†
- A logarithmic barrier approach and its regularization applied to convex semi-finite programming problems.
- A regularized penalty method for solving convex semi-infinite programs
- scientific article; zbMATH DE number 227711
- Path-following proximal approach for solving ill-posed convex semi-infinite programming problems
- An equilibrium characterization of the term structure
- An interior point algorithm for semi-infinite linear programming
- An interior-point method for semi-infinite programming problems
- Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming
- Critical sets in parametric optimization
- Discretization methods for the solution of semi-infinite programming problems
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 587626 (Why is no real title available?)
- scientific article; zbMATH DE number 683483 (Why is no real title available?)
- Interior-point algorithms for semi-infinite programming
- On affine scaling and semi-infinite programming
- Proximal interior point approach in convex programming (ill-posed problems)*†
- Proximal methods in view of interior-point strategies
- Proximal point approach and approximation of variational inequalities
- Semi-Infinite Programming: Theory, Methods, and Applications
- Proximal methods in view of interior-point strategies
- Linear semi-infinite programming theory: an updated survey
- Path-following proximal approach for solving ill-posed convex semi-infinite programming problems
- An outer approximation algorithm for equilibrium problems in Hilbert spaces
- A logarithmic barrier approach and its regularization applied to convex semi-finite programming problems.
- A ladder method for linear semi-infinite programming
- scientific article; zbMATH DE number 108319 (Why is no real title available?)
- Proximal interior point approach in convex programming (ill-posed problems)*†
- A solution method for combined semi-infinite and semi-definite programming
- scientific article; zbMATH DE number 841067 (Why is no real title available?)
- Numerical treatment of an asset price model with non-stochastic uncertainty. (With comments and rejoinder).
- Proximal point method and elliptic regularization
- Smoothing by mollifiers. I: Semi-infinite optimization
This page was built for publication: Proximal interior point method for convex semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2778680)