A proximal bundle method based on approximate subgradients
From MaRDI portal
Publication:5948403
DOI10.1023/A:1011259017643zbMath1054.90053MaRDI QIDQ5948403
Publication date: 2001
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Related Items
A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator ⋮ An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems ⋮ Probabilistic optimization via approximate \(p\)-efficient points and bundle methods ⋮ Level bundle methods for oracles with on-demand accuracy ⋮ Uncontrolled inexact information within bundle methods ⋮ An approximate bundle method for solving nonsmooth equilibrium problems ⋮ On approximations with finite precision in bundle methods for nonsmooth optimization ⋮ A quasi-Newton bundle method based on approximate subgradients ⋮ An approximate quasi-Newton bundle-type method for nonsmooth optimization ⋮ A proximal bundle method with inexact data for convex nondifferentiable minimization ⋮ An approximate \(\mathcal U\)-Lagrangian and algorithm to \(\mathcal{UV}\) decomposition ⋮ Computing proximal points of convex functions with inexact subgradients ⋮ A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ First-order methods of smooth convex optimization with inexact oracle ⋮ Level bundle methods for constrained convex optimization with various oracles ⋮ New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information ⋮ A decomposition algorithm for convex nondifferentiable minimization with errors ⋮ Global optimization for non-convex programs via convex proximal point method ⋮ A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities ⋮ A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information ⋮ A proximal analytic center cutting plane algorithm for solving variational inequality problems ⋮ An alternating linearization method with inexact data for bilevel nonsmooth convex optimization ⋮ A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions ⋮ Convex proximal bundle methods in depth: a unified analysis for inexact oracles ⋮ An inexact spectral bundle method for convex quadratic semidefinite programming ⋮ An approximate decomposition algorithm for convex minimization ⋮ A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization ⋮ Incremental-like bundle methods with application to energy planning ⋮ Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values ⋮ An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space ⋮ A proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ Essentials of numerical nonsmooth optimization ⋮ An inexact bundle variant suited to column generation ⋮ Benders decomposition with adaptive oracles for large scale optimization ⋮ A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data ⋮ A geometric integration approach to nonsmooth, nonconvex optimisation ⋮ Revisiting augmented Lagrangian duals ⋮ Essentials of numerical nonsmooth optimization ⋮ A doubly stabilized bundle method for nonsmooth convex optimization
