A multi-step doubly stabilized bundle method for nonsmooth convex optimization
From MaRDI portal
Publication:2177698
DOI10.1016/j.amc.2020.125154zbMath1474.90346OpenAlexW3008325510MaRDI QIDQ2177698
Shuai Liu, Xiaomei Ou, Chun-Ming Tang, Jin-Bao Jian
Publication date: 6 May 2020
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2020.125154
global convergencenonsmooth optimizationmulti-step schemedescent test criteriondoubly stabilized bundle method
Related Items
Unnamed Item ⋮ A new restricted memory level bundle method for constrained convex nonsmooth optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- A doubly stabilized bundle method for nonsmooth convex optimization
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Gradient sliding for composite optimization
- An optimal method for stochastic composite optimization
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Proximity control in bundle methods for convex nondifferentiable minimization
- Newton's method for convex programming and Tschebyscheff approximation
- Variable metric bundle methods: From conceptual to implementable forms
- Efficiency of proximal bundle methods
- Accelerated schemes for a class of variational inequalities
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
- New variants of bundle methods
- Accelerated gradient sliding for structured convex optimization
- A proximal-projection partial bundle method for convex constrained minimax problems
- A simple version of bundle method with linear programming
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Level bundle methods for oracles with on-demand accuracy
- The Cutting-Plane Method for Solving Convex Programs
- 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
- Generalized Bundle Methods
- Survey of Bundle Methods for Nonsmooth Optimization
- An Accelerated Linearized Alternating Direction Method of Multipliers
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Benchmarking optimization software with performance profiles.
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
