Interval underrelaxed bregman's method with an application
From MaRDI portal
Recommendations
- Publication:5750347
- A relaxed version of Bregman's method for convex programming
- Block-Iterative Algorithms with Underrelaxed Bregman Projections
- Optimization of Burg's entropy over linear constraints
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
Cites work
- A primal-dual iterative algorithm for a maximum likelihood estimation problem
- A relaxed version of Bregman's method for convex programming
- A Simultaneous Iterative Method for Computing Projections on Polyhedra
- An iterative row-action method for interval convex programming
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- scientific article; zbMATH DE number 3856876 (Why is no real title available?)
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- On the Fine-Grain Decomposition of Multicommodity Transportation Problems
- Optimization of Burg's entropy over linear constraints
- Proximal minimization algorithm with \(D\)-functions
- Proximal minimizations with D-functions and the massively parallel solution of linear network programs
- Row-Action Methods for Huge and Sparse Systems and Their Applications
Cited in
(1)
This page was built for publication: Interval underrelaxed bregman's method with an application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4859833)