A relaxed version of Bregman's method for convex programming
From MaRDI portal
A new type of relaxation for Bregman's method, an iterative primal-dual algorithm for linearly constrained convex programming, is presented. It is shown that the new relaxation procedure generalizes the usual concept of relaxation and preserves the convergence properties of Bregman's algorithm for a suitable choice of the relaxation parameters. For convergence, Bregman's method requires that the objective function satisfy certain conditions. A sufficient and easily checkable condition for these requirements to hold is also given.
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
- An iterative row-action method for interval convex programming
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- 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?)
- Relaxation methods for image reconstruction
- Row-Action Methods for Huge and Sparse Systems and Their Applications
Cited in
(53)- Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations
- On some optimization techniques in image reconstruction from projections
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- Relaxation methods for strictly convex regularizations of piecewise linear programs
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- On the convergence of the coordinate descent method for convex differentiable minimization
- Proximal minimization algorithm with \(D\)-functions
- A new smoothing-regularization approach for a maximum-likelihood estimation problem
- Data parallel computing for network-structured optimization problems
- A row-action method for convex programming
- A multiprojection algorithm using Bregman projections in a product space
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
- An interior point method for the nonlinear complementarity problem
- On some properties of generalized proximal point methods for variational inequalities
- Approximation of linear programs by Bregman's \(D_F\) projections
- Some properties of generalized proximal point methods for quadratic and linear programming
- The relaxation method for certain type of pseudoconvex programming problems
- Primal-dual row-action method for convex programming
- Bregman proximal relaxation of large-scale 0-1 problems
- Bregman type regularization of variational inequalities with Mosco approximation of the constraint set
- A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption
- A simple convergence analysis of Bregman proximal gradient algorithm
- A relaxed extragradient-like method for a class of constrained optimization problem
- A primal-dual iterative algorithm for a maximum likelihood estimation problem
- Dykstras algorithm with bregman projections: A convergence proof
- Generalized proximal point algorithms for multiobjective optimization problems
- Dual averaging with adaptive random projection for solving evolving distributed optimization problems
- On perturbed steepest descent methods with inexact line search for bilevel convex optimization
- A new duality theory for mathematical programming
- From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation
- On Block-Iterative Entropy Maximization
- On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
- Asymptotically optimal row-action methods for generalized least squares problems
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
- Newton-type Methods with Generalized Distances For Constrained Optimization
- Re-examination of Bregman functions and new properties of their divergences
- PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
- Interval underrelaxed bregman's method with an application
- Convergence properties of relaxation algorithms
- Excessive Gap Technique in Nonsmooth Convex Minimization
- An algorithm for maximum entropy image reconstruction from noisy data
- Relaxed steepest descent and Cauchy-Barzilai-Borwein method
- On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra
- Proximal point method with Bregman regularization for multiobjective optimization problems on Hadamard manifolds
- Inexact proximal point method with a Bregman regularization for quasiconvex multiobjective optimization problems via limiting subdifferentials
- On a generalized proximal point method for solving equilibrium problems in Banach spaces
- The symmetry coefficient of positively homogeneous functions
- Self-concordant smoothing in proximal quasi-Newton algorithms for large-scale convex composite optimization
- Optimization of Burg's entropy over linear constraints
- The primal-dual algorithm as a constraint-set-manipulation device
- Some new multiplicative algorithms for image reconstruction from projections
- Proximal-like algorithm using the quasi D-function for convex second-order cone programming
- Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces
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)
