On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
From MaRDI portal
Publication:4012417
DOI10.1137/0801025zbMath0753.90051OpenAlexW2032330602MaRDI QIDQ4012417
Publication date: 27 September 1992
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0801025
Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A row-action method for convex programming ⋮ A multiprojection algorithm using Bregman projections in a product space ⋮ Primal-dual row-action method for convex programming ⋮ Error bounds in mathematical programming ⋮ An interior point method for the nonlinear complementarity problem ⋮ On the linear convergence of a Bregman proximal point algorithm ⋮ Local search proximal algorithms as decision dynamics with costs to move ⋮ Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization ⋮ On the linear convergence of the alternating direction method of multipliers ⋮ On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity ⋮ An interior point method with Bregman functions for the variational inequality problem with paramonotone operators ⋮ A primal-dual iterative algorithm for a maximum likelihood estimation problem ⋮ Approximation of linear programs by Bregman's \(D_F\) projections ⋮ Error bounds and convergence analysis of feasible descent methods: A general approach
