New bundle methods for solving Lagrangian relaxation dual problems
type: Item
instance of: scholarly article
title: New bundle methods for solving Lagrangian relaxation dual problems
zbMATH Open document ID: 1015.90089
DOI: 10.1023/A:1014839227049
author: D. Kharzeev
published in: Journal of Optimization Theory and Applications
publication date: 2002-10-08T00:00:00Z
Mathematics Subject Classification ID: 90C56
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90B36
zbMATH DE Number: 1812473
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: bundle methods
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: manufacturing scheduling
MaRDI profile type: Publication
cites work: Surrogate gradient algorithm for Lagrangian relaxation
cites work: Q4040221
cites work: Validation of subgradient optimization
cites work: Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
cites work: An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
cites work: Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
cites work: Q3241581
cites work: Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
full work available at URL: a:1014839227049
OpenAlex ID: W1554465673
description: scientific article; zbMATH DE number 1812473