A proximal bundle method based on approximate subgradients

From MaRDI portal
Publication:5948403

DOI10.1023/A:1011259017643zbMath1054.90053MaRDI QIDQ5948403

Michael Hintermüller

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 operatorAn inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problemsProbabilistic optimization via approximate \(p\)-efficient points and bundle methodsLevel bundle methods for oracles with on-demand accuracyUncontrolled inexact information within bundle methodsAn approximate bundle method for solving nonsmooth equilibrium problemsOn approximations with finite precision in bundle methods for nonsmooth optimizationA quasi-Newton bundle method based on approximate subgradientsAn approximate quasi-Newton bundle-type method for nonsmooth optimizationA proximal bundle method with inexact data for convex nondifferentiable minimizationAn approximate \(\mathcal U\)-Lagrangian and algorithm to \(\mathcal{UV}\) decompositionComputing proximal points of convex functions with inexact subgradientsA redistributed proximal bundle method for nonsmooth nonconvex functions with inexact informationFirst-order methods of smooth convex optimization with inexact oracleLevel bundle methods for constrained convex optimization with various oraclesNew proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact informationA decomposition algorithm for convex nondifferentiable minimization with errorsGlobal optimization for non-convex programs via convex proximal point methodA Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational InequalitiesA proximal bundle method for constrained nonsmooth nonconvex optimization with inexact informationA proximal analytic center cutting plane algorithm for solving variational inequality problemsAn alternating linearization method with inexact data for bilevel nonsmooth convex optimizationA cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functionsConvex proximal bundle methods in depth: a unified analysis for inexact oraclesAn inexact spectral bundle method for convex quadratic semidefinite programmingAn approximate decomposition algorithm for convex minimizationA new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimizationIncremental-like bundle methods with application to energy planningBundle Method for Non-Convex Minimization with Inexact Subgradients and Function ValuesAn Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert SpaceA proximal bundle method for nonsmooth nonconvex functions with inexact informationEssentials of numerical nonsmooth optimizationAn inexact bundle variant suited to column generationBenders decomposition with adaptive oracles for large scale optimizationA proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact dataA geometric integration approach to nonsmooth, nonconvex optimisationRevisiting augmented Lagrangian dualsEssentials of numerical nonsmooth optimizationA doubly stabilized bundle method for nonsmooth convex optimization