A generalized subgradient method with relaxation step
type: Item
instance of: scholarly article
title: A generalized subgradient method with relaxation step
zbMATH Open document ID: 0846.90096
DOI: 10.1007/BF01585999
author: U. Brännlund
published in: Mathematical Programming. Series A. Series B
publication date: 1996-09-30T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 883907
zbMATH Keywords: projection methods
zbMATH Keywords: generalized subgradient algorithm
zbMATH Keywords: relaxation step
zbMATH Keywords: linear convergence rate
MaRDI profile type: Publication
cites work: The Relaxation Method for Linear Inequalities
cites work: A descent proximal level bundle method for convex nondifferentiable optimization
cites work: Q4133397
cites work: Convergence of a generalized subgradient method for nondifferentiable convex optimization
cites work: An aggregate subgradient method for nonsmooth convex minimization
cites work: Methods of descent for nondifferentiable optimization
cites work: New variants of bundle methods
cites work: Q3738922
cites work: Minimization of unsmooth functionals
cites work: Fractional Programming. I, Duality
cites work: Q5187067
full work available at URL: https://doi.org/10.1007/bf01585999
OpenAlex ID: W2026722928
description: scientific article; zbMATH DE number 883907