Interval underrelaxed bregman's method with an application

DOI10.1080/02331939508844144zbMath0839.90091OpenAlexW1963734686MaRDI QIDQ4859833

Alfredo Noel Iusem, Stavros A. Zenios

Publication date: 7 January 1996

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

entropy functionalinterval constraintsgeneralized multicommodity network flowunderrelaxed Bregman's method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Convex programming (90C25) Deterministic network models in operations research (90B10)

Related Items

A parallel relaxation method for quadratic programming problems with interval constraints

Cites Work

• Unnamed Item
• 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
• Proximal minimization algorithm with \(D\)-functions
• Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs
• A primal-dual iterative algorithm for a maximum likelihood estimation problem
• A Simultaneous Iterative Method for Computing Projections on Polyhedra
• Extensions of Hildreth’s Row-Action Method for Quadratic Programming
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• On the Fine-Grain Decomposition of Multicommodity Transportation Problems
• Massively Parallel Algorithms for Singly Constrained Convex Programs