Pages that link to "Item:Q1067977"

The following pages link to A relaxed version of Bregman's method for convex programming (Q1067977):

Displaying 33 items.

• Dual averaging with adaptive random projection for solving evolving distributed optimization problems (Q306393) (← links)
• An algorithm for maximum entropy image reconstruction from noisy data (Q582945) (← links)
• On a generalized proximal point method for solving equilibrium problems in Banach spaces (Q714471) (← links)
• Optimization of Burg's entropy over linear constraints (Q756379) (← links)
• The primal-dual algorithm as a constraint-set-manipulation device (Q811396) (← links)
• Some new multiplicative algorithms for image reconstruction from projections (Q915376) (← links)
• Proximal-like algorithm using the quasi D-function for convex second-order cone programming (Q937140) (← links)
• Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces (Q971618) (← links)
• Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations (Q1084834) (← links)
• On some optimization techniques in image reconstruction from projections (Q1109546) (← links)
• Parallel application of block-iterative methods in medical imaging and radiation therapy (Q1111951) (← links)
• An interior point method with Bregman functions for the variational inequality problem with paramonotone operators (Q1290609) (← links)
• On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135) (← links)
• Proximal minimization algorithm with \(D\)-functions (Q1321192) (← links)
• A new smoothing-regularization approach for a maximum-likelihood estimation problem (Q1322715) (← links)
• Data parallel computing for network-structured optimization problems (Q1328430) (← links)
• A row-action method for convex programming (Q1330898) (← links)
• A multiprojection algorithm using Bregman projections in a product space (Q1344108) (← links)
• Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces (Q1364216) (← links)
• An interior point method for the nonlinear complementarity problem (Q1369440) (← links)
• On some properties of generalized proximal point methods for variational inequalities (Q1389080) (← links)
• Approximation of linear programs by Bregman's \(D_F\) projections (Q1584816) (← links)
• Some properties of generalized proximal point methods for quadratic and linear programming (Q1896573) (← links)
• Primal-dual row-action method for convex programming (Q1904955) (← links)
• Bregman type regularization of variational inequalities with Mosco approximation of the constraint set (Q2114843) (← links)
• A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption (Q2322358) (← links)
• A simple convergence analysis of Bregman proximal gradient algorithm (Q2419573) (← links)
• A primal-dual iterative algorithm for a maximum likelihood estimation problem (Q2563617) (← links)
• Dykstras algorithm with bregman projections: A convergence proof (Q2709445) (← links)
• Generalized proximal point algorithms for multiobjective optimization problems (Q3006689) (← links)
• On perturbed steepest descent methods with inexact line search for bilevel convex optimization (Q3112499) (← links)
• A new duality theory for mathematical programming (Q3112511) (← links)
• On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra (Q6191673) (← links)