An effective line search for the subgradient method
type: Item
instance of: scholarly article
title: An effective line search for the subgradient method
zbMATH Open document ID: 1114.90122
published in: Journal of Optimization Theory and Applications
publication date: 2005-06-09T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C52
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2174500
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: multiplier updating
zbMATH Keywords: subgradient method
zbMATH Keywords: radar unit commitment
author: Carlos Beltran
author: F. J. Heredia
MaRDI profile type: Publication
full work available at URL: s10957-004-1708-4
OpenAlex ID: W2003563489
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
cites work: Q4000249
cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
cites work: On improvements to the analytic center cutting plane method
cites work: Parallel implementation of a central decomposition method for solving large-scale planning problems
cites work: Accelerating the convergence of subgradient optimisation
cites work: The volume algorithm: Producing primal solutions with a subgradient method
cites work: Incremental subgradient methods for nondifferentiable optimization
cites work: The efficiency of ballstep subgradient level methods for convex optimization
cites work: Unit commitment by augmented Lagrangian relaxation: testing two decomposition approaches
DOI: 10.1007/S10957-004-1708-4
description: scientific article; zbMATH DE number 2174500