Pages that link to "Item:Q4012417"

The following pages link to On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method (Q4012417):

Displaying 16 items.

• On the linear convergence of the alternating direction method of multipliers (Q517301) (← links)
• Local search proximal algorithms as decision dynamics with costs to move (Q632228) (← links)
• An interior point method with Bregman functions for the variational inequality problem with paramonotone operators (Q1290609) (← links)
• Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
• A row-action method for convex programming (Q1330898) (← links)
• A multiprojection algorithm using Bregman projections in a product space (Q1344108) (← links)
• Error bounds in mathematical programming (Q1365060) (← links)
• An interior point method for the nonlinear complementarity problem (Q1369440) (← links)
• Approximation of linear programs by Bregman's \(D_F\) projections (Q1584816) (← links)
• Primal-dual row-action method for convex programming (Q1904955) (← links)
• On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity (Q2322369) (← links)
• A primal-dual iterative algorithm for a maximum likelihood estimation problem (Q2563617) (← links)
• Bregman circumcenters: monotonicity and forward weak convergence (Q2679003) (← links)
• Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization (Q4351184) (← links)
• On the linear convergence of a Bregman proximal point algorithm (Q5088831) (← links)
• Excessive Gap Technique in Nonsmooth Convex Minimization (Q5317557) (← links)