A generalized subgradient method with relaxation step

DOI10.1007/BF01585999zbMath0846.90096OpenAlexW2026722928MaRDI QIDQ1914075

Ulf Brännlund

Publication date: 30 September 1996

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

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

zbMATH Keywords

projection methodslinear convergence rategeneralized subgradient algorithmrelaxation step

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

A fifth bibliography of fractional programming^* ⋮ An exact algorithm for the modular hub location problem with single assignments ⋮ On the computational efficiency of subgradient methods: a case study with Lagrangian bounds ⋮ An inexact modified subgradient algorithm for nonconvex optimization ⋮ Lagrangean/surrogate relaxation for generalized assignment problems ⋮ Convergence rates of subgradient methods for quasi-convex optimization problems ⋮ Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of a generalized subgradient method for nondifferentiable convex optimization
• A descent proximal level bundle method for convex nondifferentiable optimization
• New variants of bundle methods
• Methods of descent for nondifferentiable optimization
• An aggregate subgradient method for nonsmooth convex minimization
• Fractional Programming. I, Duality
• Minimization of unsmooth functionals
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities