A relaxed version of Bregman's method for convex programming
From MaRDI portal
Publication:1067977
DOI10.1007/BF00940283zbMath0581.90069OpenAlexW2016611950MaRDI QIDQ1067977
Alvaro Rodolfo de Pierro, Alfredo Noel Iusem
Publication date: 1986
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00940283
relaxationentropy optimizationBregman's methodlarge and sparse matriceslinearly constrained convex programmingiterative primal-dual algorithmnonorthogonal projections
Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)
Related Items (41)
Data parallel computing for network-structured optimization problems ⋮ A row-action method for convex programming ⋮ Asymptotically optimal row-action methods for generalized least squares problems ⋮ Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations ⋮ A multiprojection algorithm using Bregman projections in a product space ⋮ Dual averaging with adaptive random projection for solving evolving distributed optimization problems ⋮ Some properties of generalized proximal point methods for quadratic and linear programming ⋮ Primal-dual row-action method for convex programming ⋮ PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS ⋮ Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces ⋮ On some optimization techniques in image reconstruction from projections ⋮ Parallel application of block-iterative methods in medical imaging and radiation therapy ⋮ An interior point method for the nonlinear complementarity problem ⋮ On some properties of generalized proximal point methods for variational inequalities ⋮ A simple convergence analysis of Bregman proximal gradient algorithm ⋮ On Block-Iterative Entropy Maximization ⋮ Interval underrelaxed bregman's method with an application ⋮ On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra ⋮ Some new multiplicative algorithms for image reconstruction from projections ⋮ Re-examination of Bregman functions and new properties of their divergences ⋮ Dykstras algorithm with bregman projections: A convergence proof ⋮ Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization ⋮ Newton-type Methods with Generalized Distances For Constrained Optimization ⋮ Proximal-like algorithm using the quasi D-function for convex second-order cone programming ⋮ Generalized proximal point algorithms for multiobjective optimization problems ⋮ From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation ⋮ Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces ⋮ On a generalized proximal point method for solving equilibrium problems in Banach spaces ⋮ An algorithm for maximum entropy image reconstruction from noisy data ⋮ Optimization of Burg's entropy over linear constraints ⋮ A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption ⋮ On perturbed steepest descent methods with inexact line search for bilevel convex optimization ⋮ A new duality theory for mathematical programming ⋮ 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 ⋮ The primal-dual algorithm as a constraint-set-manipulation device ⋮ On the convergence of the coordinate descent method for convex differentiable minimization ⋮ Proximal minimization algorithm with \(D\)-functions ⋮ Bregman type regularization of variational inequalities with Mosco approximation of the constraint set ⋮ A new smoothing-regularization approach for a maximum-likelihood estimation problem
Cites Work
This page was built for publication: A relaxed version of Bregman's method for convex programming
