Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization
type: Item
instance of: scholarly article
title: Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization
zbMATH Open document ID: 1466.90070
author: Yunmei Chen
author: Xiaojing Ye
author: Wei Zhang
published in: Computational Optimization and Applications
publication date: 2021-05-03T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 7342385
zbMATH Keywords: convex optimization
zbMATH Keywords: acceleration
zbMATH Keywords: bundle method
zbMATH Keywords: functional constrained optimization
MaRDI profile type: Publication
full work available at URL: s10589-020-00208-9
OpenAlex ID: W3038848911
cites work: Q3151174
cites work: A first-order primal-dual algorithm for convex problems with applications to imaging
cites work: Accelerated bundle level methods with inexact oracle
cites work: Fast bundle-level methods for unconstrained and ball-constrained convex optimization
cites work: Level bundle-like algorithms for convex optimization
cites work: Target radius methods for nonsmooth convex optimization
cites work: Bundle-type methods for inexact data
cites work: Risk-Averse Optimization in Two-Stage Stochastic Models: Computational Aspects and a Study
cites work: A bundle-filter method for nonsmooth convex constrained optimization
cites work: Proximity control in bundle methods for convex nondifferentiable minimization
cites work: Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
cites work: Tensor Decompositions and Applications
cites work: Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
cites work: New variants of bundle methods
cites work: Q5396698
cites work: Q3967358
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Smooth minimization of non-smooth functions
cites work: Nonlinear total variation based noise removal algorithms
cites work: Sparsity and Smoothness Via the Fused Lasso
cites work: Level bundle methods for constrained convex optimization with various oracles
DOI: 10.1007/S10589-020-00208-9
description: scientific article; zbMATH DE number 7342385