Spectral projected subgradient with a momentum term for the Lagrangean dual approach
type: Item
instance of: scholarly article
title: Spectral projected subgradient with a momentum term for the Lagrangean dual approach
zbMATH Open document ID: 1137.90016
author: Alejandro Crema
author: Milagros C. Loreto
author: M. Raydan
published in: Computers \& Operations Research
publication date: 2007-04-26T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 5146814
zbMATH Keywords: spectral projected gradient
zbMATH Keywords: subgradient optimization
zbMATH Keywords: set covering problems
zbMATH Keywords: generalized assignment problems
describes a project that uses: SPG
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: j.cor.2005.11.024
OpenAlex ID: W2024804345
cites work: Q5187067
cites work: Validation of subgradient optimization
cites work: Q4101754
cites work: On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets
cites work: Error stability properties of generalized gradient-type algorithms
cites work: An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
cites work: Integer Programming Algorithms: A Framework and State-of-the-Art Survey
cites work: Q4178782
cites work: On convergence rates of subgradient optimization methods
cites work: Q3968756
cites work: Algorithm 813
cites work: On the Goldstein-Levitin-Polyak gradient projection method
cites work: Convex programming in Hilbert space
cites work: Q5545684
cites work: Two-Point Step Size Gradient Methods
cites work: \(R\)-linear convergence of the Barzilai and Borwein gradient method
cites work: Q3477903
cites work: On the Barzilai and Borwein choice of steplength for the gradient method
cites work: Q5702604
cites work: A Nonmonotone Line Search Technique for Newton’s Method
cites work: The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
cites work: An algorithm for set covering problem
cites work: A Heuristic Method for the Set Covering Problem
cites work: Incremental subgradient methods for nondifferentiable optimization
cites work: Modeling Facility Location Problems as Generalized Assignment Problems
cites work: A genetic algorithm for the generalised assignment problem
DOI: 10.1016/J.COR.2005.11.024
description: scientific article; zbMATH DE number 5146814