A doubly stabilized bundle method for nonsmooth convex optimization
From MaRDI portal
(Redirected from Publication:263188)
Recommendations
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization
- A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions
- An implementable bundle method for nonsmooth convex optimization
- A hybrid bundle method for nonsmooth convex optimization
- A proximal bundle method for nonsmooth and nonconvex constrained optimization
Cites work
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- A descent proximal level bundle method for convex nondifferentiable optimization
- A proximal bundle method based on approximate subgradients
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- Benchmarking optimization software with performance profiles.
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Bundle-type methods for inexact data
- Composite proximal bundle method
- Convergence of some algorithms for convex minimization
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Generalized Bundle Methods
- Inexact bundle methods for two-stage stochastic programming
- Level bundle methods for constrained convex optimization with various oracles
- Level bundle methods for oracles with on-demand accuracy
- Level bundle-like algorithms for convex optimization
- New variants of bundle methods
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- On approximations with finite precision in bundle methods for nonsmooth optimization
- Piecewise-quadratic approximations in convex numerical optimization
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- Proximity control in bundle methods for convex nondifferentiable minimization
- Variable metric bundle methods: From conceptual to implementable forms
Cited in
(30)- Essentials of numerical nonsmooth optimization
- Composite proximal bundle method
- Target radius methods for nonsmooth convex optimization
- Outer-approximation algorithms for nonsmooth convex MINLP problems
- Optimal Convergence Rates for the Proximal Bundle Method
- Minimizing Piecewise-Concave Functions Over Polyhedra
- Stabilized Benders decomposition for energy planning under climate uncertainty
- Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions
- Essentials of numerical nonsmooth optimization
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
- Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization
- Minimizing oracle-structured composite functions
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
- Proximal bundle methods for nonsmooth DC programming
- Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley
- Risk-averse stochastic programming and distributionally robust optimization via operator splitting
- On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems
- The method of codifferential descent for convex and global piecewise affine optimization
- An approximate bundle method for non-convex optimization and its dual problem
- Uncontrolled inexact information within bundle methods
- Implementation of an oracle-structured bundle method for distributed optimization
- A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems
- A new restricted memory level bundle method for constrained convex nonsmooth optimization
- Fast proximal algorithms for nonsmooth convex optimization
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization
- Regularized optimization methods for convex MINLP problems
- Generalized Bundle Methods
- A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions
This page was built for publication: A 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 Q263188)
