Level bundle-like algorithms for convex optimization
From MaRDI portal
Recommendations
- Level bundle methods for constrained convex optimization with various oracles
- scientific article; zbMATH DE number 764394
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Generalized Bundle Methods
Cites work
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- A branch and bound method for stochastic global optimization
- A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
- A descent proximal level bundle method for convex nondifferentiable optimization
- A strongly convergent method for nonsmooth convex minimization in Hilbert spaces
- Approximate level method for nonsmooth convex minimization
- Benchmarking optimization software with performance profiles.
- Bundle-type methods for inexact data
- Extension of subgradient techniques for nonsmooth optimization in Banach spaces
- Inexact bundle methods for two-stage stochastic programming
- Lectures on Stochastic Programming
- Level bundle methods for oracles with on-demand accuracy
- Minimization of unsmooth functionals
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Monte Carlo sampling approach to stochastic programming
- New variants of bundle methods
- Non-Euclidean restricted memory level method for large-scale convex optimization
- On the choice of step size in subgradient optimization
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- Variable target value subgradient method
Cited in
(9)- Adaptive sequential sample average approximation for solving two-stage stochastic linear programs
- A doubly stabilized bundle method for nonsmooth convex optimization
- Level bundle methods for constrained convex optimization with various oracles
- Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization
- A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization
- On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
This page was built for publication: Level bundle-like algorithms for convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q743968)
