A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes
From MaRDI portal
Publication:5013585
Recommendations
- A unified analysis of a class of proximal bundle methods for solving hybrid convex composite optimization problems
- Composite proximal bundle method
- A single cut proximal bundle method for stochastic convex composite optimization
- Optimal Convergence Rates for the Proximal Bundle Method
- A note on the (accelerated) proximal gradient method for composite convex optimization
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3559294 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 3619637 (Why is no real title available?)
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A nonmonotone proximal bundle method with (potentially) continuous step decisions
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Catalyst acceleration for first-order convex optimization: from theory to practice
- Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
- Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems
- Convex optimization algorithms
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Descentwise inexact proximal algorithms for smooth optimization
- Efficiency of proximal bundle methods
- Error bounds for proximal point subproblems and associated inexact proximal point algorithms
- First-order methods in optimization
- Generalized Bundle Methods
- Incremental bundle methods using upper models
- Lectures on convex optimization
- Monotone Operators and the Proximal Point Algorithm
- New Proximal Point Algorithms for Convex Minimization
- New variants of bundle methods
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Nonlinear optimization.
- On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
- Probabilistic optimization via approximate \(p\)-efficient points and bundle methods
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- Rate of convergence of the bundle method
Cited in
(6)- A unified analysis of a class of proximal bundle methods for solving hybrid convex composite optimization problems
- Optimal Convergence Rates for the Proximal Bundle Method
- Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization
- A single cut proximal bundle method for stochastic convex composite optimization
- A proximal bundle variant with optimal iteration-complexity for a large range of prox stepsizes
- A nonmonotone proximal bundle method with (potentially) continuous step decisions
This page was built for publication: A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013585)
