A weighted mirror descent algorithm for nonsmooth convex optimization problem
type: Item
instance of: scholarly article
title: A weighted mirror descent algorithm for nonsmooth convex optimization problem
zbMATH Open document ID: 1348.90464
author: Duy V. N. Luong
author: Panos Parpas
author: Daniel Rueckert
author: Berç Rustem
published in: Journal of Optimization Theory and Applications
publication date: 2016-10-20T00:00:00Z
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6641396
zbMATH Keywords: subgradient projection
zbMATH Keywords: weighted distance
zbMATH Keywords: mirror descent
zbMATH Keywords: Markov random fields
MaRDI profile type: Publication
full work available at URL: s10957-016-0963-5
OpenAlex ID: W2444301330
Wikidata QID: Q59474421
cites work: Q3967358
cites work: Ergodic, primal convergence in dual subgradient schemes for convex programming
cites work: The ordered subsets mirror descent optimization method with applications to tomography
cites work: Mirror descent and nonlinear projected subgradient methods for convex optimization.
cites work: Proximal Minimization Methods with Generalized Bregman Functions
cites work: Markov Random Field Modeling in Image Analysis
cites work: Proximal minimization algorithm with \(D\)-functions
cites work: Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
cites work: Q4821526
cites work: An analysis of convex relaxations for MAP estimation of discrete MRFs
cites work: Q3151174
DBLP publication ID: journals/jota/LuongPRR16
DOI: 10.1007/S10957-016-0963-5
description: scientific article; zbMATH DE number 6641396