A bundle Bregman proximal method for convex nondifferentiable minimization

DOI10.1007/s101070050056zbMath0955.90101OpenAlexW2062525688MaRDI QIDQ1300267

Krzysztof C. Kiwiel

Publication date: 4 March 2001

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070050056

zbMATH Keywords

convex programmingnondifferentiable optimizationproximal methods\(B\)-functionsBregman proximal minimizationgeneralized Bregman function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (12)

Survey of Bundle Methods for Nonsmooth Optimization ⋮ A bundle modification strategy for convex minimization ⋮ Bundle methods for sum-functions with ``easy components: applications to multicommodity network design ⋮ On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems ⋮ A multistage stochastic programming approach for preventive maintenance scheduling of GENCOs with natural gas contract ⋮ Essentials of numerical nonsmooth optimization ⋮ A proximal cutting plane method using Chebychev center for nonsmooth convex optimization ⋮ Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming ⋮ On the choice of explicit stabilizing terms in column generation ⋮ A proximal trust-region algorithm for column generation stabilization ⋮ Essentials of numerical nonsmooth optimization ⋮ About Lagrangian methods in integer optimization

This page was built for publication: A bundle Bregman proximal method for convex nondifferentiable minimization