Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
type: Item
instance of: scholarly article
title: Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
zbMATH Open document ID: 1352.49032
author: Xiaoqin Hua
author: Nobuo Yamashita
published in: Mathematical Programming. Series A. Series B
publication date: 2016-11-25T00:00:00Z
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6656089
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: block coordinate proximal gradient methods
zbMATH Keywords: linear convergence
zbMATH Keywords: error bounds
describes a project that uses: PDCO
MaRDI profile type: Publication
full work available at URL: s10107-015-0969-z
OpenAlex ID: W2279141731
cites work: Mirror descent and nonlinear projected subgradient methods for convex optimization.
cites work: Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
cites work: Atomic Decomposition by Basis Pursuit
cites work: Q3096171
cites work: A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
cites work: Pathwise coordinate optimization
cites work: On the Solution of Large Quadratic Programming Problems with Bound Constraints
cites work: Q3174129
cites work: Q4435806
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: The Group Lasso for Logistic Regression
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Approximation accuracy, gradient methods, and error bound for structured convex optimization
cites work: Convergence of a block coordinate descent method for nondifferentiable minimization
cites work: A coordinate gradient descent method for nonsmooth separable minimization
cites work: Accelerated block-coordinate relaxation for regularized optimization
cites work: Coordinate descent algorithms for lasso penalized regression
cites work: Model Selection and Estimation in Regression with Grouped Variables
DOI: 10.1007/S10107-015-0969-Z
description: scientific article; zbMATH DE number 6656089