Target radius methods for nonsmooth convex optimization
type: Item
instance of: scholarly article
title: Target radius methods for nonsmooth convex optimization
zbMATH Open document ID: 1409.90139
author: Welington de Oliveira
published in: Operations Research Letters
publication date: 2019-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C56
zbMATH DE Number: 7027824
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: convex optimization
zbMATH Keywords: bundle methods
MaRDI profile type: Publication
full work available at URL: j.orl.2017.10.010
OpenAlex ID: W2765833198
cites work: Non-Euclidean restricted memory level method for large-scale convex optimization
cites work: A descent proximal level bundle method for convex nondifferentiable optimization
cites work: Level bundle methods for oracles with on-demand accuracy
cites work: Convex proximal bundle methods in depth: a unified analysis for inexact oracles
cites work: A central cutting plane algorithm for the convex programming problem
cites work: Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
cites work: Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
cites work: New variants of bundle methods
cites work: A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
cites work: A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
cites work: A strongly convergent proximal bundle method for convex minimization in Hilbert spaces
DOI: 10.1016/J.ORL.2017.10.010
description: scientific article; zbMATH DE number 7027824