An improved subgradient method for constrained nondifferentiable optimization
type: Item
instance of: scholarly article
title: An improved subgradient method for constrained nondifferentiable optimization
zbMATH Open document ID: 0792.90071
DOI: 10.1016/0167-6377(93)90020-H
author: Sehun Kim
author: Bong-sik Um
published in: Operations Research Letters
publication date: 1994-07-25T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49J52
zbMATH DE Number: 527411
zbMATH Keywords: Polyak's subgradient method
zbMATH Keywords: constrained nondifferentiable optimization
zbMATH Keywords: projection
MaRDI profile type: Publication
cites work: Q4133397
cites work: Validation of subgradient optimization
cites work: Convergence of a generalized subgradient method for nondifferentiable convex optimization
cites work: Variable target value subgradient method
cites work: Two-direction subgradient method for non-differentiable optimization problems
cites work: Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints
cites work: Minimization of unsmooth functionals
cites work: Q5187067
cites work: Q4105489
full work available at URL: 0167-6377(93)90020-h
OpenAlex ID: W2023925658
Recommended article: Q3387547
Recommended article: An interior-point based subgradient method for nondifferentiable convex optimization
Recommended article: Subgradient method for nonconvex nonsmooth optimization
Recommended article: Q4324539
Recommended article: Q5702605
Recommended article: An inexact modified subgradient algorithm for nonconvex optimization
Recommended article: An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
Recommended article: Incremental subgradient methods for nondifferentiable optimization
Recommended article: Convergence of a generalized subgradient method for nondifferentiable convex optimization
Recommended article: Q4010181
description: scientific article; zbMATH DE number 527411