Approximation of linear programs by Bregman's \(D_F\) projections
DOI10.1016/S0377-2217(99)00281-7zbMath0970.90049OpenAlexW2053477176MaRDI QIDQ1584816
Gökhan Izbirak, Emil Klafszky, Levente Mályusz, Peter Kas
Publication date: 5 November 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00281-7
linear programming\(\varepsilon\)-optimal solutionsBregman's \(D_F\) projectionsconvergence of row-action methodssymmetric primal-dual pairYoung programming
Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiplicative iterative algorithms for convex programming
- Optimization of Burg's entropy over linear constraints
- A relaxed version of Bregman's method for convex programming
- An iterative row-action method for interval convex programming
- Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
- I-divergence geometry of probability distributions and minimization problems
- On the dual of linear inverse problems
- Proximal minimization algorithm with \(D\)-functions
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- On the duality of the mixed entropy programming
- On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Convergence of Proximal-Like Algorithms
This page was built for publication: Approximation of linear programs by Bregman's \(D_F\) projections
