Proximal interior point method for convex semi-infinite programming
From MaRDI portal
Recommendations
- 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
Cites work
- 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?)
- 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
- 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
Cited in
(10)- scientific article; zbMATH DE number 108319 (Why is no real title available?)
- Numerical treatment of an asset price model with non-stochastic uncertainty. (With comments and rejoinder).
- A ladder method for linear semi-infinite programming
- Proximal point method and elliptic regularization
- A logarithmic barrier approach and its regularization applied to convex semi-finite programming problems.
- scientific article; zbMATH DE number 841067 (Why is no real title available?)
- Linear semi-infinite programming theory: an updated survey
- A solution method for combined semi-infinite and semi-definite programming
- An outer approximation algorithm for equilibrium problems in Hilbert spaces
- 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)
