Survey of Bundle Methods for Nonsmooth Optimization

DOI10.1080/10556780290027828zbMath1050.90027OpenAlexW2022150446WikidataQ110032620 ScholiaQ110032620MaRDI QIDQ4806340

Publication date: 18 June 2003

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780290027828

zbMATH Keywords

nonsmooth optimization bundle methods nondifferentiable programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

A Trust-region Method for Nonsmooth Nonconvex Optimization ⋮ Comparing different nonsmooth minimization methods and software ⋮ A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator ⋮ Direct search nonsmooth constrained optimization via rounded ℓ₁ penalty functions ⋮ Generalized derivatives of computer programs ⋮ Tuning strategy for the proximity parameter in convex minimization ⋮ A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process ⋮ New limited memory bundle method for large-scale nonsmooth optimization ⋮ A new trust region method for nonsmooth nonconvex optimization ⋮ A vector forward mode of automatic differentiation for generalized derivative evaluation ⋮ Convergence and computational analyses for some variable target value and subgradient deflection methods ⋮ A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs ⋮ An optimal variant of Kelley's cutting-plane method ⋮ Non-smooth predictive control for mechanical transmission systems with backlash-like hysteresis ⋮ A Deep Learning Method for Elliptic Hemivariational Inequalities ⋮ A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes ⋮ Globally convergent limited memory bundle method for large-scale nonsmooth optimization ⋮ A bundle modification strategy for convex minimization ⋮ Unit commitment in oligopolistic markets by nonlinear mixed variable programming ⋮ A multi-step doubly stabilized bundle method for nonsmooth convex optimization ⋮ An extension of the quasi-Newton method for minimizing locally Lipschitz functions ⋮ Nonsmooth exclusion test for finding all solutions of nonlinear equations ⋮ Descent algorithm for nonsmooth stochastic multiobjective optimization ⋮ An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization ⋮ Clusterwise support vector linear regression ⋮ Adaptive Bundle Methods for Nonlinear Robust Optimization ⋮ Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut ⋮ Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs ⋮ A new achievement scalarizing function based on parameterization in multiobjective optimization ⋮ An error estimate for bilateral contact problem with nonmonotone friction between two electroelastic bodies ⋮ A new nonmonotone line search method for nonsmooth nonconvex optimization ⋮ A Support Function Based Algorithm for Optimization with Eigenvalue Constraints ⋮ A partially inexact bundle method for convex semi-infinite minmax problems ⋮ A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION ⋮ Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions ⋮ Spectral projected subgradient method for nonsmooth convex optimization problems ⋮ On sensitivity analysis of nonsmooth multidisciplinary optimization problems in engineering process line applications ⋮ A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems ⋮ Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs ⋮ Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY ⋮ Diagonal bundle method for nonsmooth sparse optimization ⋮ Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization ⋮ Smoothing quadratic regularization method for hemivariational inequalities ⋮ A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming ⋮ A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization ⋮ A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization ⋮ Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions ⋮ Derivative-free optimization via proximal point methods ⋮ A fast gradient and function sampling method for finite-max functions ⋮ A convergence analysis of the method of codifferential descent ⋮ An inexact spectral bundle method for convex quadratic semidefinite programming ⋮ Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem ⋮ Codifferential method for minimizing nonsmooth DC functions ⋮ On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems ⋮ Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization ⋮ Reachability Analysis and Deterministic Global Optimization of DAE Models ⋮ A convex approach for NMPC based on second order Volterra series models ⋮ An effective adaptive trust region algorithm for nonsmooth minimization ⋮ Randomized smoothing variance reduction method for large-scale non-smooth convex optimization ⋮ Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming ⋮ Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions ⋮ The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming ⋮ Essentials of numerical nonsmooth optimization ⋮ An implementation of a reduced subgradient method via Luenberger-Mokhtar variant ⋮ Diagonal discrete gradient bundle method for derivative free nonsmooth optimization ⋮ Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs ⋮ Subgradient and Bundle Methods for Nonsmooth Optimization ⋮ On the generalization of ECP and OA methods to nonsmooth convex MINLP problems ⋮ An Algorithm Using Trust Region Strategy for Minimization of a Nondifferentiable Function ⋮ A new restricted memory level bundle method for constrained convex nonsmooth optimization ⋮ A splitting bundle approach for non-smooth non-convex minimization ⋮ On the computation of an element of Clarke generalized Jacobian for a vector-valued max function ⋮ The method of codifferential descent for convex and global piecewise affine optimization ⋮ A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems ⋮ Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems ⋮ Essentials of numerical nonsmooth optimization ⋮ An analytical and numerical approach to a bilateral contact problem with nonmonotone friction ⋮ Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization

Uses Software

NIMBUS

Cites Work