Proximal interior point method for convex semi-infinite programming

DOI10.1080/10556780108805813zbMath1099.90593OpenAlexW2077078698MaRDI QIDQ2778680

Rainer Tichatschke, Alexander Kaplan

Publication date: 2001

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780108805813

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51) Semi-infinite programming (90C34)

Related Items (7)

Proximal point method and elliptic regularization ⋮ A solution method for combined semi-infinite and semi-definite programming ⋮ A ladder method for linear semi-infinite programming ⋮ An outer approximation algorithm for equilibrium problems in Hilbert spaces ⋮ Smoothing by mollifiers. I: Semi-infinite optimization ⋮ Numerical treatment of an asset price model with non-stochastic uncertainty. (With comments and rejoinder). ⋮ Linear semi-infinite programming theory: an updated survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An interior point algorithm for semi-infinite linear programming
• On affine scaling and semi-infinite programming
• Proximal methods in view of interior-point strategies
• Discretization methods for the solution of semi-infinite programming problems
• Interior-point algorithms for semi-infinite programming
• An interior-point method for semi-infinite programming problems
• Proximal Point Approach and Approximation of Variational Inequalities
• Semi-Infinite Programming: Theory, Methods, and Applications
• Critical sets in parametric optimization
• Proximal interior point approach in convex programming (ill-posed problems)^*†
• Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming
• An equilibrium characterization of the term structure

This page was built for publication: Proximal interior point method for convex semi-infinite programming