Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization
From MaRDI portal
Publication:2023658
DOI10.1007/s10589-020-00208-9zbMath1466.90070OpenAlexW3038848911MaRDI QIDQ2023658
Yunmei Chen, Wei Zhang, Xiaojing Ye
Publication date: 3 May 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-020-00208-9
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Nonlinear total variation based noise removal algorithms
- Smooth minimization of non-smooth functions
- Level bundle methods for constrained convex optimization with various oracles
- Level bundle-like algorithms for convex optimization
- Proximity control in bundle methods for convex nondifferentiable minimization
- A bundle-filter method for nonsmooth convex constrained optimization
- Introductory lectures on convex optimization. A basic course.
- Bundle-type methods for inexact data
- Target radius methods for nonsmooth convex optimization
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- New variants of bundle methods
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Risk-Averse Optimization in Two-Stage Stochastic Models: Computational Aspects and a Study
- Sparsity and Smoothness Via the Fused Lasso
- Accelerated bundle level methods with inexact oracle
This page was built for publication: Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization
