A multi-step doubly stabilized bundle method for nonsmooth convex optimization
From MaRDI portal
Publication:2177698
DOI10.1016/J.AMC.2020.125154zbMATH Open1474.90346OpenAlexW3008325510MaRDI QIDQ2177698FDOQ2177698
Recommendations
- A doubly stabilized bundle method for nonsmooth convex optimization
- Survey of Bundle Methods for Nonsmooth Optimization
- A hybrid bundle method for nonsmooth convex optimization
- An implementable bundle method for nonsmooth convex optimization
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
Cites work
- 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 3894826 (Why is no real title available?)
- A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A doubly stabilized bundle method for nonsmooth convex optimization
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A proximal-projection partial bundle method for convex constrained minimax problems
- A simple version of bundle method with linear programming
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Accelerated gradient sliding for structured convex optimization
- Accelerated schemes for a class of variational inequalities
- An accelerated linearized alternating direction method of multipliers
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
- An optimal method for stochastic composite optimization
- Benchmarking optimization software with performance profiles.
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Efficiency of proximal bundle methods
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization
- Generalized Bundle Methods
- Gradient sliding for composite optimization
- Level bundle methods for oracles with on-demand accuracy
- New variants of bundle methods
- Newton's method for convex programming and Tschebyscheff approximation
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Proximity control in bundle methods for convex nondifferentiable minimization
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
- Survey of Bundle Methods for Nonsmooth Optimization
- The Cutting-Plane Method for Solving Convex Programs
- Variable metric bundle methods: From conceptual to implementable forms
Cited in
(3)
This page was built for publication: A multi-step doubly stabilized bundle method for nonsmooth convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2177698)
