A relaxed version of Bregman's method for convex programming
From MaRDI portal
Recommendations
- On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
- Relaxation methods for strictly convex regularizations of piecewise linear programs
- Block-Iterative Algorithms with Underrelaxed Bregman Projections
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Iterative linear programming solution of convex programs
Cites work
- scientific article; zbMATH DE number 3606256 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- An iterative row-action method for interval convex programming
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- Relaxation methods for image reconstruction
- Row-Action Methods for Huge and Sparse Systems and Their Applications
Cited in
(48)- Some new multiplicative algorithms for image reconstruction from projections
- A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
- A multiprojection algorithm using Bregman projections in a product space
- Dykstras algorithm with bregman projections: A convergence proof
- Bregman type regularization of variational inequalities with Mosco approximation of the constraint set
- Asymptotically optimal row-action methods for generalized least squares problems
- A new duality theory for mathematical programming
- Bregman proximal relaxation of large-scale 0-1 problems
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
- On a generalized proximal point method for solving equilibrium problems in Banach spaces
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
- The primal-dual algorithm as a constraint-set-manipulation device
- An algorithm for maximum entropy image reconstruction from noisy data
- Dual averaging with adaptive random projection for solving evolving distributed optimization problems
- On the convergence of the coordinate descent method for convex differentiable minimization
- The relaxation method for certain type of pseudoconvex programming problems
- A relaxed extragradient-like method for a class of constrained optimization problem
- Newton-type Methods with Generalized Distances For Constrained Optimization
- Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces
- Proximal minimization algorithm with \(D\)-functions
- Re-examination of Bregman functions and new properties of their divergences
- On perturbed steepest descent methods with inexact line search for bilevel convex optimization
- On some properties of generalized proximal point methods for variational inequalities
- On Block-Iterative Entropy Maximization
- On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra
- Convergence properties of relaxation algorithms
- Some properties of generalized proximal point methods for quadratic and linear programming
- Optimization of Burg's entropy over linear constraints
- Relaxed steepest descent and Cauchy-Barzilai-Borwein method
- A new smoothing-regularization approach for a maximum-likelihood estimation problem
- Data parallel computing for network-structured optimization problems
- A simple convergence analysis of Bregman proximal gradient algorithm
- A row-action method for convex programming
- On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
- Primal-dual row-action method for convex programming
- From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation
- An interior point method for the nonlinear complementarity problem
- Excessive Gap Technique in Nonsmooth Convex Minimization
- Proximal-like algorithm using the quasi D-function for convex second-order cone programming
- Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations
- Generalized proximal point algorithms for multiobjective optimization problems
- A primal-dual iterative algorithm for a maximum likelihood estimation problem
- Interval underrelaxed bregman's method with an application
- Approximation of linear programs by Bregman's \(D_F\) projections
- On some optimization techniques in image reconstruction from projections
- Parallel application of block-iterative methods in medical imaging and radiation therapy
This page was built for publication: A relaxed version of Bregman's method for convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1067977)
