A descent method with linear programming subproblems for nondifferentiable convex optimization
type: Item
instance of: scholarly article
title: A descent method with linear programming subproblems for nondifferentiable convex optimization
zbMATH Open document ID: 0855.90101
DOI: 10.1007/BF01592242
author: Sehun Kim
author: Kun-Nyeong Chang
author: Jun-Yeon Lee
published in: Mathematical Programming. Series A. Series B
publication date: 1996-10-13T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 49J52
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 934382
zbMATH Keywords: proximal-type descent methods
zbMATH Keywords: direction-finding subproblem
zbMATH Keywords: nondifferentiable convex optimization
MaRDI profile type: Publication
cites work: Numerical methods for nondifferentiable convex optimization
cites work: A descent algorithm for nonsmooth convex optimization
cites work: A bundle type approach to the unconstrained minimization of convex nonsmooth functions
cites work: Convergence of a generalized subgradient method for nondifferentiable convex optimization
cites work: Variable target value subgradient method
cites work: An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization
cites work: Proximity control in bundle methods for convex nondifferentiable minimization
cites work: Q4182272
cites work: A method of solution for quadratic programs
cites work: A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
cites work: Minimization of unsmooth functionals
cites work: Convex Analysis
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Q5593890
cites work: Q5187067
cites work: Q4146571
full work available at URL: https://doi.org/10.1007/bf01592242
OpenAlex ID: W1976285162
description: scientific article; zbMATH DE number 934382