An Algorithm for Nonsmooth Convex Minimization With Errors

DOI10.2307/2008055zbMath0584.65034OpenAlexW4240630660MaRDI QIDQ3707271

Krzysztof C. Kiwiel

Publication date: 1985

Full work available at URL: https://doi.org/10.2307/2008055

zbMATH Keywords

iterationdescent methodsnonsmooth convex minimizationaggregate subgradients

Mathematics Subject Classification ID

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

Related Items (14)

Approximations in proximal bundle methods and decomposition of convex programs ⋮ On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization ⋮ An approximate bundle method for solving nonsmooth equilibrium problems ⋮ An approximate quasi-Newton bundle-type method for nonsmooth optimization ⋮ A proximal bundle method with inexact data for convex nondifferentiable minimization ⋮ Adaptive Bundle Methods for Nonlinear Robust Optimization ⋮ A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems ⋮ A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information ⋮ A proximal analytic center cutting plane algorithm for solving variational inequality problems ⋮ A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence ⋮ Incremental-like bundle methods with application to energy planning ⋮ Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values ⋮ An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information ⋮ An inexact bundle variant suited to column generation

This page was built for publication: An Algorithm for Nonsmooth Convex Minimization With Errors