Approximation of linear programs by Bregman's D_F projections

DOI10.1016/S0377-2217(99)00281-7MaRDI QIDQ1584816zbMATH OpenOpenAlexFDO

Authors Emil Klafszky, Levente Mályusz, Gökhan Izbirak, 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

zbMATH Keywords

linear programming\(\varepsilon\)-optimal solutionsBregman's \(D_F\) projectionsconvergence of row-action methodssymmetric primal-dual pairYoung programming

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Convex programs based on the Young inequality and its relation to linear programming
• Dual convergence of the proximal point method with Bregman distances for linear programming
• An alternating projections algorithm for solving linear programs
• Projection algorithms for linear programming
• Unconstrained convex programming approach to linear programming

Cites work

• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• scientific article; zbMATH DE number 1332103 (Why is no real title available?)
• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 3241743 (Why is no real title available?)
• scientific article; zbMATH DE number 3296905 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• scientific article; zbMATH DE number 4184947 (Why is no real title available?)
• A relaxed version of Bregman's method for convex programming
• An iterative row-action method for interval convex programming
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Convergence of Proximal-Like Algorithms
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• I-divergence geometry of probability distributions and minimization problems
• Multiplicative iterative algorithms for convex programming
• On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
• On the dual of linear inverse problems
• On the duality of the mixed entropy programming
• Optimization of Burg's entropy over linear constraints
• Proximal minimization algorithm with \(D\)-functions
• Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems

This page was built for publication: Approximation of linear programs by Bregman's \(D_F\) projections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584816)